Multiple-Query Optimization of Regular Path Queries

被引:10
|
作者
Abul-Basher, Zahid [1 ]
机构
[1] Univ Toronto, Dept Mech & Ind Engn, Toronto, ON M5S 3G8, Canada
关键词
D O I
10.1109/ICDE.2017.205
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Graph databases have become increasingly important with the rise of social networks, and with the growth of the Semantic Web and characterization of biological networks. Regular path queries (RPQs) are a way to explore path patterns in graphs which have become a standard method to explore graph databases. SPARQL 1.1 includes property paths, and so now encompasses RPQs as a fragment. In many environments, such as visual query systems (VQSs), the RPQs are generated visually which may contain many commonalities that can be optimized globally. We introduce SWARMGUIDE, a framework for optimizing multiple regular path queries. The framework detects commonalities among the RPQs, in order to find an execution plan that is globally optimized over the plan spaces of the constituent RPQs.
引用
收藏
页码:1426 / 1430
页数:5
相关论文
共 50 条
  • [41] Containment of Simple Conjunctive Regular Path Queries
    Figueira, Diego
    Godbole, Adwait
    Krishna, S.
    Martens, Wim
    Niewerth, Matthias
    Trautner, Tina
    [J]. KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 371 - 380
  • [42] Regular path queries under approximate semantics
    Grahne, G
    Thomo, A
    [J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2006, 46 (1-2) : 165 - 190
  • [43] Answering Regular Path Queries through Exemplars
    Chauhan, Komal
    Jain, Kartik
    Ranu, Sayan
    Bedathur, Srikanta
    Bagchi, Amitabha
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2021, 15 (02): : 299 - 311
  • [44] Nested Regular Path Queries in Description Logics
    Bienvenu, Meghyn
    Calvanese, Diego
    Ortiz, Magdalena
    Simkus, Mantas
    [J]. FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2014, : 218 - 227
  • [45] A TIME-OPTIMAL MULTIPLE-QUERY NEAREST-NEIGHBOR ALGORITHM ON MESHES WITH MULTIPLE BROADCASTING
    STOICA, I
    [J]. INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 1995, 9 (04) : 663 - 677
  • [46] Conjunctive Regular Path Queries with Capture Groups
    Schmid, Markus L.
    [J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 2022, 47 (02):
  • [47] The view selection problem for regular path queries
    Afonin, Sergey
    [J]. LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 121 - 132
  • [48] Conjunctive Regular Path Queries with String Variables
    Schmid, Markus L.
    [J]. PODS'20: PROCEEDINGS OF THE 39TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2020, : 361 - 374
  • [49] Answering Regular Path Queries on Workflow Provenance
    Huang, Xiaocheng
    Bao, Zhuowei
    Davidson, Susan B.
    Milo, Tova
    Yuan, Xiaojie
    [J]. 2015 IEEE 31ST INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2015, : 375 - 386
  • [50] Dichotomies for Evaluating Simple Regular Path Queries
    Martens, Wim
    Trautner, Tina
    [J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 2019, 44 (04):