Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Information Processing Letters
Selection predicate indexing for active databases using interval skip lists
Information Systems
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Query Processing Algorithms for Temporal Intersection Joins
Proceedings of the Seventh International Conference on Data Engineering
Efficient Computation of Spatial Joins
Proceedings of the Ninth 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
Efficient Evaluation of the Valid-Time Natural Join
Proceedings of the Tenth International Conference on 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
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Scalable Sweeping-Based Spatial Join
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
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
The Time Index: An Access Structure for Temporal Data
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
On Spatially Partitioned Temporal Join
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Query Processing Techniques for Multiversion Access Methods
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient Temporal Join Processing Using Time Index
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Efficient Processing of Time-Joins in Temporal Data Bases
Proceedings of the 3rd International Conference on Database Systems for Advanced Applications (DASFAA)
XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
DEXA '98 Proceedings of the 9th International Conference on Database and Expert Systems Applications
Incremental Join of Time-Oriented Data
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
Index Based Processing of Semi-Restrictive Temporal Joins
TIME '02 Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME'02)
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
Efficient Temporal Join Processing Using Indices
ICDE '02 Proceedings of the 18th 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
A generalised temporal algebra
Data & Knowledge Engineering
Efficient position-independent iconic search using an R-theta index
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Efficient join processing over uncertain data
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
MedSMan: a live multimedia stream querying system
Multimedia Tools and Applications
Solving the Problem of Trans-Genomic Query with Alignment Tables
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Multi-dimensional aggregation for temporal data
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Distributed intersection join of complex interval sequences
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Using temporal semantics for live media stream queries
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
ChronoZoom: travel through time for education, exploration, and information technology research
Proceedings of the 2nd annual conference on Research in information technology
| Hi-index | 0.01 |
The increasing use of temporal and spatial data in present-day relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms do not support those data types adequately, whereas special approaches for interval joins usually require an augmentation of the internal access methods which is not supported by existing relational systems. To overcome these problems we introduce new join algorithms for interval data. Based on the Relational Interval Tree, these algorithms can easily be implemented on top of any relational database system while providing excellent performance on joining intervals. As experimental results on an Oracle9i server show, the new techniques outperform existing relational methods for joining intervals significantly.