Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
复制标题
DOI：
--
复制
发表时间：
2005-08
期刊：
影响因子：
--
通讯作者：
Jost Enderle;Nicole L. Schneider;T. Seidl
中科院分区：
文献类型：
--
作者：
Jost Enderle;Nicole L. Schneider;T. Seidl
随着当今数据库应用中时空数据的不断增加，区间数据类型被越来越多的数据库系统所采用。为了有效支持同时包含区间属性和简单值属性（例如数字、字符串）选择的查询，需要特殊的索引结构来支持两种类型谓词的组合。基于关系区间树，我们提出了支持这种组合查询的各种索引方案，并且可以以最小的努力集成到关系数据库系统中。对不同查询类型的实验表明，与竞争的访问方法相比，新技术具有卓越的性能。
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.