Displaying 1 to 6 from 6 results

gods - GoDS (Go Data Structures)

  •    Go

Implementation of various data structures and algorithms in Go.Containers are either ordered or unordered. All ordered containers provide stateful iterators and some of them allow enumerable functions.

ForestDB - A Fast Key-Value Storage Engine Based on Hierarchical B+-Tree Trie

  •    C++

ForestDB is a key-value storage engine developed by Couchbase Caching and Storage Team, and its main index structure is built from Hierarchical B+-Tree based Trie, called HB+-Trie. ForestDB paper has been published in IEEE Transactions on Computers.

locket - A pure-JavaScript implementation of LevelDB for LevelUP.

  •    Javascript

Salvage Necklace 5: Inside Locket by B Zedan. A pure-JavaScript LevelDB implementation backed by a durable and persistent evented I/0 b-tree for use with LevelUP.




strata - Evented I/O B-tree for Node.js.

  •    Javascript

The Wave by Rick Z.. An Evented I/O B-tree for Node.js.

mddf - multi-dimensional data format with attachments for proximity search using a kd-b tree

  •    Javascript

Multidimensional data is important for maps, because you are always interested in things within a range defined in two or three dimensions (though mddf can do N dimensions). Many popular methods of storing map data are not memory efficient, and you must load the entire dataset into RAM or a specialized heavy database engine before it can be used. mddf arranges data more sensibly, so it's actually possible to seek into the file, reading only a small segment, and pull out a collection of nearby points. This means map programs could load fast, work with massive maps and run on tiny devices.There is nothing in mddf that is specifically about maps, but that is the use case that motivates this work.