Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity
From MaRDI portal
Publication:4598259
DOI10.4230/LIPIcs.ICALP.2016.117zbMath1388.68032arXiv1603.00658OpenAlexW2963567383MaRDI QIDQ4598259
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1603.00658
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
This page was built for publication: Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity