Benchmarking Coding Algorithms for the R-tree Compression

Provided by: RWTH Aachen University
Topic: Data Management
Format: PDF
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications in different domain fields. When a compression of these data structures is considered, the authors follow two objectives. The first objective is a smaller index file, the second one is a reduction of the query processing time. In this paper, they apply a compression scheme to fit these objectives. This compression scheme handles compressed nodes in a secondary storage.

Find By Topic