DBScholar

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
870
Venue
PODS
Year
1989
Pagerank
7.4414918e-05
Overall Rank
3,403 | 76.66%
DOI
10.1145/73721.73747

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{faloutsos_pods89,
        address = {New York, NY, USA},
        series = {{PODS} '89},
        title = {{Declustering Using Error Correcting Codes}},
        url = {https://dl.acm.org/doi/10.1145/73721.73747},
        doi = {10.1145/73721.73747},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Faloutsos, Christos and Metaxas, Dimitrios},
        year = {1989}
}

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
52 GAMMA - A High Performance Dataflow Database Machine 1986 VLDB 0.00041107291
133 A Case for Redundant Arrays of Inexpensive Disks (RAID) 1988 SIGMOD 0.00030370315
188 Data Placement In Bubba 1988 SIGMOD 0.00026126036
Previous Page 1 / 1 Next

Semantically Similar Papers