Database Paper Browser

Back to papers

A Unifying Algorithm for Hierarchical Queries

Summary: Hierarchical self-join-free BCQs mark the exact tractability boundary for the bag-set maximization problem—NP-complete for non-hierarchical queries. A single polynomial algorithm over an abstract 2-monoid unifies probabilistic evaluation, Shapley-value computation, and bag-set maximization via different 2-monoid instantiations. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
1990
Venue
PODS
Year
2026
Pagerank
4.1945683e-05
Overall Rank
10,001 | 30.43%
DOI
10.1145/3767710

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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 4 of 4 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers