TASWEET : optimizing disjunctive regular path queries in graph databases
| Autor: | Abul-Basher, Z., Yakovets, N., Godfrey, P., Ghajar-Khosravi, S., Chignell, M.H., Mitschang, Bernhard, Markl, Volker, Bress, Sebastian, Andritsos, Periklis, Sattler, Kai-Uwe, Orlando, Salvatore |
|---|---|
| Přispěvatelé: | Database Group |
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: | |
| Zdroj: | 20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy, 470-473 STARTPAGE=470;ENDPAGE=473;TITLE=20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy |
| Popis: | 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%. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|