TASWEET : optimizing disjunctive regular path queries in graph databases

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

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

3 Citations (Scopus)
51 Downloads (Pure)

Abstract

Regular path queries (RPQs) have quickly become a staple to explore graph databases. SPARQL 1.1 includes prop- erty paths, and so now encompasses RPQs as a fragment. Despite the extreme utility of RPQs, it can be exceedingly difficult for even experts to formulate such queries. It is next to impossible for non-experts to formulate such path queries. As such, several visual query systems (VQSs) have been proposed which simplify the task of constructing path queries by directly manipulating visual objects representing the domain elements. The queries generated by VQSs may, however, have many commonalities that can be exploited to optimize globally. We introduce Tasweet, a framework for optimizing “disjunctive” path queries, which detects the commonalities among the queries to find a globally opti- mized execution plan over the plan spaces of the constituent RPQs. Our results show savings in edge-walks / time-to- completion of 59%.
Original languageEnglish
Title of host publication20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy
EditorsBernhard Mitschang, Volker Markl, Sebastian Bress, Periklis Andritsos, Kai-Uwe Sattler, Salvatore Orlando
Pages470-473
Number of pages4
ISBN (Electronic)9783893180738
DOIs
Publication statusPublished - 25 Mar 2017
EventEDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology - Venice, Italy
Duration: 21 Mar 201724 Mar 2017
Conference number: 20
http://edbticdt2017.unive.it/

Conference

ConferenceEDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology
Abbreviated titleEDBT 2017
CountryItaly
CityVenice
Period21/03/1724/03/17
Internet address

Fingerprint Dive into the research topics of 'TASWEET : optimizing disjunctive regular path queries in graph databases'. Together they form a unique fingerprint.

  • Cite this

    Abul-Basher, Z., Yakovets, N., Godfrey, P., Ghajar-Khosravi, S., & Chignell, M. H. (2017). TASWEET : optimizing disjunctive regular path queries in graph databases. In B. Mitschang, V. Markl, S. Bress, P. Andritsos, K-U. Sattler, & S. Orlando (Eds.), 20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy (pp. 470-473) https://doi.org/10.5441/002/edbt.2017.47