Actually I am using the neo4j to execute some graph pattern query ( subgraph isomorphism). So the given query pattern will be a labeled graph and the results are all subgraphs in the database that can fit the pattern. Does the index you mentioned in the reply can achieve better performance than using labels?
On Wednesday, July 5, 2017 at 1:32:15 AM UTC-7, Michael Hunger wrote: > > It should be a rare operation if you have indexes in place > > There is a reverse store mapping labels to sets of node ids > > In 3.1 it uses a compressed lucene format > In 3.2 a custom generational b+ tree > Details for both are only in the source > > > > Von meinem iPhone gesendet > > Am 05.07.2017 um 07:31 schrieb Sun Yuhan <wdmz...@gmail.com <javascript:> > >: > > The NodeByLabelScan is very commonly used in cypher query execution plans. > However, it is not clear how this operation is executed in neo4j. > > What's more, I do not know how the label is managed and stored in neo4j. > Are there any materials online that I can refer to? Or I can refer to some > source code of neo4j to see the implementation details. > > -- > You received this message because you are subscribed to the Google Groups > "Neo4j" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to neo4j+un...@googlegroups.com <javascript:>. > For more options, visit https://groups.google.com/d/optout. > > -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to neo4j+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
