Actually, I think my composite index design would work for this (if it was completed). At least the design has no node deletion actions (unlike the RTree) and so can support the batch-inserter (in principle, not in code, since it is currently coded to the normal API). Might be worth a try :-)
It does not store anything memory, other than the neo4j caches (or batch inserter cache if we port to that API), so should scale like you want. On Mon, Dec 20, 2010 at 9:54 PM, Peter Neubauer < [email protected]> wrote: > Hi folks, > I wonder if any of you has seen a fast exact index solution that works > for the batchinserter (FAST) and over big indexes (like 100M strings > of length 20characters) that don't fit in RAM. > > Lucene is unable to cache such indexes and gets slow. > > Does anybody have experiences with other reverse lookup solutions like > Berkeley DB, Ehcache or others? Would be great to combine them with > the batchinserter to be able to fast insert big edge-lists with > node-index-lookups into Neo4j ... > > Cheers, > > /peter neubauer > > GTalk: neubauer.peter > Skype peter.neubauer > Phone +46 704 106975 > LinkedIn http://www.linkedin.com/in/neubauer > Twitter http://twitter.com/peterneubauer > > http://www.neo4j.org - Your high performance graph database. > http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. > _______________________________________________ > Neo4j mailing list > [email protected] > https://lists.neo4j.org/mailman/listinfo/user > _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
