Tasweet: Optimizing Disjoint Path Queries in Graph Databases


  1. Abul-Basher, Z.
  2. Yakovets, N.
  3. Godfrey, P.
  4. Ghajar-Khosravi, S.
  5. Chignell, M.
Corporate Authors
Defence Research and Development Canada, Toronto Research Centre , Toronto ON (CAN);Eindhoven Univ of Tech (NETHERLANDS);York Univ, Toronto ONT (CAN);Toronto Univ, Toronto ONT (CAN)
Regular path queries (RPQs) have quickly become a staple to explore graph databases. SPARQL 1.1 includes property 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 optimized execution plan over the plan spaces of the constituent RPQs. Our results show savings in edge-walks / time-to completion of 59%.
Graph databases;path queries;data modeling
Report Number
DRDC-RDDC-2017-P080 — External Literature
Date of publication
01 Oct 2017
Number of Pages
Reprinted from
20th International Conference on Extending Database Technology (EDBT), March 21-24, 2017 - Venice, Italy: ISBN 978-3-89318-073-8, on OpenPro
Electronic Document(PDF)

Permanent link

Document 1 of 1

Date modified: