Database Paper Browser

Back to papers

Comprehensive and Efficient Workload Compression

Summary: Construct a representative workload from an input analytical workload with guarantees on representativity and coverage. A greedy, approximation-guaranteed algorithm solves the NP-hard problem, preserving distributions and outliers, and compares with sampling and clustering. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12563
Venue
VLDB
Year
2021
Pagerank
6.1584035e-05
Overall Rank
4,468 | 68.92%
DOI
10.14778/3430915.3430931

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

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.

Rank Cited Paper Year Venue Pagerank
333 Neo: A Learned Query Optimizer 2019 VLDB 0.00027206884
661 Database Tuning Advisor for Microsoft SQL Server 2005 2004 VLDB 0.00018481174
1,443 Compressing SQL Workloads 2002 SIGMOD 0.00011947004
3,355 F1 Query: Declarative Querying at Scale 2018 VLDB 7.1829142e-05
3,789 DIAMetrics: Benchmarking Query Engines at Scale 2020 VLDB 6.7644737e-05
4,287 Primitives for Workload Summarization and Implications for SQL 2003 VLDB 6.2891702e-05
4,681 Adaptive Sampling for Rapidly Matching Histograms 2018 VLDB 6.0034918e-05
6,080 Answering Top-k Representative Queries on Graph Databases 2014 SIGMOD 5.2214553e-05
8,364 Query Log Compression for Workload Analytics 2019 VLDB 4.5357797e-05
8,365 Efficient Summarization Framework for Multi-Attribute Uncertain Data 2014 SIGMOD 4.5357797e-05
Previous Page 1 / 1 Next

Semantically Similar Papers