Database Paper Browser

Back to papers

Declustering Using Error Correcting Codes

Summary: Partition 2^n binary tuples into m disk groups by forming Error Correcting Codes so each group has large intra-group Hamming distance, maximizing parallelism for partial-match queries. Proves a necessary optimality condition and shows ECC declustering outperforms prior heuristics and is close to the theoretical bound. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
871
Venue
PODS
Year
1989
Pagerank
7.6679843e-05
Overall Rank
3,043 | 78.84%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

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
20 GAMMA - A High Performance Dataflow Database Machine 1986 VLDB 0.00086459551
50 A Case for Redundant Arrays of Inexpensive Disks (RAID) 1988 SIGMOD 0.00067394827
197 Data Placement In Bubba 1988 SIGMOD 0.00035201758
Previous Page 1 / 1 Next

Semantically Similar Papers