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

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.

 

Authors: Enderle J., Schneider N., Seidl T.
Published in: Proc. 31st Internat. Conf. on Very Large Data Bases (VLDB 2005), Trondheim, Norway
Publisher: ACM - New York,NY,USA
Sprache: EN
Jahr: 2005
Additional:

(acceptance rate 16.5%)

Seiten: 385-396
ISBN: 1-59593-154-6
Konferenz: VLDB
URL:VLDB 2005
Dateien:
Typ: Tagungsbeiträge
Forschungsgebiet: Fast Access to Complex Data