TASWEET : optimizing disjunctive regular path queries in graph databases

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)
60 Downloads (Pure)

Samenvatting

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%.
Originele taal-2Engels
Titel20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy
RedacteurenBernhard Mitschang, Volker Markl, Sebastian Bress, Periklis Andritsos, Kai-Uwe Sattler, Salvatore Orlando
Pagina's470-473
Aantal pagina's4
ISBN van elektronische versie9783893180738
DOI's
StatusGepubliceerd - 25 mrt 2017
EvenementEDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology - Venice, Italië
Duur: 21 mrt 201724 mrt 2017
Congresnummer: 20
http://edbticdt2017.unive.it/

Congres

CongresEDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology
Verkorte titelEDBT 2017
LandItalië
StadVenice
Periode21/03/1724/03/17
Internet adres

Vingerafdruk Duik in de onderzoeksthema's van 'TASWEET : optimizing disjunctive regular path queries in graph databases'. Samen vormen ze een unieke vingerafdruk.

Citeer dit