From Relation Algebra to Semi-Join Algebra: An Approach for Graph Query Optimization

被引:4
|
作者
Hellings, Jelle [1 ]
Pilachowski, Catherine L. [2 ]
Van Gucht, Dirk [2 ]
Gyssens, Marc [1 ]
Wu, Yuqing [3 ]
机构
[1] Hasselt Univ, Hasselt, Belgium
[2] Indiana Univ, Bloomington, IN USA
[3] Pomona Coll, Claremont, CA 91711 USA
关键词
EXPRESSIVE POWER; TRANSITIVE CLOSURE; NAVIGATIONAL XPATH; CALCULUS; COMPLEXITY;
D O I
10.1145/3122831.3122833
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many graph query languages rely on the composition operator to navigate graphs and select nodes of interests, even though evaluating compositions of relations can be costly. Often, this need for composition can be reduced by rewriting towards queries that use semi-joins instead. In this way, the cost of evaluating queries can be significantly reduced. We study techniques to recognize and apply such rewritings. Concretely, we study the relationship between the expressive power of the relation algebras, that heavily rely on composition, and the semi-join algebras, that replace the composition operator in favor of the semi-join operators. As our main result, we show that each fragment of the relation algebras where intersection and/or difference is only used on edges (and not on complex compositions) is expressively equivalent to a fragment of the semi-join algebras. This expressive equivalence holds for node queries that evaluate to sets of nodes. For practical relevance, we exhibit constructive steps for rewriting relation algebra queries to semi-join algebra queries, and prove that these steps lead to only a well-bounded increase in the number of steps needed to evaluate the rewritten queries. In addition, on node-labeled graphs that are sibling-ordered trees, we establish new relationships among the expressive power of Regular XPath, Conditional XPath, FO-logic, and the semi-join algebra augmented with restricted fixpoint operators.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] From Relation Algebra to Semi-join Algebra: An Approach to Graph Query Optimization
    Hellings, Jelle
    Pilachowski, Catherine L.
    Van Gucht, Dirk
    Gyssens, Marc
    Wu, Yuqing
    [J]. COMPUTER JOURNAL, 2021, 64 (05): : 789 - 811
  • [2] Conjunctive Query for Linked Data Based on Semi-Join
    Jiang, Dongyang
    [J]. FUZZY SYSTEMS AND DATA MINING III (FSDM 2017), 2017, 299 : 63 - 69
  • [3] Distributed XML Query Processing Based on Semi-join
    Sun, Shi-Jun
    Liao, Hu-Sheng
    Gao, Hong-Yu
    Su, Hang
    [J]. INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND COMMUNICATION ENGINEERING (CSCE 2015), 2015, : 188 - 194
  • [4] COMBINING JOIN AND SEMI-JOIN OPERATIONS FOR DISTRIBUTED QUERY-PROCESSING
    CHEN, MS
    YU, PS
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1993, 5 (03) : 534 - 542
  • [5] XML algebra and query optimization based on algebra
    College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China
    不详
    [J]. Harbin Gongcheng Daxue Xuebao, 2007, 8 (899-904):
  • [6] Perimeter-Search-Based Semi-Join Query Optimization Algorithm in Data-Sharing Environment
    Wang Xiaoqing
    Fang Youyuan
    Zheng Yanxing
    Zong Jianjian
    Gu Tianyang
    [J]. CHINESE JOURNAL OF ELECTRONICS, 2009, 18 (04) : 593 - 598
  • [7] On query optimization in a temporal SPC algebra
    Wijsen, J
    Bès, A
    [J]. DATA & KNOWLEDGE ENGINEERING, 2003, 44 (02) : 165 - 192
  • [8] Structural semi-join: A light-weight structural join operator for efficient XML path query pattern matching
    Son, Seokhyun
    Shin, Hyoseop
    Xu, Zhiwei
    [J]. IDEAS 2007: 11TH INTERNATIONAL DATABASE ENGINEERING AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2007, : 233 - 240
  • [9] Framework for Web Service Query Algebra and Optimization
    Yu, Qi
    Bouguettaya, Athman
    [J]. ACM TRANSACTIONS ON THE WEB, 2008, 2 (01)
  • [10] An Optimization Method Based on XML Query Algebra
    Zhang, Qiuyu
    Wang, Min
    [J]. SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING: THEORY AND PRACTICE, VOL 1, 2012, 114 : 199 - 206