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 条
  • [21] Faster Temporal Range Queries over Versioned Text
    He, Jinru
    Suel, Torsten
    PROCEEDINGS OF THE 34TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR'11), 2011, : 565 - 574
  • [22] Matrix Profile XVII: Indexing the Matrix Profile to Allow Arbitrary Range Queries
    Zhu, Yan
    Yeh, Chin-Chia Michael
    Zimmerman, Zachary
    Keogh, Eamonn
    2020 IEEE 36TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2020), 2020, : 1846 - 1849
  • [23] CRB-tree: An efficient indexing scheme for range-aggregate queries
    Govindarajan, S
    Agarwal, PK
    Arge, L
    DATABASE THEORY ICDT 2003, PROCEEDINGS, 2003, 2572 : 143 - 157
  • [24] Graph Indexing for Reachability Queries
    Yildirim, Hilmi
    Zaki, Mohammed J.
    2010 IEEE 26TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDE 2010), 2010, : 321 - 324
  • [25] Spatial indexing into compressed raster images: How to answer range queries without decompression
    Pajarola, R
    Widmayer, P
    INTERNATIONAL WORKSHOP ON MULTI-MEDIA DATABASE MANAGEMENT SYSTEMS, PROCEEDINGS, 1996, : 94 - 100
  • [26] Dimensionality Reduction for Long Duration and Complex Spatio-Temporal Queries
    Al-Naymat, Ghazi
    Chawla, Sanjay
    Gudmundsson, Joachim
    APPLIED COMPUTING 2007, VOL 1 AND 2, 2007, : 393 - +
  • [27] Direction relations and two-dimensional range queries: optimisation techniques
    Theodoridis, Y
    Papadias, D
    Stefanakis, E
    Sellis, T
    DATA & KNOWLEDGE ENGINEERING, 1998, 27 (03) : 313 - 336
  • [28] A distributed B plus Tree indexing method for processing range queries over streaming data
    Safaee, Shahab
    Mirabi, Meghdad
    Rahmani, Amir Masoud
    Safaei, Ali Asghar
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2024, 27 (02): : 1251 - 1274
  • [29] A distributed B+Tree indexing method for processing range queries over streaming data
    Shahab Safaee
    Meghdad Mirabi
    Amir Masoud Rahmani
    Ali Asghar Safaei
    Cluster Computing, 2024, 27 : 1251 - 1274
  • [30] Indexing Method for Approximate Cost Constrained Minimal Temporal Paths Queries in Public Transportation Networks
    Ma H.
    Tang Y.
    Liang R.-S.
    Ruan Jian Xue Bao/Journal of Software, 2019, 30 (11): : 3469 - 3485