Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
Temporal databases: theory, design, and implementation
Temporal databases: theory, design, and implementation
Indexing temporal data using existing B+-trees
Data & Knowledge Engineering
SQL: 1999, formerly known as SQL3
ACM SIGMOD Record
Developing time-oriented database applications in SQL
Developing time-oriented database applications in SQL
Maintaining knowledge about temporal intervals
Communications of the ACM
Adaptive precision setting for cached approximate values
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
Indexing Valid Time Databases via B+-Trees
IEEE Transactions on Knowledge and Data Engineering
Inclusion of New Types in Relational Data Base Systems
Proceedings of the Second International Conference on Data Engineering
Efficient Indexing for Constraint and Temporal Databases
ICDT '97 Proceedings of the 6th International Conference on Database Theory
High-Performance Extensible Indexing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
High Level Indexing of User-Defined Types
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Managing Intervals Efficiently in Object-Relational Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Developing a DataBlade for a New Index
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Extensible Indexing: a Framework for Integrating Domain-Specific Indexing Schemes into Oracle8i
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Stratum Approaches to Temporal DBMS Implementation
IDEAS '98 Proceedings of the 1998 International Symposium on Database Engineering & Applications
Efficient Sequenced Temporal Integrity Checking
ICDE '01 Proceedings of the 17th International Conference on Data Engineering
Efficiently processing queries on interval-and-value tuples in relational databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Indexing temporal data with virtual structure
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Similarity search on time series based on threshold queries
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
An implicit approach to deal with periodically repeated medical data
Artificial Intelligence in Medicine
A triangular decomposition access method for temporal data - TD-tree
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
An intensional approach for periodic data in relational databases
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
Intervals represent a fundamental data type for temporal, scientific, and spatia l databases where time stamp s and point data are extended to time spans and range data, respectively. For OLTP a nd OLAP applications on large amount s of data, no t only intersection queries have to be processed efficiently but also general interval relationships including before, meets, overlaps, starts, finishes, contains, equals, during, startedBy, finishedBy, overlappedBy, metBy, and after. Our new algorithms use the Relational Interval Tree, a purely SQL-base d and object-relationally wrapped index structure. The technique therefore pre serves the industrial strength of the underlying RDBMS including stability, transactions, and performance. The efficiency of our approach is demonstrated by an experimental evaluation on a real weblog data set containing one million sessions.