Document Open Access Logo

An Experimental Study of the Treewidth of Real-World Graph Data

Authors Silviu Maniu, Pierre Senellart, Suraj Jog

Thumbnail PDF


  • Filesize: 0.73 MB
  • 18 pages

Document Identifiers

Author Details

Silviu Maniu
  • LRI, CNRS, Université Paris-Sud, Université Paris-Saclay, Orsay, France
Pierre Senellart
  • DI ENS, ENS, CNRS, PSL University, Paris, France
  • Inria Paris, France
  • LTCI, Télécom ParisTech, Paris, France
Suraj Jog
  • University of Illinois at Urbana–Champaign, Urbana-Champaign, USA


We are grateful to Antoine Amarilli and Mikaël Monet for feedback on parts of this paper.

Cite AsGet BibTex

Silviu Maniu, Pierre Senellart, and Suraj Jog. An Experimental Study of the Treewidth of Real-World Graph Data. In 22nd International Conference on Database Theory (ICDT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 127, pp. 12:1-12:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)


Treewidth is a parameter that measures how tree-like a relational instance is, and whether it can reasonably be decomposed into a tree. Many computation tasks are known to be tractable on databases of small treewidth, but computing the treewidth of a given instance is intractable. This article is the first large-scale experimental study of treewidth and tree decompositions of real-world database instances (25 datasets from 8 different domains, with sizes ranging from a few thousand to a few million vertices). The goal is to determine which data, if any, can benefit of the wealth of algorithms for databases of small treewidth. For each dataset, we obtain upper and lower bound estimations of their treewidth, and study the properties of their tree decompositions. We show in particular that, even when treewidth is high, using partial tree decompositions can result in data structures that can assist algorithms.

Subject Classification

ACM Subject Classification
  • Theory of computation → Logic and databases
  • Treewidth
  • Graph decompositions
  • Experiments
  • Query processing


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Serge Abiteboul, Richard Hull, and Victor Vianu. Addison-Wesley, 1995.
  2. Ittai Abraham, Amos Fiat, Andrew V Goldberg, and Renato F Werneck. Highway dimension, shortest paths, and provably efficient algorithms. In SODA, 2010. Google Scholar
  3. Aaron B. Adcock, Blair D. Sullivan, and Michael W. Mahoney. Tree decompositions and social graphs. Internet Mathematics, 12(5), 2016. Google Scholar
  4. M. Ajtai, R. Fagin, and L. J. Stockmeyer. The Closure of Monadic NP. JCSS, 60(3), 2000. Google Scholar
  5. Takuya Akiba, Christian Sommer, and Ken-ichi Kawarabayashi. Shortest-Path Queries for Complex Networks: Exploiting Low Tree-width Outside the Core. In EDBT, 2012. Google Scholar
  6. Réka Albert and Albert-László Barabási. Statistical mechanics of complex networks. Rev. Mod. Phys., 74, 2002. Google Scholar
  7. Antoine Amarilli, Pierre Bourhis, Louis Jachiet, and Stefan Mengel. A Circuit-Based Approach to Efficient Enumeration. In ICALP, 2017. Google Scholar
  8. Antoine Amarilli, Pierre Bourhis, and Pierre Senellart. Provenance Circuits for Trees and Treelike Instances. In ICALP, 2015. Google Scholar
  9. Antoine Amarilli, Pierre Bourhis, and Pierre Senellart. Tractable Lineages on Treelike Instances: Limits and Extensions. In PODS, 2016. Google Scholar
  10. Antoine Amarilli, Silviu Maniu, and Mikaël Monet. Challenges for Efficient Query Evaluation on Structured Probabilistic Data. In SUM, 2016. Google Scholar
  11. Antoine Amarilli, Mikaël Monet, and Pierre Senellart. Connecting Width and Structure in Knowledge Compilation. In ICDT, pages 6:1-6:17, 2018. URL:
  12. Eyal Amir. Approximation Algorithms for Treewidth. Algorithmica, 56(4):448-479, 2010. Google Scholar
  13. Stefan Arnborg, Derek G. Corneil, and Andrzej Proskuworski. Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Methods, 8(2), 1987. Google Scholar
  14. Guillaume Bagan. MSO queries on tree decomposable structures are computable with linear delay. In CSL, volume 4207, 2006. Google Scholar
  15. Albert-László Barabási and Márton Pósfai. Network science. Cambridge University Press, 2016. Google Scholar
  16. Anne Berry, Pinar Heggernes, and Geneviève Simonet. The Minimum Degree Heuristic and the Minimal Triangulation Process. Graph-Theoretic Concepts in Computer Science, 2880(Chapter 6), 2003. Google Scholar
  17. Hans L. Bodlaender. A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput., 25(6), 1996. Google Scholar
  18. Hans L. Bodlaender, Fedor V Fomin, Arie M C A Koster, Dieter Kratsch, and Dimitrios M Thilikos. On exact algorithms for treewidth. ACM TALG, 9(1), 2012. Google Scholar
  19. Hans L. Bodlaender and Arie M C A Koster. Treewidth Computations I. Upper Bounds. Information and Computation, 208(3), 2010. Google Scholar
  20. Hans L. Bodlaender and Arie M C A Koster. Treewidth Computations II. Lower Bounds. Information and Computation, 209(7), 2011. Google Scholar
  21. Hans L. Bodlaender, Arie M. C. A. Koster, and Thomas Wolle. Contraction and Treewidth Lower Bounds. In ESA, 2004. Google Scholar
  22. Angela Bonifati, Wim Martens, and Thomas Timm. An Analytical Study of Large SPARQL Query Logs. PVLDB, 11(2), 2017. Google Scholar
  23. François Clautiaux, Jacques Carlier, Aziz Moukrim, and Stéphane Nègre. New Lower and Upper Bounds for Graph Treewidth. In WEA, 2003. Google Scholar
  24. Bruno Courcelle. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Inf. Comput., 85(1), 1990. Google Scholar
  25. Nilesh N. Dalvi and Dan Suciu. The dichotomy of conjunctive queries on probabilistic structures. In PODS, 2007. Google Scholar
  26. Holger Dell, Christian Komusiewicz, Nimrod Talmon, and Mathias Weller. The PACE 2017 Parametrized Algorithms and Computation Experiments Challenge: The Second Iteration. In IPEC, 2017. Google Scholar
  27. Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Customizable Contraction Hierarchies. Journal of Experimental Algorithmics, 21(1), 2016. Google Scholar
  28. Vida Dujmović, David Eppstein, and David R Wood. Structure of Graphs with Locally Restricted Crossings. SIAM J. Discrete Maths, 31(2), 2017. Google Scholar
  29. Arnaud Durand and Yann Strozecki. Enumeration Complexity of Logical Query Problems with Second-order Variables. In CSL, 2011. Google Scholar
  30. Paul Erdős and Alfréd Rényi. On Random Graphs I. Publicationes Mathematicae (Debrecen), 6, 1959. Google Scholar
  31. Johannes K. Fichte, Neha Lodha, and Stefan Szeider. SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. In Serge Gaspers and Toby Walsh, editors, Theory and Applications of Satisfiability Testing - SAT 2017, 2017. Google Scholar
  32. Jörg Flum, Markus Frick, and Martin Grohe. Query evaluation via tree-decompositions. J. ACM, 49(6), 2002. Google Scholar
  33. Markus Frick and Martin Grohe. Deciding first-order properties of locally tree-decomposable structures. J. ACM, 48(6), 2001. Google Scholar
  34. Robert Ganian, Petr Hliněnỳ, Alexander Langer, Jan Obdržálek, Peter Rossmanith, and Somnath Sikdar. Lower bounds on the complexity of MSO1 model-checking. JCSS, 1(80), 2014. Google Scholar
  35. Yong Gao. Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs. Discrete Applied Mathematics, 160(4–5), 2012. Google Scholar
  36. Vibhav Gogate and Rina Dechter. A Complete Anytime Algorithm for Treewidth. In UAI, 2004. Google Scholar
  37. Martin Grohe, Thomas Schwentick, and Luc Segoufin. When is the Evaluation of Conjunctive Queries Tractable? In STOC, 2001. Google Scholar
  38. Daniel John Harvey. On Treewidth and Graph Minors. PhD thesis, The University of Melbourne, 2014. Google Scholar
  39. Abhay Jha and Dan Suciu. On the Tractability of Query Compilation and Bounded Treewidth. In ICDT, 2012. Google Scholar
  40. Abhay Kumar Jha and Dan Suciu. Knowledge Compilation Meets Database Theory: Compiling Queries to Decision Diagrams. Theory Comput. Syst., 52(3), 2013. Google Scholar
  41. Wojciech Kazana and Luc Segoufin. Enumeration of first-order queries on classes of structures with bounded expansion. In PODS, 2013. Google Scholar
  42. Daphne Koller and Nir Friedman. Probabilistic Graphical Models: Principles and Techniques. The MIT Press, 2009. Google Scholar
  43. Arie M. C. A. Koster, Thomas Wolle, and Hans L. Bodlaender. Degree-Based Treewidth Lower Bounds. In WEA, 2005. Google Scholar
  44. Stephan Kreutzer. Algorithmic Meta-Theorems. CoRR, abs/0902.3616, 2009. Google Scholar
  45. Stephan Kreutzer and Siamak Tazari. Lower bounds for the complexity of monadic second-order logic. In LICS, 2010. Google Scholar
  46. S. L. Lauritzen and D. J. Spiegelhalter. Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems. Journal of the Royal Statistical Society Series B (Methodological), 50(2), 1988. Google Scholar
  47. Silviu Maniu, Reynold Cheng, and Pierre Senellart. An Indexing Framework for Queries on Probabilistic Graphs. ACM Trans. Database Syst., 42(2), 2017. Google Scholar
  48. Silviu Maniu, Pierre Senellart, and Suraj Jog. An Experimental Study of the Treewidth of Real-World Graph Data (Extended Version)., 2019. URL:
  49. Harry M. Markowitz. The Elimination Form of the Inverse and Its Application to Linear Programming. Management Science, 3(3), 1957. Google Scholar
  50. Mikaël Monet. Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances. In SIGMOD PhD Symposium, 2016. Google Scholar
  51. M. E. J. Newman, D. J. Watts, and S. H. Strogatz. Random graph models of social networks. In Proceedings of the National Academy of Sciences, 2002. Google Scholar
  52. Mark E. J. Newman, Steven H. Strogatz, and Duncan J. Watts. Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E, 64, July 2001. Google Scholar
  53. François Picalausa and Stijn Vansummeren. What are real SPARQL queries like? In SWIM, 2011. Google Scholar
  54. Léon Planken, Mathijs de Weerdt, and Roman van der Krogt. Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. Journal of Artificial Intelligence Research, 43, 2012. Google Scholar
  55. Luca Pulina and Armando Tacchella. An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing. Fundamenta Informaticae, 102:391-427, 2010. Google Scholar
  56. Neil Robertson and Paul D. Seymour. Graph minors. III. Planar tree-width. J. Comb. Theory, Ser. B, 36(1), 1984. Google Scholar
  57. S. Saluja, K.V. Subrahmanyam, and M.N. Thakur. Descriptive Complexity of #P Functions. JCSS, 50(3), 1995. Google Scholar
  58. James W. Thatcher and Jesse B. Wright. Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic. Math. Systems Theory, 2(1), 1968. Google Scholar
  59. Thomas van Dijk, Jan-Pieter van den Heuvel, and Wouter Slob. Computing treewidth with LibTW. Technical report, University of Utrecht, 2006. Google Scholar
  60. M. Y. Vardi. The Complexity of Relational Query Languages (Extended Abstract). In STOC, 1982. Google Scholar
  61. D. J. Watts and S. H. Strogatz. Collective dynamics of small-world networks. Nature, 393, 1998. Google Scholar
  62. Fang Wei. TEDI: efficient shortest path query answering on graphs. In SIGMOD, 2010. Google Scholar
  63. Thomas Wolle. Computational aspects of treewidth: Lower bounds and network reliability. PhD thesis, Utrecht University, 2005. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail