HyperLevelDB: A High-Performance LevelDB Fork

Re:HyperLevelDB: A High-Performance LevelDB Fork by halayli on Thursday June 06, 2013 @06:39PM (#5835648)

> Searching is not the same thing as a range iteration, normally if you want to search a Key/Value than you'll need to scan the entire dataset.

In this case, you lost the sorted keys advantage that BTree gives you.

My point is that this project leans more towards exact key -> value lookups and a BTree is an overkill here.

[ Parent | on HN ]

Re:HyperLevelDB: A High-Performance LevelDB Fork by monstrado on Thursday June 06, 2013 @06:51PM (#5835736)

I guess it depends on your use case, most of the use cases I've seen have been time series using range iterations which is incredibly fast, but I understand your concern if you're only using it for random gets.

[ Parent | on HN ]

Re:HyperLevelDB: A High-Performance LevelDB Fork by halayli on Thursday June 06, 2013 @07:22PM (#5835925)

Probably providing the option to create a btree or hash map would be nice.

[ Parent | on HN ]