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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Jost Enderle
- 2. Nicole Schneider
- 3. Thomas Seidl
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,488 | On the Analysis of Indexing Schemes | 1997 | PODS | 0.00011699446 |
| 6,480 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB | 5.0475112e-05 |
| 2,003 | Indexing for Data Models with Constraints and Classes (Extended Abstract) | 1993 | PODS | 9.8126082e-05 |
| 5,335 | Efficient Computation of Temporal Aggregates with Range Predicates | 2001 | PODS | 5.5647464e-05 |
| 9,116 | R-Tree Based Indexing of Now-Relative Bitemporal Data | 1998 | VLDB | 4.3928853e-05 |
| 2,265 | The Time Index: An Access Structure For Temporal Data | 1990 | VLDB | 9.154915e-05 |
| 19 | Interval Hierarchies And Their Application To Predicate Files | 1977 | SIGMOD | 0.00091625014 |
| 2,586 | Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data | 1991 | SIGMOD | 8.4928908e-05 |
| 4,737 | Joining Interval Data in Relational Databases | 2004 | SIGMOD | 5.9604127e-05 |
| 986 | Managing Intervals Efficiently in Object-Relational Databases | 2000 | VLDB | 0.00014838568 |