WIREFRAME: two-phase, cost-based optimization for conjunctive regular path queries
| Autor: | Godfrey, P., Yakovets, N., Abul-Basher, Z., Chignell, M.H., Reutter, J., Srivastava, D. |
|---|---|
| Přispěvatelé: | Information Systems WSK&I, Database Group |
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Zdroj: | AMW 2017: Alberto Mendelzon Workshop on Foundations of Data Management and the Web: Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, Montevideo, Uruguay, June 7-9, 2017 AMW 2017: Alberto Mendelzon Workshop on Foundations of Data Management and the Web |
| Popis: | While graph databases and their applications are coming into wide use, we are only at the very beginning of understanding how to scale these systems well. Recent work has brought a cost-based optimization approach to RPQs [6]. We set out a framework herein which we call Wireframe for a two-phase, cost-based optimization for CRPQs. In Wireframe, CRPQ planning—and, likewise, evalu- ation—is separated into two phases. In the first phase, the plan is for evaluating the “answer graph”. In the second phase, a plan is posited for enumerating the subgraph-match answer tuples from this answer graph. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|