Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases

Summary: Index schemes for queries mixing interval predicates with scalar attrs in relational DBs, built on Relational Interval Tree. Integrates with minimal effort; tests show superior performance over competing access methods for interval–value queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 9511
Venue: VLDB
Year: 2005
Pagerank: 5.093636e-05
Overall Rank: 12,757 | 12.48%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Jost Enderle (Rheinisch-Westfälische Technische Hochschule Aachen University)
2. Nicole Schneider (Rheinisch-Westfälische Technische Hochschule Aachen University)
3. Thomas Seidl (Rheinisch-Westfälische Technische Hochschule Aachen University)

BibTeX Citation

@article{enderle_vldb05,
        title = {{Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases}},
        author = {Enderle, Jost and Schneider, Nicole and Seidl, Thomas},
        journal = {PVLDB},
        series = {{VLDB} '05},
        volume = {31},
        pages = {385},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0020210012
4	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.001157935
8	The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes	1981	SIGMOD	0.00082404462
42	The R+-Tree: A Dynamic Multi-Dimensional Index for Objects	1987	VLDB	0.00046170812
335	A Taxonomy of Time in Databases	1985	SIGMOD	0.00020869676
354	Linear Clustering of Objects with Multiple Attributes	1990	SIGMOD	0.00020355578
1,139	Managing Intervals Efficiently in Object-Relational Databases	2000	VLDB	0.0001202217
1,202	Fractals for Secondary Key Retrieval	1989	PODS	0.00011672157
2,003	Indexing for Data Models with Constraints and Classes (Extended Abstract)	1993	PODS	9.3214272e-05
2,115	The Time Index: An Access Structure for Temporal Data	1990	VLDB	9.1449719e-05
2,776	Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data	1991	SIGMOD	8.1356669e-05
4,268	Joining Interval Data in Relational Databases	2004	SIGMOD	6.7925685e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,512	On the Analysis of Indexing Schemes	1997	PODS
2	6,451	Efficient Search of Multidimensional B-Trees	1995	VLDB
3	2,003	Indexing for Data Models with Constraints and Classes (Extended Abstract)	1993	PODS
4	5,501	Efficient Computation of Temporal Aggregates with Range Predicates	2001	PODS
5	9,343	R-Tree Based Indexing of Now-Relative Bitemporal Data	1998	VLDB
6	2,115	The Time Index: An Access Structure for Temporal Data	1990	VLDB
7	113	Interval Hierarchies And Their Application To Predicate Files	1977	SIGMOD
8	2,776	Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data	1991	SIGMOD
9	4,268	Joining Interval Data in Relational Databases	2004	SIGMOD
10	1,139	Managing Intervals Efficiently in Object-Relational Databases	2000	VLDB