DBScholar

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
606
Venue
PODS
Year
1982
Pagerank
5.7171307e-05
Overall Rank
7,053 | 51.62%
DOI
10.1145/588111.588118

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{maier_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{Connections in Acyclic Hypergraphs -- Extended Abstract}},
        url = {https://dl.acm.org/doi/10.1145/588111.588118},
        doi = {10.1145/588111.588118},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Maier, David and Ullman, Jeffrey D.},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

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