Christoph Berkholz
Skip Abstract Section
Abstract
This paper is the tutorial we wish we had had available when starting our own research on constant delay enumeration for conjunctive queries. It provides precise statements and detailed, self-contained proofs of the fundamental results in this area.
- Amir Abboud and Virginia Vassilevska Williams. 2014. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems. In Proc. 55th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2014), Philadelphia, PA, USA, October 18-21, 2014. 434--443. Google Scholar
Digital Library
- Christopher R. Aberger, Susan Tu, Kunle Olukotun, and Christopher Ré. 2016. EmptyHeaded: A Relational Engine for Graph Processing. In Proc. 2016 International Conference on Management of Data (SIGMOD Conference 2016), San Francisco, CA, USA, June 26 -- July 1, 2016. 431--446. Google ScholarDigital Library
- Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley. http://webdam.inria.fr/Alice/Google Scholar
- Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. 2017. What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?. In Proc. 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2017), Chicago, IL, USA, May 14-19, 2017. 429--444. Google ScholarDigital Library
- Noga Alon, Raphael Yuster, and Uri Zwick. 1997. Finding and Counting Given Length Cycles. Algorithmica 17, 3 (1997), 209--223. Google ScholarCross Ref
- Antoine Amarilli, Pierre Bourhis, and Stefan Mengel. 2018. Enumeration on Trees under Relabelings. In Proc. 21st International Conference on Database Theory (ICDT 2018), March 26-29, 2018, Vienna, Austria. 5:1--5:18. Google ScholarCross Ref
- Antoine Amarilli, Pierre Bourhis, Stefan Mengel, and Matthias Niewerth. 2019a. Constant-Delay Enumeration for Nondeterministic Document Spanners. In Proc. 22nd International Conference on Database Theory (ICDT 2019), March 26-28, 2019, Lisbon, Portugal. 22:1--22:19. Google ScholarCross Ref
- Antoine Amarilli, Pierre Bourhis, Stefan Mengel, and Matthias Niewerth. 2019b. Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. In Proc. 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2019), Amsterdam, The Netherlands, June 30 -- July 5, 2019. 89--103. Google ScholarDigital Library
- Rasmus Resen Amossen and Rasmus Pagh. 2009. Faster join-projects and sparse matrix multiplications. In Proc. 12th International Conference on Database Theory (ICDT 2009), St. Petersburg, Russia, March 23-25, 2009. 121--126. Google ScholarDigital Library
- Albert Atserias, Martin Grohe, and Dániel Marx. 2013. Size Bounds and Query Plans for Relational Joins. SIAM J Comput. 42, 4 (2013), 1737--1767. Google ScholarDigital Library
- Guillaume Bagan. 2006. MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay. In Proc. 15th EACSL Annual Conference on Computer Science Logic (CSL 2006), Szeged, Hungary, September 25-29, 2006. 167--181. Google ScholarCross Ref
- Guillaume Bagan. 2009. Algorithmes et complexité des problèmes d'énumération pour l'évaluation de requêtes logiques. (Algorithms and complexity of enumeration problems for the evaluation of logical queries). Ph.D. Dissertation. University of Caen, Normandy, France. https://tel.archives-ouvertes.fr/tel-00424232Google Scholar
- Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. 2007. On Acyclic Conjunctive Queries and Constant Delay Enumeration. In Proc. 16th EACSL Annual Conference on Computer Science Logic (CSL 2007), Lausanne, Switzerland, September 11-15, 2007. 208--222. Google ScholarCross Ref
- Catriel Beeri, Ronald Fagin, David Maier, and Mihalis Yannakakis. 1983. On the Desirability of Acyclic Database Schemes. J. ACM 30, 3 (1983), 479--513. Google ScholarDigital Library
- Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2017. Answering Conjunctive Queries under Updates. In Proc. 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2017), Chicago, IL, USA, May 14-19, 2017. 303--318. Full version available at http://arxiv.org/abs/1702.06370. Google ScholarDigital Library
- Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2018a. Answering FO+MOD Queries under Updates on Bounded Degree Databases. ACM Trans. Database Syst. 43, 2 (2018), 7:1--7:32. Google ScholarDigital Library
- Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2018b. Answering UCQs under Updates and in the Presence of Integrity Constraints. In Proc. 21st International Conference on Database Theory (ICDT 2018), March 26-29, 2018, Vienna, Austria. 8:1--8:19. Google ScholarCross Ref
- Christoph Berkholz and Nicole Schweikardt. 2019. Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width. In Proc. 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), August 26-30, 2019, Aachen, Germany. 58:1--58:15. Google ScholarCross Ref
- Philip A. Bernstein and Nathan Goodman. 1981. Power of Natural Semijoins. SIAM J. Comput. 10, 4 (1981), 751--771. Google ScholarDigital Library
- Johann Brault-Baron. 2013. De la pertinence de l'énumération : complexité en logiques propositionnelle et du premier ordre. (The relevance of the list: propositional logic and complexity of the first order). Ph.D. Dissertation. University of Caen, Normandy, France. https://tel.archives-ouvertes.fr/tel-01081392Google Scholar
- Johann Brault-Baron. 2016. Hypergraph Acyclicity Revisited. ACM Comput. Surv. 49, 3 (2016), 54:1--54:26. Google ScholarDigital Library
- Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, and Ge Xia. 2006. Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72, 8 (2006), 1346--1367. Google ScholarDigital Library
- Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, and Christopher Umans. 2005. Group-theoretic Algorithms for Matrix Multiplication. In Proc. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA. 379--388. Google ScholarDigital Library
- Henry Cohn and Christopher Umans. 2003. A Group-Theoretic Approach to Fast Matrix Multiplication. In Proc. 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA. 438--449. Google ScholarCross Ref
- Nilesh Dalvi and Dan Suciu. 2007. The Dichotomy of Conjunctive Queries on Probabilistic Structures. In Proc. 26th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2007), Beijing, China, June 11-13, 2007. ACM, 293--302. Google ScholarDigital Library
- Shaleen Deep and Paraschos Koutris. 2018. Compressed Representations of Conjunctive Query Results. In Proc. 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2018), Houston, TX, USA, June 10-15, 2018. 307--322. Google ScholarDigital Library
- Arnaud Durand and Etienne Grandjean. 2007. First-order queries on structures of bounded degree are computable with constant delay. ACM Trans. Comput. Log. 8, 4 (2007). Google ScholarDigital Library
- Arnaud Durand, Nicole Schweikardt, and Luc Segoufin. 2014. Enumerating answers to first-order queries over databases of low degree. In Proc. 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2014), Snowbird, UT, USA, June 22-27, 2014. 121--131. Google ScholarDigital Library
- François Le Gall. 2014. Powers of tensors and fast matrix multiplication. In Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC 2014), Kobe, Japan, July 23-25, 2014. 296--303. Google ScholarDigital Library
- Martin Charles Golumbic. 2004. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57). North-Holland Publishing Co., Amsterdam, The Netherlands, The Netherlands.Google Scholar
- Georg Gottlob, Gianluigi Greco, Nicola Leone, and Francesco Scarcello. 2016. Hypertree Decompositions: Questions and Answers. In Proc. 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2016), San Francisco, CA, USA, June 26 -- July 1, 2016. 57--74. Google ScholarDigital Library
- Georg Gottlob, Nicola Leone, and Francesco Scarcello. 2002. Hypertree Decompositions and Tractable Queries. J. Comput. Syst. Sci. 64, 3 (2002), 579--627. Google ScholarDigital Library
- M. H. Graham. 1979. On the universal relation. Technical Report. University of Toronto, Toronto, Ontario, Canada.Google Scholar
- Martin Grohe and Dániel Marx. 2014. Constraint Solving via Fractional Edge Covers. ACM Trans. Algorithms 11, 1 (2014), 4:1--4:20. Google ScholarDigital Library
- Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. 2015. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. In Proc. 47th Annual ACM on Symposium on Theory of Computing (STOC 2015), Portland, OR, USA, June 14-17, 2015. 21--30. Google ScholarDigital Library
- Muhammad Idris, Martín Ugarte, and Stijn Vansummeren. 2017. The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates. In Proc. 2017 ACM International Conference on Management of Data (SIGMOD Conference 2017), Chicago, IL, USA, May 14-19, 2017. 1259--1274. Google ScholarDigital Library
- Muhammad Idris, Martín Ugarte, Stijn Vansummeren, Hannes Voigt, and Wolfgang Lehner. 2018. Conjunctive Queries with Inequalities Under Updates. PVLDB 11, 7 (2018), 733--745. Google ScholarDigital Library
- Muhammad Idris, Martín Ugarte, Stijn Vansummeren, Hannes Voigt, and Wolfgang Lehner. 2019. Efficient Query Processing for Dynamically Changing Datasets. SIGMOD Record 48, 1 (2019), 33--40. Google ScholarDigital Library
- Wojciech Kazana and Luc Segoufin. 2011. First-order query evaluation on structures of bounded degree. Logical Methods in Computer Science 7, 2 (2011). Google ScholarCross Ref
- Wojciech Kazana and Luc Segoufin. 2013a. Enumeration of first-order queries on classes of structures with bounded expansion. In Proc. 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2013), New York, NY, USA, June 22-27, 2013. 297--308. Google ScholarDigital Library
- Wojciech Kazana and Luc Segoufin. 2013b. Enumeration of monadic second-order queries on trees. ACM Trans. Comput. Log. 14, 4 (2013), 25:1--25:12. Google ScholarDigital Library
- Dietrich Kuske and Nicole Schweikardt. 2017. First-order logic with counting. In Proc. 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017), Reykjavik, Iceland, June 20-23, 2017. 1--12. Google ScholarCross Ref
- Andrea Lincoln, Virginia Vassilevska Williams, and R. Ryan Williams. 2018. Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. In Proc. 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA, January 7-10, 2018. 1236--1252. Google ScholarCross Ref
- Katja Losemann and Wim Martens. 2014. MSO queries on trees: enumerating answers under updates. In Proc. Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (CSL-LICS 2014), Vienna, Austria, July 14-18, 2014. 67:1--67:10. Google ScholarDigital Library
- Dániel Marx. 2010. Approximating fractional hypertree width. ACM Trans. Algorithms 6, 2 (2010), 29:1--29:17. Google ScholarDigital Library
- Dániel Marx. 2013. Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries. J. ACM 60, 6 (2013), 42:1--42:51. Google ScholarDigital Library
- Hung Q. Ngo, Ely Porat, Christopher Ré, and Atri Rudra. 2018. Worst-case Optimal Join Algorithms. J. ACM 65, 3 (2018), 16:1--16:40. Google ScholarDigital Library
- Matthias Niewerth. 2018. MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras. In Proc. 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018), Oxford, UK, July 9-12, 2018. 769--778. Google ScholarDigital Library
- Matthias Niewerth and Luc Segoufin. 2018. Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates. In Proc. 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2018), Houston, TX, USA, June 10-15, 2018. 179--191. Google ScholarDigital Library
- Dan Olteanu and Jakub Závodný. 2015. Size Bounds for Factorised Representations of Query Results. ACM Trans. Database Syst. 40, 1 (2015), 2:1--2:44. Google ScholarDigital Library
- Ran Raz. 2003. On the Complexity of Matrix Product. SIAM J. Comput. 32, 5 (2003), 1356--1369. Google ScholarDigital Library
- Nicole Schweikardt, Luc Segoufin, and Alexandre Vigny. 2018. Enumeration for FO Queries over Nowhere Dense Graphs. In Proc. 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2018), Houston, TX, USA, June 10-15, 2018. 151--163. Google ScholarDigital Library
- Luc Segoufin. 2013. Enumerating with constant delay the answers to a query. In Proc. 16th International Conference on Database Theory (ICDT 2013), Genoa, Italy, March 18-22, 2013. 10--20. Google ScholarDigital Library
- Luc Segoufin. 2014. A glimpse on constant delay enumeration (Invited Talk). In Proc. 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), March 5-8, 2014, Lyon, France. 13--27. Google ScholarCross Ref
- Luc Segoufin. 2015. Constant Delay Enumeration for Conjunctive Queries. SIGMOD Record 44, 1 (2015), 10--17. Google ScholarDigital Library
- Luc Segoufin and Alexandre Vigny. 2017. Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion. In Proc. 20th International Conference on Database Theory (ICDT 2017), March 21-24, 2017, Venice, Italy. 20:1--20:16. Google ScholarCross Ref
- Virginia Vassilevska Williams. 2012a. Algorithms column: An overview of the recent progress on matrix multiplication. SIGACT News 43, 4 (2012), 57--59. Google ScholarDigital Library
- Virginia Vassilevska Williams. 2012b. Multiplying matrices faster than Coppersmith-Winograd. In Proc. 44th Symposium on Theory of Computing Conference (STOC 2012), New York, NY, USA, May 19-22, 2012. 887--898. Google ScholarDigital Library
- Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In Proc. 7th International Conference on Very Large Data Bases (VLDB 1981), September 9-11, 1981, Cannes, France. 82--94.Google Scholar
- C. T. Yu and M. Z. Ozsoyoglu. 1979. An algorithm for tree-query membership of a distributed query. In Proc. 3rd IEEE Computer Society's International Computer Software and Applications Conference (COMPSAC 1979), 6-8 November, 1979, Chicago, Illinois, USA. 306--312. Google ScholarCross Ref
- Raphael Yuster and Uri Zwick. 2005. Fast sparse matrix multiplication. ACM Trans. Algorithms 1, 1 (2005), 2--13. Google ScholarDigital Library
Recommendations
On the Enumeration Complexity of Unions of Conjunctive Queries
Best of PODS 2019 and Regular PapersWe study the enumeration complexity of Unions of Conjunctive Queries (UCQs). We aim to identify the UCQs that are tractable in the sense that the answer tuples can be enumerated with a linear preprocessing phase and a constant delay between every ...
Constant Delay Enumeration for Conjunctive Queries
We survey some of the recent results about enumerating the answers to queries over a database. We focus on the case where the enumeration is performed with a constant delay between any two consecutive solutions, after a linear time preprocessing.
This ...
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07: Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science LogicWe study the enumeration complexity of the natural extension of acyclic conjunctive queries with disequalities. In this language, a number of NP-complete problems can be expressed. We first improve a previous result of Papadimitriou and Yannakakis by ...
Comments