Database Paper Browser

Back to papers

Connections in Acyclic Hypergraphs -- Extended Abstract

Summary: Generalizes graph blocks↔biconnected components to hypergraphs, yielding a unique-connection notion for acyclic hypergraphs. Shows universal relations of acyclic join dependencies ⇔ uniquely connected acyclic hypergraphs, and aligns Graham with tableau reduction. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
607
Venue
PODS
Year
1982
Pagerank
5.1417208e-05
Overall Rank
6,240 | 56.60%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
1,557 Beyond Worst-case Analysis for Joins with Minesweeper 2014 PODS 0.00011392493
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