Wim Martens
Abstract
Since large structured query logs have recently become available, we have a new opportunity to gain insights in the types of queries that users ask. Even though such logs can be quite volatile, there are various new observations that can be made about the structure of queries inside them, on which we report here. Furthermore, building on an extensive analysis that has been done on such logs, we were able to provide a theoretical explanation why regular path queries in graph database applications behave better than worst-case complexity results suggest at first sight.
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.Google Scholar
Digital Library
- N. Alon, R. Yuster, and U. Zwick. Color-coding. Journal of the ACM, 42(4):844--856, 1995.Google ScholarDigital Library
- G. Bagan, A. Bonifati, and B. Groz. A trichotomy for regular simple path queries on graphs. In PODS, pages 261--272, 2013.Google ScholarDigital Library
- A. Bielefeldt, J. Gonsior, and M. Kr¨otzsch. Practical linked data access via SPARQL: the case of wikidata. In LDOW@WWW, 2018.Google Scholar
- A. Bonifati, W. Martens, and T. Timm. An analytical study of large SPARQL query logs. PVLDB, 11(2):149--161, 2017.Google Scholar
- A. Bonifati, W. Martens, and T. Timm. An analytical study of large SPARQL query logs. The VLDB Journal, 2019. Full version of [5], to appear.Google ScholarCross Ref
- A. Bonifati, W. Martens, and T. Timm. Navigating the maze of wikidata query logs. In WWW, pages 127--138, 2019.Google Scholar
- I. F. Cruz, A. O. Mendelzon, and P. T. Wood. A graphical query language supporting recursion. In SIGMOD Conference, pages 323--330, 1987.Google ScholarDigital Library
- F. V. Fomin, D. Lokshtanov, F. Panolan, and S. Saurabh. Efficient computation of representative families with applications in parameterized and exact algorithms. Journal of the ACM, 63(4):29:1--29:60, 2016.Google ScholarDigital Library
- N. Francis, A. Green, P. Guagliardo, L. Libkin, T. Lindaaker, V. Marsault, S. Plantikow, M. Rydberg, P. Selmer, and A. Taylor. Cypher: An evolving query language for property graphs. In SIGMOD Conference, pages 1433--1445, 2018.Google ScholarDigital Library
- G. Gottlob, G. Greco, N. Leone, and F. Scarcello. Hypertree decompositions: Questions and answers. In PODS, pages 57--74, 2016.Google ScholarDigital Library
- A. S. LaPaugh and R. L. Rivest. The subgraph homeomorphism problem. Journal of Computer and System Sciences, 20(2):133 -- 149, 1980.Google ScholarCross Ref
- W. Martens, M. Niewerth, and T. Trautner. A trichotomy for regular trail queries. CoRR, abs/1903.00226, 2019.Google Scholar
- W. Martens and T. Trautner. Evaluation and enumeration problems for regular path queries. In ICDT, pages 19:1--19:21, 2018.Google Scholar
- W. Martens and T. Trautner. Dichotomies for evaluating simple regular path queries. ACM Transactions on Database Systems, 2019. Full version of [14], to appear.Google ScholarDigital Library
- A. O. Mendelzon and P. T. Wood. Finding regular simple paths in graph databases. SIAM Journal on Computing, 24(6):1235--1258, 1995.Google ScholarDigital Library
- Neo4j. The neo4j developer manual v3.2. https://neo4j.com/docs/developer-manual/3.2/, 2017.Google Scholar
- Y. Perl and Y. Shiloach. Finding two disjoint paths between two pairs of vertices in a graph. Journal of the ACM, 25(1):1--9, 1978.Google ScholarDigital Library
- J. Y. Yen. Finding the k shortest loopless paths in a network. Management Science, 17(11):712--716, 1971.Google ScholarDigital Library
Recommendations
Recommending Join Queries via Query Log Analysis
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringComplex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, effectively formulating such queries is a challenging task for human users, ...
Bag Query Containment and Information Theory
The query containment problem is a fundamental algorithmic problem in data management. While this problem is well understood under set semantics, it is by far less understood under bag semantics. In particular, it is a long-standing open question whether ...
Comments