Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 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
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
Indexing of Moving Objects for Location-Based Services
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
STRIPES: an efficient index for predicted trajectories
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
B-tree indexes for high update rates
ACM SIGMOD Record
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Robust B+-Tree-Based Indexing of Moving Objects
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Indexing future trajectories of moving objects in a constrained network
Journal of Computer Science and Technology
Supporting frequent updates in R-trees: a bottom-up approach
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Continuous online index tuning in moving object databases
ACM Transactions on Database Systems (TODS)
Using compressed index structures for processing moving objects in large spatio-temporal databases
Journal of Systems and Software
Bs-tree: a self-tuning index of moving objects
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Hi-index | 0.00 |
In recent years, management of moving objects has emerged as an active topic of spatial access methods. Various data structures (indexes) have been proposed to handle queries of moving points, for example, the well-known Bx-tree uses a novel mapping mechanism to reduce the index update costs. However, almost all the existing indexes for predictive queries are not applicable in certain circumstances when the update frequencies of moving objects become highly variable and when the system needs to balance the performance of updates and queries. In this paper, we introduce two kinds of novel indexes, named By-tree and αBy-tree. By associating a prediction life period with every moving object, the proposed indexes are applicable in the environments with highly variable update frequencies. In addition, the αBy-tree can balance the performance of updates and queries depending on a balance parameter. Experimental results show that the By-tree and αBy-tree outperform the Bx-tree in various conditions.