Database Paper Browser

Back to papers

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
9320
Venue
VLDB
Year
2005
Pagerank
4.1945683e-05
Overall Rank
12,564 | 12.60%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

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