Compressing Large Boolean Matrices Using Reordering Techniques
Summary: Lossless compression of large boolean matrices by reordering columns treated as points in high-dimensional Hamming space, reduced to a TSP instance. An instance-partitioning and sampling strategy adapts TSP heuristics for scalability, yielding faster disk access and improved compression on visualization and graph/mining workloads. (summarized by gpt-5-nano on Feb 09 2026)
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,470 | Processing a Trillion Cells per Mouse Click | 2012 | VLDB | 0.00011827274 |
| 5,605 | Approximate Encoding for Direct Access and Query Processing over Compressed Bitmaps | 2006 | VLDB | 5.413565e-05 |
| 7,640 | Bitlist: New Full-text Index for Low Space Cost and Efficient Keyword Search | 2013 | VLDB | 4.6859388e-05 |
| 8,655 | Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices | 2022 | VLDB | 4.4687769e-05 |
| 10,390 | HyperMR: Efficient Hypergraph-enhanced Matrix Storage on Compute-in-Memory Architecture | 2025 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 33 | BIRCH: An Efficient Data Clustering Method for Very Large Databases | 1996 | SIGMOD | 0.00077399244 |
| 1,955 | Performance Measurements of Compressed Bitmap Indices | 1999 | VLDB | 9.9641178e-05 |
| 5,861 | Walking Through A Very Large Virtual Environment In Real-time | 2001 | VLDB | 5.2955821e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,970 | Compressed Linear Algebra for Large-Scale Machine Learning | 2016 | VLDB | 9.9024431e-05 |
| 5,879 | Column Partition and Permutation for Run Length Encoding in Columnar Databases | 2020 | SIGMOD | 5.2875479e-05 |
| 8,424 | Tree-Encoded Bitmaps | 2020 | SIGMOD | 4.5111681e-05 |
| 8,534 | Biclustering and Boolean Matrix Factorization in Data Streams | 2020 | VLDB | 4.4893996e-05 |
| 1,572 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011296109 |
| 1,134 | Dictionary-based Order-preserving String Compression for Main Memory Column Stores | 2009 | SIGMOD | 0.00013751593 |
| 689 | Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences | 1997 | SIGMOD | 0.00018069077 |
| 6,340 | Rearranging Data to Maximize the Efficiency of Compression | 1986 | PODS | 5.0985531e-05 |
| 1,551 | A Memory Efficient Reachability Data Structure Through Bit Vector Compression | 2011 | SIGMOD | 0.00011395294 |
| 8,655 | Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices | 2022 | VLDB | 4.4687769e-05 |