Database Paper Browser

Back to papers

Rearranging Data to Maximize the Efficiency of Compression

Summary: Permute categories per attribute to maximize compression of multi-attribute categorical data; deterministic RLE category-rearrangement is NP‑complete via a reduction from rectilinear TSP. Under a probabilistic model the optimal order is a “double pipe organ”, with an O(n^2) algorithm for k‑dimensional data (fixed k). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
752
Venue
PODS
Year
1986
Pagerank
5.1026755e-05
Overall Rank
6,343 | 55.88%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
1,598 Semantic Compression and Pattern Extraction with Fascicles 1999 VLDB 0.00011202905
11,067 Partition, Don’t Sort! Compression Boosters for Cloud Data Ingestion Pipelines 2024 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers