A memory efficient reachability data structure through bit vector compression.
Sebastiaan J. van SchaikOege de MoorPublished in: SIGMOD Conference (2011)
Keyphrases
- memory efficient
- bit vector
- data structure
- external memory
- wavelet tree
- quad trees
- data compression
- compression algorithm
- pattern growth
- image compression
- compressed text
- compression scheme
- efficient data structures
- bit vectors
- space efficient
- iterative deepening
- random access
- state space
- tree structure
- compression ratio
- bitmap indexes
- multidimensional data
- suffix tree
- quadtree
- frequent patterns
- index structure
- lossless compression
- transitive closure
- itemsets
- nearest neighbor
- multiresolution