Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/43664
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMARTENS, Wim-
dc.contributor.authorNiewerth, Matthias-
dc.contributor.authorPopp, Tina-
dc.contributor.authorRojas, Carlos-
dc.contributor.authorVANSUMMEREN, Stijn-
dc.contributor.authorVrgoc, Domagoj-
dc.date.accessioned2024-09-04T07:44:51Z-
dc.date.available2024-09-04T07:44:51Z-
dc.date.issued2024-
dc.date.submitted2024-09-02T11:53:21Z-
dc.identifier.citation2024 IEEE 40TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOP, ICDEW, IEEE COMPUTER SOC, p. 379 -380-
dc.identifier.isbn979-8-3503-8404-8; 979-8-3503-8403-1-
dc.identifier.issn1943-2895-
dc.identifier.urihttp://hdl.handle.net/1942/43664-
dc.description.abstractModern graph database query languages such as GQL, SQL/PGQ, and Cypher allow regular path queries to return entire paths, as opposed to only their endpoints. This is challenging for query evaluation, since a graph can have an exponential number of paths between a given node pair. This means that intermediate query evaluation results can be huge. We recently introduced the concept of path multiset representations (PMRs) [1], which can represent multisets of paths exponentially succinctly and therefore bring significant advantages for representing intermediate results. As shown in our experiments, they can speed up regular path query evaluation with several orders of magnitude.-
dc.description.sponsorshipThis work was supported by the ANR project EQUUS ANR-19-CE48-0019; funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation), project number 431183758. Vansummeren was supported by the Bijzonder Onderzoeksfonds (BOF) of Hasselt University (Belgium) under grant nr. BOF20ZAP02. Vrgoc and Rojas were supported by ANID – ˇ Millennium Science Initiative Program – Code ICN17 002. Vrgoc was also ˇ supported by ANID Fondecyt Regular grant nr. 1221799.-
dc.language.isoen-
dc.publisherIEEE COMPUTER SOC-
dc.relation.ispartofseriesIEEE International Conference on Data Engineering Workshop-
dc.rights2024 IEEE-
dc.subject.otherIndex Terms-graph databases-
dc.subject.othergraph databases-
dc.subject.otherqueries-
dc.subject.otherqueries-
dc.subject.otherpaths-
dc.subject.otherpaths-
dc.titleCompact Path Representations for Graph Database Pattern Matching-
dc.typeProceedings Paper-
local.bibliographicCitation.conferencedate2024, May 13-17-
local.bibliographicCitation.conferencename40th International Conference on Data Engineering Workshop (ICDEW)-
local.bibliographicCitation.conferenceplaceUtrecht, NETHERLANDS-
dc.identifier.epage380-
dc.identifier.spage379-
local.format.pages2-
local.bibliographicCitation.jcatC1-
dc.description.notesMartens, W (corresponding author), Univ Bayreuth, Bayreuth, Germany.-
local.publisher.place10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
dc.identifier.doi10.1109/ICDEW61823.2024.00059-
dc.identifier.isi001259407300052-
local.provider.typewosris-
local.bibliographicCitation.btitle2024 IEEE 40TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOP, ICDEW-
local.description.affiliation[Martens, Wim; Niewerth, Matthias; Popp, Tina] Univ Bayreuth, Bayreuth, Germany.-
local.description.affiliation[Rojas, Carlos; Vrgoc, Domagoj] IMFD Chile, Santiago, Chile.-
local.description.affiliation[Vansummeren, Stijn] UHasselt, Data Sci Inst, Hasselt, Belgium.-
local.description.affiliation[Vrgoc, Domagoj] PUC Chile, Santiago, Chile.-
local.uhasselt.internationalyes-
item.contributorMARTENS, Wim-
item.contributorNiewerth, Matthias-
item.contributorPopp, Tina-
item.contributorRojas, Carlos-
item.contributorVANSUMMEREN, Stijn-
item.contributorVrgoc, Domagoj-
item.fullcitationMARTENS, Wim; Niewerth, Matthias; Popp, Tina; Rojas, Carlos; VANSUMMEREN, Stijn & Vrgoc, Domagoj (2024) Compact Path Representations for Graph Database Pattern Matching. In: 2024 IEEE 40TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOP, ICDEW, IEEE COMPUTER SOC, p. 379 -380.-
item.fulltextWith Fulltext-
item.accessRightsRestricted Access-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
Compact Path Representations for Graph Database Pattern Matching.pdf
  Restricted Access		Published version121.68 kBAdobe PDFView/Open    Request a copy
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.