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
12564
Venue
VLDB
Year
2021
Pagerank
6.1535623e-05
Overall Rank
4,469 | 68.95%
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
329 Neo: A Learned Query Optimizer 2019 VLDB 0.00027301488
662 Database Tuning Advisor for Microsoft SQL Server 2005 2004 VLDB 0.00018478597
1,443 Compressing SQL Workloads 2002 SIGMOD 0.00011944621
3,344 F1 Query: Declarative Querying at Scale 2018 VLDB 7.1944106e-05
3,750 DIAMetrics: Benchmarking Query Engines at Scale 2020 VLDB 6.7864305e-05
4,280 Primitives for Workload Summarization and Implications for SQL 2003 VLDB 6.28375e-05
4,679 Adaptive Sampling for Rapidly Matching Histograms 2018 VLDB 5.9978792e-05
6,085 Answering Top-k Representative Queries on Graph Databases 2014 SIGMOD 5.2165029e-05
8,360 Query Log Compression for Workload Analytics 2019 VLDB 4.5314883e-05
8,361 Efficient Summarization Framework for Multi-Attribute Uncertain Data 2014 SIGMOD 4.5314883e-05
Previous Page 1 / 1 Next

Semantically Similar Papers