Database Paper Browser

Back to papers

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
1384
Venue
PODS
Year
2006
Pagerank
4.2936538e-05
Overall Rank
9,740 | 32.25%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
376 TEDI: Efficient Shortest Path Query Answering on Graphs 2010 SIGMOD 0.00025097452
5,705 Datalog Unchained 2021 PODS 5.3621239e-05
13,585 Monadic Datalog over Finite Structures with Bounded Treewidth 2007 PODS -
Previous Page 1 / 1 Next

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
Previous Page 1 / 1 Next

Semantically Similar Papers