Hi Savio, is OrientDB’s intersect algorithm optimized, like the one in Lucene? E.g. using skip lists for fast intersection?
For that kind of query are no other efficient ways possible with real graph-queries? (Especially to overcome input sensitive intersections) Is there a optimal way to model the graph for such queries? Or makes only a intersection sense? Regards, Sven > Am 07.08.2015 um 10:41 schrieb SavioL <gigi85.tempora...@gmail.com>: > > Hi Sven, > Why do you need another indexing? have you already tried to implement it > with all your complete database? ..as well as the query is too slow? > if you copy "inuuid" on edge you have a duplicate value since the same value > exists in the vertex. > If you move it from vertex to edge you sure that you do not involve any other > disadvantages? > > regards, > Savio L. > > -- > > --- > You received this message because you are subscribed to a topic in the Google > Groups "OrientDB" group. > To unsubscribe from this topic, visit > https://groups.google.com/d/topic/orient-database/xJHW2YCgBxE/unsubscribe. > To unsubscribe from this group and all its topics, send an email to > orient-database+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/d/optout. -- --- You received this message because you are subscribed to the Google Groups "OrientDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to orient-database+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
