Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Computer
The design and analysis of spatial data structures
The design and analysis of spatial data structures
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
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Bibliography on temporal databases
ACM SIGMOD Record
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Fundamentals of database systems (2nd ed.)
Fundamentals of database systems (2nd ed.)
An update of the temporal database bibliography
ACM SIGMOD Record
A consensus glossary of temporal database concepts
ACM SIGMOD Record
The time index+: an incremental access structure for temporal databases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
The snapshot index: an I/O-optimal access method for timeslice queries
Information Systems
Information Processing Letters
Implementing deletion in B+-trees
ACM SIGMOD Record
Indexing temporal data using existing B+-trees
Data & Knowledge Engineering
On the semantics of “now” in databases
ACM Transactions on Database Systems (TODS)
Using two B+-trees to efficiently process inclusion spatial queries (extended abstract)
GIS '97 Proceedings of the 5th ACM international workshop on Advances in geographic information systems
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
The TSQL2 Temporal Query Language
The TSQL2 Temporal Query Language
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Temporal and Real-Time Databases: A Survey
IEEE Transactions on Knowledge and Data Engineering
Efficient Indexing Methods for Temporal Relations
IEEE Transactions on Knowledge and Data Engineering
DOT: A Spatial Access Method Using Fractals
Proceedings of the Seventh International Conference on Data Engineering
Declustering Techniques for Parallelizing Temporal Access Structures
Proceedings of the Tenth International Conference on Data Engineering
The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases
Proceedings of the Tenth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Coalescing in Temporal Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Access Methods for Bi-Temporal Databases
Proceedings of the International Workshop on Temporal Databases: Recent Advances in Temporal Databases
M-IVTT: An Index for Bitemporal Databases
DEXA '96 Proceedings of the 7th International Conference on Database and Expert Systems Applications
B-trees: bearing fruits of all kinds
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
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
Light-Weight Indexing of General Bitemporal Data
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Indexing multiversion databases
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Multiversion join index for multiversion data warehouse
Information and Software Technology
Scalable architecture and query optimization fortransaction-time DBs with evolving schemas
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Hybrid index structures for temporal-textual web search
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
Data structures for multiversion data warehouse
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
High-performance complex event processing using continuous sliding views
Proceedings of the 16th International Conference on Extending Database Technology
A triangular decomposition access method for temporal data - TD-tree
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
| Hi-index | 0.00 |
We present an approach, named MAP21, which uses standard $\rm B^+$-trees to provide efficient indexing of valid time ranges. The MAP21 approach is based on mapping one dimensional ranges to one dimensional points where the lexicographical order among the ranges is preserved. The proposed approach may employ more than one tree, each indexing a disjoint subset of the indexed data. When compared to the Time Index and the $\rm R^*$-tree we show that MAP21's performance is comparable to or better than those, depending on the type of query. In terms of storage, MAP21's structure was less than 10 percent larger than the $\rm R^*$-tree's and much smaller than the Time Index's. The main contribution of this paper though, is to show that standard $\rm B^+$-trees, available in virtually any DBMS, can be used to provide an efficient temporal index.