Declustering using error correcting codes

Christos Faloutsos, Dimitrios Metaxas

Research output: Chapter in Book/Report/Conference proceedingConference contribution

24 Scopus citations

Abstract

The problem examined is to distribute a binary cartesian product file on multiple disks to maximize the parallelism for partial match queries. Cartesian product files appear as a result of some secondary key access methods, such as the multiattribute hashing, the grid file etc. For the binary case, the problem is reduce into grouping the 2n binary strings on n bits in m groups of unsimilar strings. The main idea proposed in this paper is to group the strings such that the group forms an Error Correcting Code (ECC). This construction guarantees that the strings of a given group will have large Hamming distances, ie., they will differ in many bit positions. Intuitively, this should result into good declustering.

Original languageEnglish (US)
Title of host publicationProc Eighth ACM SIGACT-SIGMOD-SIGART Symp Princ Database Syst
PublisherPubl by ACM
Pages253-258
Number of pages6
ISBN (Print)0897913086, 9780897913089
DOIs
StatePublished - 1989
Externally publishedYes
EventProceedings of the Eight ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - Philadelphia, PA, USA
Duration: Mar 29 1989Mar 31 1989

Publication series

NameProc Eighth ACM SIGACT-SIGMOD-SIGART Symp Princ Database Syst

Other

OtherProceedings of the Eight ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
CityPhiladelphia, PA, USA
Period3/29/893/31/89

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Declustering using error correcting codes'. Together they form a unique fingerprint.

Cite this