The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space

Author:

Arroyuelo Diego1ORCID,Gómez-Brandón Adrián2ORCID,Hogan Aidan3ORCID,Navarro Gonzalo3ORCID,Reutter Juan4ORCID,Rojas-Ledesma Javiel5ORCID,Soto Adrián6ORCID

Affiliation:

1. DCC, Escuela de Ingeniería, Pontificia Universidad Católica & IMFD, Santiago, Chile

2. Universidade da Coruña & CITIC & IMFD, A Coruña, Spain

3. DCC, University of Chile & IMFD, Santiago, Chile

4. DCC, Escuela de Ingeniería, Pontificia Universidad Católica & Instituto de Ingeniería Matemática y Computacional, Pontificia Universidad Católica & IMFD, Santiago, Chile

5. DCC, Universidad de Chile & IMFD, Penalolen, Chile

6. FIC, Universidad Adolfo Ibáñ ez & IMFD, Santiago, Chile

Abstract

We present an indexing scheme for triple-based graphs that supports join queries in worst-case optimal (wco) time within compact space. This scheme, called a ring , regards each triple as a cyclic string of length 3. Each rotation of the triples is lexicographically sorted and the values of the last attribute are stored as a column, so we obtain the order of the next column by stably re-sorting the triples by its attribute. We show that, by representing the columns with a compact data structure called a wavelet tree, this ordering enables forward and backward navigation between columns without needing pointers. These wavelet trees further support wco join algorithms and cardinality estimations for query planning. While traditional data structures such as B-Trees, tries, and so on, require 6 index orders to support all possible wco joins over triples, we can use one ring to index them all. This ring replaces the graph and uses only sublinear extra space, thus supporting wco joins in almost no space beyond storing the graph itself. Experiments querying a large graph (Wikidata) in memory show that the ring offers nearly the best overall query times while using only a small fraction of the space required by several state-of-the-art approaches. We then turn our attention to some theoretical results for indexing tables of arity d higher than 3 in such a way that supports wco joins. While a single ring of length d no longer suffices to cover all d ! orders, we need much fewer rings to index them all: O (2 d ) rings with a small constant. For example, we need 5 rings instead of 120 orders for d =5. We show that our rings become a particular case of what we dub order graphs , whose nodes are attribute orders and where stably sorting by some attribute leads us from an order to another, thereby inducing an edge labeled by the attribute. The index is then the set of columns associated with the edges, and a set of rings is just one possible graph shape. We show that other shapes, like for example a single ring instead of several ones of length d , can lead us to even smaller indexes, and that other more general shapes are also possible. For example, we handle d =5 attributes within space equivalent to 4 rings.

Funder

ANID – Millennium Science Initiative Program – Code ICN17_002

“Next-GenerationEU”/PRTR

GAIN/ Xunta de Galicia: GRC

FONDECYT

Publisher

Association for Computing Machinery (ACM)

Reference61 articles.

1. M. Abo Khamis, H. Q. Ngo, D. Olteanu, and D. Suciu. 2019. Boolean tensor decomposition for conjunctive queries with negation. In Proceedings of the 22nd International Conference on Database Theory. 21:1–21:19.

2. Compressed vertical partitioning for efficient RDF management

3. Foundations of modern query languages for graph databases;Angles R.;ACM Computing Surveys,2017

4. Optimizing RPQs over a compact graph representation;Arroyuelo D.;The VLDB Journal,2023

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3