Tractable Database Design through Bounded Treewidth

Summary: Restricting FD sets to bounded-treewidth hypergraphs (via primal or incidence graph views) yields a tractable database-design regime. Provides polynomial-time, highly parallel algorithms and novel key/primality characterizations for attribute primality, 3NF and BCNF tests. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 1383
Venue: PODS
Year: 2006
Pagerank: 5.2045536e-05
Overall Rank: 9,864 | 32.33%
DOI: 10.1145/1142351.1142370

Incoming Non-self Citations Over Time

Authors

1. Georg Gottlob (Vienna University of Technology)
2. Reinhard Pichler (Vienna University of Technology)
3. Fang Wei (Vienna University of Technology)

BibTeX Citation

@inproceedings{gottlob_pods06,
        address = {New York, NY, USA},
        series = {{PODS} '06},
        title = {{Tractable Database Design through Bounded Treewidth}},
        url = {https://dl.acm.org/doi/10.1145/1142351.1142370},
        doi = {10.1145/1142351.1142370},
        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 = {2006}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
370	TEDI: Efficient Shortest Path Query Answering on Graphs	2010	SIGMOD	0.00019937972
4,943	Datalog Unchained	2021	PODS	6.4332239e-05
13,785	Monadic Datalog over Finite Structures with Bounded Treewidth	2007	PODS	-

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	13,170	Logical Design of Relational Database Schemes	1987	PODS
2	6,798	Practical algorithms for finding prime attributes and testing normal forms	1989	PODS
3	6,516	The Design of non-1NF Relational Databases into Nested Normal Form	1987	SIGMOD
4	11,338	A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition	2024	VLDB
5	7,759	The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability	2010	PODS
6	10,781	Synthesizing Third Normal Form Schemata that Minimize Integrity Maintenance and Update Overheads: Parameterizing 3NF by the Numbers of Minimal Keys and Functional Dependencies	2025	SIGMOD
7	13,120	Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation	1990	SIGMOD
8	7,640	Tractable Lineages on Treelike Instances: Limits and Extensions	2016	PODS
9	7,029	Tree-Width and Functional Dependencies in Databases	2008	PODS
10	2,678	Weighted Hypertree Decompositions and Optimal Query Plans	2004	PODS