Aggregate Evaluability in Statistical Databases
Summary: Models relationships among partitions in statistical summary tables as uniform multipartite intersection hypergraphs, capturing which classes overlap. Under additivity, characterizes cross-table aggregate evaluability and yields polynomial-time tests and query evaluation. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. F. M. Malvestuto (National Commission for Nuclear and Alternative Energy Sources)
- 2. M. Moscarini (University of Rome "Tor Vergata")
BibTeX Citation
@article{malvestuto_vldb89,
title = {{Aggregate Evaluability in Statistical Databases}},
author = {Malvestuto, F. M. and Moscarini, M.},
journal = {PVLDB},
series = {{VLDB} '89},
pages = {279--288},
year = {1989}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,285 | Suppressing marginal cells to protect sensitive information in a two-dimensional statistical table (Extended abstract) | 1991 | PODS | 5.2031683e-05 |
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 |
|---|---|---|---|---|
| 260 | Statistical Databases: Characteristics, Problems, and Some Solutions | 1982 | VLDB | 0.00022880477 |
| 5,216 | Handling Summary Information In A Database: Derivability | 1981 | SIGMOD | 6.2241856e-05 |
| 13,443 | The derivation problem for summary data | 1988 | SIGMOD | 4.9793485e-05 |
| 14,751 | Answering Queries In Categorical Data Bases | 1987 | PODS | - |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,187 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS |
| 2 | 4,176 | Aggregation in Probabilistic Databases via Knowledge Compilation | 2012 | VLDB |
| 3 | 1,503 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 4 | 10,182 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS |
| 5 | 14,751 | Answering Queries In Categorical Data Bases | 1987 | PODS |
| 6 | 6,467 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 7 | 7,343 | On The Recognition Of Coverings Of Acyclic Database Hypergraphs | 1983 | PODS |
| 8 | 2,728 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 9 | 6,994 | Semantic Complexity of Classes of Relational Queries and Query Independent Data Partitioning | 1991 | PODS |
| 10 | 51 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |