Lossless R-tree compression using variable-length codes.
Peter ChovanecMichal KrátkýJirí WalderPublished in: ICITST (2010)
Keyphrases
- variable length
- r tree
- convolutional codes
- text compression
- image compression
- entropy coding
- arithmetic coding
- fixed length
- lossless compression
- index structure
- range queries
- multi dimensional
- compression algorithm
- compression ratio
- spatial data
- query processing
- bitstream
- data structure
- compression scheme
- n gram
- similarity search
- b tree
- data compression
- spatial index
- indexing methods
- tree structure
- bit errors
- data distribution
- error correction
- image quality
- databases
- human motion
- indexing techniques
- knn
- multiresolution
- information retrieval
- source coding
- machine learning
- data mining