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 条
  • [31] Indexing a dictionary for subset matching queries
    Landau, Cad M.
    Tsur, Dekel
    Weimann, Oren
    STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 2007, 4726 : 195 - +
  • [32] Multiresolution indexing of XML for frequent queries
    He, H
    Yang, J
    20TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2004, : 683 - 694
  • [33] Less Space: Indexing for Queries with Wildcards
    Lewenstein, Moshe
    Munro, J. Ian
    Raman, Venkatesh
    Thankachan, Sharma V.
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 89 - 99
  • [34] Indexing views to route queries in a PDMS
    Lefteris Sidirourgos
    George Kokkinidis
    Theodore Dalamagas
    Vassilis Christophides
    Timos Sellis
    Distributed and Parallel Databases, 2008, 23 : 45 - 68
  • [35] An Indexing Framework for Queries on Probabilistic Graphs
    Maniu, Silviu
    Cheng, Reynold
    Senellart, Pierre
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2017, 42 (02):
  • [36] Less space: Indexing for queries with wildcards
    Lewenstein, Moshe
    Munro, J. Ian
    Raman, Venkatesh
    Thankachan, Sharma V.
    THEORETICAL COMPUTER SCIENCE, 2014, 557 : 120 - 127
  • [37] Indexing for Summary Queries: Theory and Practice
    Yi, Ke
    Wang, Lu
    Wei, Zhewei
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2014, 39 (01):
  • [38] Indexing a Dictionary for Subset Matching Queries
    Landau, Gad M.
    Tsur, Dekel
    Weimann, Oren
    ALGORITHMS AND APPLICATIONS: ESSAYS DEDICATED TO ESKO UKKONEN ON THE OCCASION OF HIS 60TH BIRTHDAY, 2010, 6060 : 158 - +
  • [39] Indexing views to route queries in a PDMS
    Sidirourgos, Lefteris
    Kokkinidis, George
    Dalamagas, Theodore
    Christophides, Vassilis
    Sellis, Timos
    DISTRIBUTED AND PARALLEL DATABASES, 2008, 23 (01) : 45 - 68
  • [40] Processing (Multiple) Spatio-temporal Range Queries in Multicore Settings
    Trajcevski, Goce
    Yaagoub, Anan
    Scheuermann, Peter
    ADVANCES IN DATABASES AND INFORMATION SYSTEMS, 2011, 6909 : 214 - 227