On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Developing time-oriented database applications in SQL
Developing time-oriented database applications in SQL
Efficient Indexing for Constraint and Temporal Databases
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Managing Intervals Efficiently in Object-Relational Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Object-Relational Indexing for General Interval Relationships
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Temporal Data and the Relational Model
Temporal Data and the Relational Model
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
Variable granularity space filling curve for indexing multidimensional data
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
A triangular decomposition access method for temporal data - TD-tree
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
Indexing RFID data using the VG-curve
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
Journal of Intelligent Information Systems
Hi-index | 0.00 |
Temporal and spatio-temporal data are present in many modern application systems, including monitoring moving objects. Such systems produce enormous volume of data, and therefore efficient indexing method is crucial. In this paper, we investigate and present a new concept based on virtual index structure, which can efficiently query such data. Concept is based on spatial representation of interval data and a recursive triangular decomposition of that space. The empirical performance of presented concept is demonstrated to be superior to its best known competitors.