Monadic Datalog over Finite Structures with Bounded Treewidth
Summary: Compile MSO-definable properties on bounded-treewidth structures into monadic datalog over the structure+tree decomposition, avoiding finite tree automaton state explosion. Prove linear-time evaluation in both program and data size for this datalog fragment and validate with a new PRIMALITY algorithm and prototype experiments. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Georg Gottlob (University of Oxford)
- 2. Reinhard Pichler (Vienna University of Technology)
- 3. Fang Wei (Vienna University of Technology)
BibTeX Citation
@inproceedings{gottlob_pods07,
address = {New York, NY, USA},
series = {{PODS} '07},
title = {{Monadic Datalog over Finite Structures with Bounded Treewidth}},
url = {https://dl.acm.org/doi/10.1145/1265530.1265554},
doi = {10.1145/1265530.1265554},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Gottlob, Georg and Pichler, Reinhard and Wei, Fang},
year = {2007}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,180 | Monadic Datalog and the Expressive Power of Languages for Web Information Extraction | 2002 | PODS | 9.0110009e-05 |
| 9,864 | Tractable Database Design through Bounded Treewidth | 2006 | PODS | 5.2045536e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,099 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS |
| 2 | 6,661 | Complexity of Nonrecursive Logic Programs with Complex Values | 1998 | PODS |
| 3 | 7,972 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS |
| 4 | 11,639 | Deciding Boundedness of Monadic Sirups | 2021 | PODS |
| 5 | 6,184 | Expressive power and data complexity of nonrecursive query languages for lists and trees (Extended Abstract) | 2000 | PODS |
| 6 | 9,959 | Datalog with First-Class Facts | 2025 | VLDB |
| 7 | 7,640 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS |
| 8 | 6,301 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS |
| 9 | 5,579 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS |
| 10 | 2,969 | Expressive and efficient pattern languages for tree-structured data (extended abstract) | 2000 | PODS |