Reachability Queries with Transfer Decay

被引:1
|
作者
Strzheletska, Elena, V [1 ]
Tsotras, Vassilis J. [1 ]
机构
[1] Univ Calif Riverside, Dept Comp Sci & Engn, Riverside, CA 92521 USA
关键词
spatio-temporal data; reachability queries;
D O I
10.1109/MDM52706.2021.00036
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A spatiotemporal reachability query identifies whether a physical item (or information, virus etc.) could have been transferred from the source moving object O-S to the target moving object O-T during a time interval I (either directly, or through a chain of intermediate transfers). Previous work on spatiotemporal reachability queries, assumes the transferred information remains the same. This paper introduces a novel reachability query under the scenario of information decay. Such queries arise when the value of information (virus load etc.) that travels through the chain of intermediate objects decreases with each transfer. To address such queries efficiently over large spatiotemporal datasets, we introduce the RICCdecay algorithm. An experimental evaluation shows the efficiency of the proposed algorithm over previous approaches.
引用
收藏
页码:175 / 180
页数:6
相关论文
共 50 条
  • [1] Graph Indexing for Reachability Queries
    Yildirim, Hilmi
    Zaki, Mohammed J.
    [J]. 2010 IEEE 26TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDE 2010), 2010, : 321 - 324
  • [2] An Optimized Labeling Scheme for Reachability Queries
    Tang, Xian
    Chen, Ziyang
    Zhang, Haiyan
    Liu, Xiang
    Shi, Yunyu
    Shahzadi, Asad
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2018, 55 (02): : 267 - 283
  • [3] Distributed Reachability Queries on Massive Graphs
    Zhang, Tianming
    Gao, Yunjun
    Li, Congzheng
    Ge, Congcong
    Guo, Wei
    Zhou, Qiang
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, 2019, 11448 : 406 - 410
  • [4] Reachability and connectivity queries in constraint databases
    Benedikt, M
    Grohe, M
    Libkin, L
    Segoufin, L
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (01) : 169 - 206
  • [5] Performance Guarantees for Distributed Reachability Queries
    Fan, Wenfei
    Wang, Xin
    Wul, Yinghui
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (11): : 1304 - 1315
  • [6] Decentralized Graph Processing for Reachability Queries
    Mathys, Joel
    Fritsch, Robin
    Wattenhofer, Roger
    [J]. ADVANCED DATA MINING AND APPLICATIONS (ADMA 2022), PT I, 2022, 13725 : 505 - 519
  • [7] Efficient Processing of Reachability Queries with Meetings
    Strzheletska, Elena V.
    Tsotras, Vassilis J.
    [J]. 25TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2017), 2017,
  • [8] Efficient processing of -hop reachability queries
    Cheng, James
    Shang, Zechao
    Cheng, Hong
    Wang, Haixun
    Yu, Jeffrey Xu
    [J]. VLDB JOURNAL, 2014, 23 (02): : 227 - 252
  • [9] DBL: Efficient Reachability Queries on Dynamic Graphs
    Lyu, Qiuyi
    Li, Yuchen
    He, Bingsheng
    Gong, Bin
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2021), PT II, 2021, 12682 : 761 - 777
  • [10] Evaluating Reachability Queries over Path Collections
    Bouros, Panagiotis
    Skiadopoulos, Spiros
    Dalamagas, Theodore
    Sacharidis, Dimitris
    Sellis, Timos
    [J]. SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, PROCEEDINGS, 2009, 5566 : 398 - +