Database Paper Browser

Back to papers

Auditing Boolean Attributes

Summary: Audits sum-query databases with Boolean-sensitive attributes; proves continuous-attribute techniques fail and auditing is hard (NP-hard in 2D), so no general efficient solution. Provides an exact 1D range algorithm, a conservative approximate auditor, and methods for max-aggregate variants. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1198
Venue
PODS
Year
2000
Pagerank
0.00011618118
Overall Rank
1,506 | 89.53%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

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