Safe Haskell | None |
---|---|
Language | Haskell98 |
Cache tree database
On-memory database using a B+ tree, useful for an ordered cache.
- Persistence: volatile
- Algorithm: B+ tree
- Complexity: O(log n)
- Sequence: custom order
- Lock unit: page (mutex)
- data CacheTree
- data CacheTreeOptions = CacheTreeOptions {
- options :: [Options]
- buckets :: Maybe Int64
- compressor :: Maybe Compressor
- maxRecords :: Maybe Int64
- cipherKey :: Maybe String
- pageSize :: Maybe Int64
- comparator :: Maybe Comparator
- pageCacheSize :: Maybe Int64
- defaultCacheTreeOptions :: CacheTreeOptions
- data Compressor
- data Options = Compress
- data Comparator
- makeCacheTree :: LoggingOptions -> CacheTreeOptions -> Mode -> IO CacheTree
Documentation
data CacheTreeOptions Source
CacheTreeOptions | |
|
data Compressor Source
Compression algorithm used. DEFLATE
is the default one.
General tuning options
Compress | Enable compression of the keys and the values |
data Comparator Source
Comparator used in the tree. Lexical
by default.
makeCacheTree :: LoggingOptions -> CacheTreeOptions -> Mode -> IO CacheTree Source