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.
翻译:时间信息在许多数据库应用中发挥着关键作用,但对这种数据查询的支持有限。我们提出了一个索引结构,称为RD-index,以支持在间隔时间间隔关系中进行时间间隔查询。RD-index是二维空间的网格结构,分别代表时间和时间标记时间长度的位置。我们不使用常规网格,而是考虑为构建网格而分配数据,以确保每个网格单元的间隔数大致相同。RD-index特征在所有操作运行时间的可探测界限上具有可探测性能,允许简单执行,并支持非常可预测的查询性能。我们根据不同的数据集和查询工作量来衡量我们的解决办法,调查查询率和个别查询行为。结果显示,RD-index比明确设计的关于范围测量查询的基线要好。此外,它也比专门指数还差,在包含仅限制时间长度或范围的查询的工作量方面,也比专门指标要强。