Indexing Temporal Relations for Range-Duration Queries

被引:1
|
作者
Ceccarello, Matteo [1 ]
Dignos, Anton [2 ]
Gamper, Johann [2 ]
Khnaisser, Christina [3 ]
机构
[1] Univ Padua, Padua, Italy
[2] Free Univ Bozen Bolzano, Bozen Bolzano, Italy
[3] Univ Sherbrooke, Sherbrooke, PQ, Canada
关键词
ALGORITHMS;
D O I
10.1145/3603719.3603732
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 rangeduration 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 state of the art indexes also on mixed workloads containing queries that constrain either only the duration or the range along with range-duration queries. Finally, the size of the RD-index is in all settings smaller than the competitors.
引用
收藏
页数:12
相关论文
共 50 条
  • [41] A new framework for addressing temporal range queries and some preliminary results
    Shi, QM
    JaJa, J
    THEORETICAL COMPUTER SCIENCE, 2005, 332 (1-3) : 109 - 121
  • [42] Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results
    Tim Wylie
    Michael A. Schuh
    Rafal A. Angryk
    Journal of Combinatorial Optimization, 2016, 32 : 1107 - 1132
  • [43] Two-Level Indexing for High-Dimensional Range Queries in Peer-to-Peer Networks
    Zhang, Lelin
    Wang, Zhiyong
    Feng, Dagan
    2009 IEEE INTERNATIONAL WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING (MMSP 2009), 2009, : 117 - 121
  • [44] Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results
    Wylie, Tim
    Schuh, Michael A.
    Angryk, Rafal A.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (04) : 1107 - 1132
  • [45] Period Index: A Learned 2D Hash Index for Range and Duration Queries
    Behrend, Andreas
    Dignos, Anton
    Gamper, Johann
    Schmiegelt, Philip
    Voigt, Hannes
    Rottmann, Matthias
    Kahl, Karsten
    SSTD '19 - PROCEEDINGS OF THE 16TH INTERNATIONAL SYMPOSIUM ON SPATIAL AND TEMPORAL DATABASES, 2019, : 100 - 109
  • [46] Hierarchical indexing approach to support XPath queries
    Tang, Nan
    Yu, Jeffrey Xu
    Oezsu, M. Tamer
    Wong, Kam-Fai
    2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, : 1510 - +
  • [47] Indexing moving objects for directions and velocities queries
    Sultan Alamri
    David Taniar
    Maytham Safar
    Information Systems Frontiers, 2013, 15 : 235 - 248
  • [48] Block splitting indexing for supporting containment queries
    Jin, M
    Kim, JM
    WEB AND COMMUNICATION TECHNOLOGIES AND INTERNET-RELATED SOCIAL ISSUES - HSI 2003, 2003, 2713 : 688 - 693
  • [49] An Indexing Method for Answering Queries on Moving Objects
    Khaled Elbassioni
    Amr Elmasry
    Ibrahim Kamel
    Distributed and Parallel Databases, 2005, 17 : 215 - 249
  • [50] An indexing method for answering queries on moving objects
    Elbassioni, K
    Elmasry, A
    Kamel, I
    DISTRIBUTED AND PARALLEL DATABASES, 2005, 17 (03) : 215 - 249