Document Open Access Logo

Building Relational Circuits (Invited Talk)

Author Florent Capelli

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICDT.2026.3.pdf
  • Filesize: 0.88 MB
  • 20 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Information systems → Relational database model
Keywords
  • Conjunctive queries
  • factorized databases
  • knowledge compilation

Metrics

Abstract

We review two algorithms which allow to build a factorized representation of the answers set of join queries. In a nutshell, the representation builds a circuit representing the answers set of a join query by starting from atomic relations and iteratively combine them by either constructing the Cartesian product or the disjoint union of previously computed relations. The first one can be seen as the trace of the celebrated Yannakakis algorithm, building the answer set from the inputs to the output of the circuit while the second adopts a top-down approach which can be seen as a generalization of the exhaustive DPLL algorithm, originally designed to solve the #SAT problem.

Cite As Get BibTex

Florent Capelli. Building Relational Circuits (Invited Talk). In 29th International Conference on Database Theory (ICDT 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 365, pp. 3:1-3:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ICDT.2026.3

Author Details

Florent Capelli
  • Univ. Artois, CNRS, UMR 8188, Centre de Recherche en Informatique de Lens (CRIL), F-62300 Lens, France

Funding

This work was supported by KCODA project, ANR-20-CE48-0004.

Supplementary Materials

References

  1. Mahmoud Abo Khamis, Hung Q Ngo, and Atri Rudra. Faq: questions asked frequently. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 13-28, 2016. URL: https://doi.org/10.1145/2902251.2902280.
  2. Antoine Amarilli, Marcelo Arenas, YooJung Choi, Mikaël Monet, Guy Van den Broeck, and Benjie Wang. A circus of circuits: Connections between decision diagrams, circuits, and automata. CoRR, abs/2404.09674, 2024. URL: https://doi.org/10.48550/arXiv.2404.09674.
  3. Antoine Amarilli, Pierre Bourhis, Florent Capelli, and Mikaël Monet. Ranked enumeration for MSO on trees via knowledge compilation. In Graham Cormode and Michael Shekelyan, editors, 27th International Conference on Database Theory, ICDT 2024, Paestum, Italy, March 25-28, 2024, volume 290 of LIPIcs, pages 25:1-25:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPIcs.ICDT.2024.25.
  4. Antoine Amarilli, Pierre Bourhis, Louis Jachiet, and Stefan Mengel. A circuit-based approach to efficient enumeration. In Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl, editors, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, Warsaw, Poland, July 10-14, 2017, volume 80 of LIPIcs, pages 111:1-111:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.111.
  5. Antoine Amarilli and Florent Capelli. Tractable circuits in database theory. SIGMOD Rec., 53(2):6-20, 2024. URL: https://doi.org/10.1145/3685980.3685982.
  6. Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, and Mikaël Monet. On the complexity of shap-score-based explanations: Tractability via knowledge compilation and non-approximability results. J. Mach. Learn. Res., 24:63:1-63:58, 2023. URL: https://jmlr.org/papers/v24/21-0389.html.
  7. Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. On acyclic conjunctive queries and constant delay enumeration. In Jacques Duparc and Thomas A. Henzinger, editors, Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, volume 4646 of Lecture Notes in Computer Science, pages 208-222. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-74915-8_18.
  8. Guillaume Bagan, Arnaud Durand, Etienne Grandjean, and Frédéric Olive. Computing the jth solution of a first-order query. RAIRO-Theoretical Informatics and Applications, 42(1):147-164, 2008. URL: https://doi.org/10.1051/ITA:2007046.
  9. Paul Beame, Jerry Li, Sudeepa Roy, and Dan Suciu. Lower bounds for exact model counting and applications in probabilistic databases. In Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013. Google Scholar
  10. Paul Beame, Jerry Li, Sudeepa Roy, and Dan Suciu. Counting of query expressions: Limitations of propositional methods. In Proc. 17th International Conference on Database Theory (ICDT), pages 177-188, 2014. URL: https://doi.org/10.5441/002/ICDT.2014.20.
  11. Leopoldo E. Bertossi, Benny Kimelfeld, Ester Livshits, and Mikaël Monet. The shapley value in database management. SIGMOD Rec., 52(2):6-17, 2023. URL: https://doi.org/10.1145/3615952.3615954.
  12. Karl Bringmann, Nofar Carmeli, and Stefan Mengel. Tight fine-grained bounds for direct access on join queries. In Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 427-436, 2022. URL: https://doi.org/10.1145/3517804.3526234.
  13. Randal E Bryant. Graph-based algorithms for boolean function manipulation. Computers, IEEE Transactions on, 100(8):677-691, 1986. URL: https://doi.org/10.1109/TC.1986.1676819.
  14. Florent Capelli and Oliver Irwin. Direct access for conjunctive queries with negations. In Graham Cormode and Michael Shekelyan, editors, 27th International Conference on Database Theory, ICDT 2024, Paestum, Italy, March 25-28, 2024, volume 290 of LIPIcs, pages 13:1-13:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPIcs.ICDT.2024.13.
  15. Florent Capelli, Oliver Irwin, and Sylvain Salvati. A simple algorithm for worst case optimal join and sampling. In Sudeepa Roy and Ahmet Kara, editors, 28th International Conference on Database Theory, ICDT 2025, Barcelona, Spain, March 25-28, 2025, volume 328 of LIPIcs, pages 23:1-23:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.ICDT.2025.23.
  16. Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld, and Mirek Riedewald. Tractable orders for direct access to ranked answers of conjunctive queries. ACM Transactions on Database Systems, January 2023. URL: https://doi.org/10.1145/3578517.
  17. Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, and Nicole Schweikardt. Answering (unions of) conjunctive queries using random access and random-order enumeration. In Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 393-409, 2020. URL: https://doi.org/10.1145/3375395.3387662.
  18. Ashok K Chandra and Philip M Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of the ninth annual ACM symposium on Theory of computing, pages 77-90, 1977. URL: https://doi.org/10.1145/800105.803397.
  19. Edgar F Codd. A relational model of data for large shared data banks. Communications of the ACM, 13(6):377-387, 1970. URL: https://doi.org/10.1145/362384.362685.
  20. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. Introduction to algorithms. MIT press, 2022. Google Scholar
  21. A. Darwiche. Decomposable negation normal form. J. ACM, 48(4):608-647, 2001. URL: https://doi.org/10.1145/502090.502091.
  22. Adnan Darwiche. On the tractable counting of theory models and its application to truth maintenance and belief revision. Journal of Applied Non-Classical Logics, 11(1-2):11-34, 2001. URL: https://doi.org/10.3166/JANCL.11.11-34.
  23. Adnan Darwiche and Pierre Marquis. A Knowledge Compilation Map. Journal of Artificial Intelligence Research, 17:229-264, 2002. URL: https://doi.org/10.1613/JAIR.989.
  24. Arnaud Durand and Stefan Mengel. Structural tractability of counting of solutions to conjunctive queries. Theory Comput. Syst., 57(4):1202-1249, 2015. URL: https://doi.org/10.1007/S00224-014-9543-Y.
  25. Idan Eldar, Nofar Carmeli, and Benny Kimelfeld. Direct access for answers to conjunctive queries with aggregation. arXiv preprint arXiv:2303.05327, 2023. URL: https://doi.org/10.48550/arXiv.2303.05327.
  26. Johannes K Fichte, Markus Hecher, Neha Lodha, and Stefan Szeider. An smt approach to fractional hypertree width. In Principles and Practice of Constraint Programming: 24th International Conference, Lille, France, August 27-31, 2018, Proceedings 24, pages 109-127. Springer, 2018. Google Scholar
  27. Georg Gottlob, Nicola Leone, and Francesco Scarcello. Hypertree decompositions and tractable queries. In Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 21-32. ACM, 1999. URL: https://doi.org/10.1145/303976.303979.
  28. Martin Grohe and Dániel Marx. Constraint solving via fractional edge covers. ACM Transactions on Algorithms (TALG), 11(1):4, 2014. Google Scholar
  29. David Harvey and Joris Van Der Hoeven. Integer multiplication in time o(nlog$$1,n). Annals of Mathematics, 193(2):563-617, 2021. Google Scholar
  30. Jinbo Huang and Adnan Darwiche. DPLL with a trace: From SAT to knowledge compilation. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, pages 156-162, 2005. URL: http://ijcai.org/Proceedings/05/Papers/0876.pdf.
  31. Manas R Joglekar, Rohan Puttagunta, and Christopher Ré. Ajar: Aggregations and joins over annotated relations. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 91-106, 2016. URL: https://doi.org/10.1145/2902251.2902293.
  32. Rafael Kiesel and Thomas Eiter. Knowledge compilation and more with sharpsat-td. In Pierre Marquis, Tran Cao Son, and Gabriele Kern-Isberner, editors, Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023, Rhodes, Greece, September 2-8, 2023, pages 406-416, 2023. URL: https://doi.org/10.24963/KR.2023/40.
  33. Benny Kimelfeld, Wim Martens, and Matthias Niewerth. A formal language perspective on factorized representations. In Sudeepa Roy and Ahmet Kara, editors, 28th International Conference on Database Theory, ICDT 2025, Barcelona, Spain, March 25-28, 2025, volume 328 of LIPIcs, pages 20:1-20:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.ICDT.2025.20.
  34. Tuukka Korhonen and Matti Järvisalo. Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters. In Laurent D. Michel, editor, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), volume 210 of Leibniz International Proceedings in Informatics (LIPIcs), pages 8:1-8:11, Dagstuhl, Germany, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.CP.2021.8.
  35. Jean-Marie Lagniez and Pierre Marquis. An improved decision-dnnf compiler. In Carles Sierra, editor, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pages 667-673. ijcai.org, 2017. URL: https://doi.org/10.24963/IJCAI.2017/93.
  36. Kuldeep S. Meel and Alexis de Colnet. #cfg and #dnnf admit FPRAS. CoRR, abs/2406.18224, 2024. URL: https://doi.org/10.48550/arXiv.2406.18224.
  37. Hung Q. Ngo. Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 111-124. ACM, 2018. URL: https://doi.org/10.1145/3196959.3196990.
  38. Hung Q. Ngo, Ely Porat, Christopher Ré, and Atri Rudra. Worst-case optimal join algorithms: [extended abstract]. In Michael Benedikt, Markus Krötzsch, and Maurizio Lenzerini, editors, Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2012, Scottsdale, AZ, USA, May 20-24, 2012, pages 37-48. ACM, 2012. URL: https://doi.org/10.1145/2213556.2213565.
  39. Hung Q Ngo, Ely Porat, Christopher Ré, and Atri Rudra. Worst-case optimal join algorithms. Journal of the ACM (JACM), 65(3):1-40, 2018. URL: https://doi.org/10.1145/3180143.
  40. Dan Olteanu. Factorized databases: A knowledge compilation perspective. In Adnan Darwiche, editor, Beyond NP, Papers from the 2016 AAAI Workshop, Phoenix, Arizona, USA, February 12, 2016, volume WS-16-05 of AAAI Technical Report. AAAI Press, 2016. URL: http://www.aaai.org/ocs/index.php/WS/AAAIW16/paper/view/12638.
  41. Dan Olteanu and Jiewen Huang. Using obdds for efficient query evaluation on probabilistic databases. In International Conference on Scalable Uncertainty Management, pages 326-340. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-87993-0_26.
  42. Dan Olteanu and Jakub Zavodny. Factorised representations of query results: size bounds and readability. In Alin Deutsch, editor, 15th International Conference on Database Theory, ICDT '12, Berlin, Germany, March 26-29, 2012, pages 285-298. ACM, 2012. URL: https://doi.org/10.1145/2274576.2274607.
  43. Dan Olteanu and Jakub Závodný. Size Bounds for Factorised Representations of Query Results. ACM Transactions on Database Systems, 40(1):1-44, March 2015. URL: https://doi.org/10.1145/2656335.
  44. Reinhard Pichler and Sebastian Skritek. Tractable counting of the answers to conjunctive queries. Journal of Computer and System Sciences, 79(6):984-1001, September 2013. URL: https://doi.org/10.1016/J.JCSS.2013.01.012.
  45. Tian Sang, Fahiem Bacchus, Paul Beame, Henry A Kautz, and Toniann Pitassi. Combining component caching and clause learning for effective model counting. Theory and Applications of Satisfiability Testing, 4:7th, 2004. Google Scholar
  46. Andy Shih, Guy Van den Broeck, Paul Beame, and Antoine Amarilli. Smoothing structured decomposable circuits. In Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d'Alché-Buc, Emily B. Fox, and Roman Garnett, editors, Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, pages 11412-11422, 2019. URL: https://proceedings.neurips.cc/paper/2019/hash/940392f5f32a7ade1cc201767cf83e31-Abstract.html.
  47. Robert E. Tarjan and Mihalis Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13(3):566-579, July 1984. URL: https://doi.org/10.1137/0213035.
  48. Timothy van Bremen and Kuldeep S Meel. Probabilistic query evaluation: The combined fpras landscape. In Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 339-347, 2023. URL: https://doi.org/10.1145/3584372.3588677.
  49. Todd Veldhuizen. Triejoin: A Simple, Worst-Case Optimal Join Algorithm. Proceedings of the 17th International Conference on Database Theory (ICDT), Athens, Greece, 2014, 17(13):96-106, 2014. URL: https://doi.org/10.5441/002/ICDT.2014.13.
  50. Mihalis Yannakakis. Algorithms for Acyclic Database Schemes. In Proceedings of the Seventh International Conference on Very Large Data Bases - Volume 7, pages 82-94. VLDB Endowment, 1981. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact