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 language | English |
---|---|
Title of host publication | 20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy |
Editors | Bernhard Mitschang, Volker Markl, Sebastian Bress, Periklis Andritsos, Kai-Uwe Sattler, Salvatore Orlando |
Pages | 470-473 |
Number of pages | 4 |
ISBN (Electronic) | 9783893180738 |
DOIs | |
Publication status | Published - 25 Mar 2017 |
Event | EDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology - Venice, Italy Duration: 21 Mar 2017 → 24 Mar 2017 Conference number: 20 http://edbticdt2017.unive.it/ |
Conference
Conference | EDBT/ICDT 2017 Joint Conference 20th International Conference on Extending Database Technology |
---|---|
Abbreviated title | EDBT 2017 |
Country/Territory | Italy |
City | Venice |
Period | 21/03/17 → 24/03/17 |
Internet address |