DMCA
A Fun Application of Compact Data Structures to Indexing Geographic Data
| Citations: | 10 - 7 self |
BibTeX
@MISC{Brisaboa_afun,
author = {Nieves R. Brisaboa and Miguel R. Luaces and Gonzalo Navarro and Diego Seco},
title = {A Fun Application of Compact Data Structures to Indexing Geographic Data },
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In this paper we propose an original approach to represent geographic data based on compact data structures used in other fields such as text or image compression. A wavelet tree-based structure allows us to represent minimum bounding rectangles solving geographic range queries in logarithmic time. A comparison with classical spatial indexes, such as the R-tree, shows that our structure can be considered as a fun, yet seriously competitive, alternative to these classical approaches.
Keyphrases
compact data structure fun application indexing geographic data geographic data image compression way memory hierarchy new challenge wavelet tree geographic range query classical approach spatial access method key word classical spatial index range query minimum bounding rectangle recent decade wavelet tree-based structure logarithmic time original approach
