论文标题
为范围绘制查询索引时间关系
Indexing Temporal Relations for Range-Duration Queries
论文作者
论文摘要
时间信息在许多数据库应用程序中起着至关重要的作用,但是对此类数据的查询的支持是有限的。我们提出了一个索引结构,称为RD索引,以支持间隔时间戳关系的范围 - 持续查询,这限制了时间轴上的元组位置的范围及其持续时间。 RD索引是二维空间中的网格结构,分别代表时间表和时间戳持续时间的位置。我们不使用常规网格,而是考虑用于构建网格的数据分布,以确保每个网格单元包含大约相同数量的间隔。 RD索引在所有操作的运行时间内具有可证明的界限,允许简单实现,并支持非常可预测的查询性能。我们将解决方案基于各种数据集和查询工作负载,研究了各个查询的查询率和行为。结果表明,RD索引在范围内的查询上的性能要比基准更好,该查询是明确设计的。此外,它在工作负载上也优于专门索引,其中包含仅约束持续时间或范围的查询。
Temporal information plays a crucial role in many database applications, however support for queries on such data is limited. We present an index structure, termed RD-index, to support range-duration queries over interval timestamped relations, which constrain both the range of the tuples' positions on the timeline and their duration. RD-index is a grid structure in the two-dimensional space, representing the position on the timeline and the duration of timestamps, respectively. Instead of using a regular grid, we consider the data distribution for the construction of the grid in order to ensure that each grid cell contains approximately the same number of intervals. RD-index features provable bounds on the running time of all the operations, allow for a simple implementation, and supports very predictable query performance. We benchmark our solution on a variety of datasets and query workloads, investigating both the query rate and the behavior of the individual queries. The results show that RD-index performs better than the baselines on range-duration queries, for which it is explicitly designed. Furthermore, it outperforms specialized indexes also on workloads containing queries constraining either only the duration or the range.