A Quadtree-Based Dynamic Attribute Indexing Method
J. Tayeb · The Computer Journal · 1998
Dynamic attributes are attributes that change continuously over time making it impractical to issue explicit updates for every change. In this paper, we adapt a variant of the quadtree structure to solve the problem of indexing dynamic attributes. The approach is based on the key idea of using a linear function of time for each dynamic attribute that allows us to predict its value in the future. We contribute an algorithm for regenerating the quadtree-based index periodically that minimizes CPU and disk access cost. We also provide an experimental study of performance focusing on query processing and index update overheads.
Cited by 206 works. doi:10.1093/comjnl/41.3.185 Open-access PDF
References
- The design and analysis of spatial data structures
- The Quadtree and Related Hierarchical Data Structures
- Multi-step processing of spatial joins
- Mobile wireless computing: challenges in data management
- Efficient processing of spatial joins using R-trees
- Modeling and querying moving objects
- The design and analysis of spatial data structures
- Database system issues in nomadic computing
- A Quadtree-Based Dynamic Attribute Indexing Method
- Cost and imprecision in modeling the position of moving objects