Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/40357
Title: | Representing Paths in Graph Database Pattern Matching | Authors: | MARTENS, Wim Niewerth, Matthias Popp, Tina Rojas, Carlos VANSUMMEREN, Stijn Vrgoc, Domagoj |
Issue Date: | 2023 | Publisher: | ASSOC COMPUTING MACHINERY | Source: | Proceedings of the VLDB Endowment, 16 (7), p. 1790 -1803 | Abstract: | Modern graph database query languages such as GQL, SQL/PGQ, and their academic predecessor G-Core promote paths to first-class citizens in the sense that their pattern matching facility can return paths, as opposed to only nodes and edges. This is challenging for database engines, since graphs can have a large number of paths between a given node pair, which can cause huge intermediate results in query evaluation. We introduce the concept of path multiset representations (PMRs), which can represent multisets of paths exponentially succinctly and therefore bring significant advantages for representing intermediate results. We give a detailed theoretical analysis that shows that they are especially well-suited for representing results of regular path queries and extensions thereof involving counting, random sampling, and unions. Our experiments show that they drastically improve scalability for regular path query evaluation, with speedups of several orders of magnitude. | Notes: | Martens, W (corresponding author), Univ Bayreuth, Bayreuth, Germany. wim.martens@uni-bayreuth.de; matthias.niewerth@uni-bayreuth.de; tina.popp@uni-bayreuth.de; c.rojasvictoriano@gmail.com; stijn.vansummeren@uhasselt.be; dvrgoc@ing.puc.cl |
Document URI: | http://hdl.handle.net/1942/40357 | ISSN: | 2150-8097 | e-ISSN: | 2150-8097 | DOI: | 10.14778/3587136.3587151 | ISI #: | 000992411400016 | Rights: | This work is licensed under the Creative Commons BY-NC-ND 4.0 International License. Visit https://creativecommons.org/licenses/by-nc-nd/4.0/ to view a copy of this license. For any use beyond those covered by this license, obtain permission by emailing info@vldb.org. Copyright is held by the owner/author(s). Publication rights licensed to the VLDB Endowment. | Category: | A1 | Type: | Journal Contribution |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Representing Paths in Graph Database Pattern Matching.pdf | Published version | 960.42 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.