Time Complexity of Counting Edges in OrientDB -
i retrieve total number of incoming or outgoing edges of given type to/from vertex in orientdb. obvious method construct query using count() , ine(myedgetype), oute(myedgetype), or bothe(myedgetype). however, concerned time complexity; if operation o(n) rather o(1), might better off storing number in database rather using count() each time need it, because anticipate number of edges in question becoming large. have searched documentation, not seem list time complexities of orientdb's functions. also, unsure of whether use in/out/both or ine/oute/bothe; presume e versions faster, depending on how orientdb stores edges under hood, may wrong.
is counting set of incoming/outgoing/both edges of given type to/from vertex constant-time operation--and if not, time complexity? efficient, need use ine/oute/bothe, or in/out/both? or there other method entirely i've missed?
in orientdb o(1): ine()/oute()/bothe().size()
or without edge label parameter.
wiki
Comments
Post a Comment