Database Paper Browser

Back to papers

Aggregate Evaluability In Statistical Databases

Summary: Proposes intersection dependency among partitions of statistical tables, modeled as an intersection hypergraph, to enable cross-table queries. Assuming additivity, gives polynomial-time criteria for evaluable queries and algorithms for testing evaluability and evaluating across the hypergraph. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7908
Venue
VLDB
Year
1989
Pagerank
4.1945683e-05
Overall Rank
12,947 | 9.93%
DOI
-

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 1 of 1 citing papers.

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.

Rank Cited Paper Year Venue Pagerank
89 Statistical Databases: Characteristics, Problems, and Some Solutions 1982 VLDB 0.0005230007
4,323 Handling Summary Information In A Database: Derivability 1981 SIGMOD 6.2885419e-05
12,958 The derivation problem for summary data 1988 SIGMOD 4.1945683e-05
14,240 Answering Queries In Categorical Data Bases 1987 PODS -
Previous Page 1 / 1 Next

Semantically Similar Papers