The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
The buddy tree: an efficient and robust access method for spatial data base
Proceedings of the sixteenth international conference on Very large databases
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient indexing of high-dimensional data through dimensionality reduction
Data & Knowledge Engineering
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
A retrieval technique for high-dimensional data and partially specified queries
Data & Knowledge Engineering
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree
MDM '02 Proceedings of the Third International Conference on Mobile Data Management
SEB-tree: An Approach to Index Continuously Moving Objects
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data
ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Literature review of spatio-temporal database models
The Knowledge Engineering Review
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
A compact space decomposition for effective metric indexing
Pattern Recognition Letters
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Query and update efficient B+-tree based indexing of moving objects
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient and compact indexing structure for processing of spatial queries in line-based databases
Data & Knowledge Engineering
Using B+-trees for processing of line segments in large spatial databases
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
This paper proposes a novel economic and efficient framework of indexing spatiotemporal objects based on compressed B+-trees. Our new index technique can compress data records in leaves and in turn reduce index size to improve update and query efficiencies. The contribution of our framework is threefold. First, the proposed index structures are more succinct to resident in the main memory. Second, sufficient data with high similarity inside all indexing pages for the high retrieval quality of cache fetches are attainable. Third, in addition to process multi-dimensional spatial information, our framework is typically appropriate to model the valid- and transaction-time of a fact. We present the index efficiency analyses and experimental results which show that our technique outperforms others.