Berkeley DB: btree prefix comparison for directory-like keys?

Posted by Mark Harrison on Stack Overflow See other posts from Stack Overflow or by Mark Harrison
Published on 2010-04-10T00:43:54Z Indexed on 2010/04/10 0:53 UTC
Read the original article Hit count: 290

Filed under:

I'm going to index a BDB with keys that look a lot like directory paths ('/foo/bar', '/foo/baz', etc, with levels of slashes generally < 10).

Does anybody have any experience with using a Btree prefix comparison routine[1] for this? Are the savings worthwhile? Any references to experience papers on this subject?

[1] http://www.stanford.edu/class/cs276a/projects/docs/berkeleydb/ref/am_conf/bt_prefix.html

© Stack Overflow or respective owner

Related posts about berkeley-db