Database Paper Browser

Back to papers

MDL Summarization with Holes

Summary: MDL-based summaries of query results as S minus H for k-d cubes with tree hierarchies, holes as exceptions. 1-D solvable in linear time; 2-D NP-hard; proposes greedy, DP, and QP heuristics with experiments showing shorter summaries than prior work. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9325
Venue
VLDB
Year
2005
Pagerank
6.3436747e-05
Overall Rank
4,218 | 70.69%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
1,096 Interpretable and Informative Explanations of Outcomes 2015 VLDB 0.00014088686
7,172 Summarized Causal Explanations For Aggregate Views 2024 SIGMOD 4.8068645e-05
7,200 Guided Exploration of Data Summaries 2022 VLDB 4.7980895e-05
7,460 Compact Histograms for Hierarchical Identifiers 2006 VLDB 4.7198214e-05
8,109 The Cascading Analysts Algorithm 2018 SIGMOD 4.5807394e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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