WIREFRAME: two-phase, cost-based optimization for conjunctive regular path queries

P. Godfrey, N. Yakovets, Z. Abul-Basher, M.H. Chignell

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

97 Downloads (Pure)

Abstract

While graph databases and their applications are coming into wide use, we are only at the very beginning of understanding how to scale these systems well. Recent work has brought a cost-based optimization approach to RPQs [6]. We set out a framework herein which we call Wireframe for a two-phase, cost-based optimization for CRPQs. In Wireframe, CRPQ planning—and, likewise, evalu- ation—is separated into two phases. In the first phase, the plan is for evaluating the “answer graph”. In the second phase, a plan is posited for enumerating the subgraph-match answer tuples from this answer graph.
Original languageEnglish
Title of host publicationAMW 2017: Alberto Mendelzon Workshop on Foundations of Data Management and the Web
Subtitle of host publicationProceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, Montevideo, Uruguay, June 7-9, 2017
EditorsJ. Reutter, D. Srivastava
PublisherCEUR-WS.org
Number of pages4
Publication statusPublished - 2017
Event11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web (AMW 2017), June 5-9, 2017, Montevideo, Uruguay - Montevideo, Uruguay
Duration: 5 Jun 20179 Jun 2017
Conference number: 11
http://ceur-ws.org/Vol-1912/

Publication series

NameCEUR Workshop Proceedings
Number1912
ISSN (Print)1613-0073

Conference

Conference11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web (AMW 2017), June 5-9, 2017, Montevideo, Uruguay
Abbreviated titleAMW 2017
Country/TerritoryUruguay
CityMontevideo
Period5/06/179/06/17
Internet address

Fingerprint

Dive into the research topics of 'WIREFRAME: two-phase, cost-based optimization for conjunctive regular path queries'. Together they form a unique fingerprint.

Cite this