Compressing Relations and Indexes
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Efficient Processing of Spatial Queries in Line Segment Databases
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Speeding up construction of PMR quadtree-based spatial indexes
The VLDB Journal — The International Journal on Very Large Data Bases
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Dual-heap kNN: k-nearest neighbor search for spatial data retrieval in embedded DBMS
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
| Hi-index | 0.00 |
Focusing on applying a spatial database management system to embedded devices, we present a spatial search processing method. First, we consider disk storage space to be a severe constraint in embedded devices, we propose a spatial index tree based on the PMR quadtree to reduce the required disk storage space. Second, since we consider it necessary to shorten the processing time for a spatial search in embedded devices, we present efficient range search algorithm in our index tree. The simulation results show that our index tree has a smaller disk storage space requirement than conventional index trees, and our range search method does not require as many disk accesses as conventional methods.