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
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Segment indexes: dynamic indexing techniques for multi-dimensional interval data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Indexing for data models with constraints and classes (extended abstract)
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Indexing temporal data using existing B+-trees
Data & Knowledge Engineering
On the semantics of “now” in databases
ACM Transactions on Database Systems (TODS)
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
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
Efficient Indexing for Constraint and Temporal Databases
ICDT '97 Proceedings of the 6th International Conference on Database Theory
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th 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
XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Interval Sequences: An Object-Relational Approach to Manage Spatial Data
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Object-Relational Indexing for General Interval Relationships
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Joining interval data in relational databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Design and development of a multiversion OLAP application
Proceedings of the 2006 ACM symposium on Applied computing
Editorial: BioDB: An ontology-enhanced information system for heterogeneous biological information
Data & Knowledge Engineering
Stabbing horizontal segments with vertical rays
Proceedings of the twenty-eighth annual symposium on Computational geometry
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 |
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an efficient support of queries that contain selections on interval attributes as well as simple-valued attributes (e.g. numbers, strings) at the same time, special index structures are required supporting both types of predicates in combination. Based on the Relational Interval Tree, we present various indexing schemes that support such combined queries and can be integrated in relational database systems with minimum effort. Experiments on different query types show superior performance for the new techniques in comparison to competing access methods.