Search Results for "b tree"

Hitchhiker-Tree is a functional, immutable, off-heap, snapshottable sorted map data structure (a persistent key-value tree) designed for scalable, high-performance storage in Clojure / ClojureScript systems. It blends ideas from fractal trees and B-trees, supports lazy loading, and can persist incrementally to arbitrary backends. It is used as a backend for systems like Datahike and can support enormous data sets while retaining functional persistence semantics. ...

Our goal is to create the world's fastest extendable, non-transactional time series database for big data (you know, for kids)! Log file indexing is our initial focus. For example append only ASCII files produced by libraries like Log4J, or containing FIX messages or JSON objects. Occursions was built by a small team sick of creating hacks to remotely copy and/or grep through tons of large log files. We use it to index around a terabyte of new log data per day. You can use it too. Who...