Thumbnail
Access Restriction
Subscribed

Author Duen-Ren Liu ♦ Shekhar, S.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1995
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Application software ♦ Frequency ♦ Computer science ♦ Databases ♦ Concurrent computing ♦ Delay ♦ Polynomials ♦ Round robin ♦ Error correction codes ♦ Lattices
Abstract We propose a new similarity-based technique for declustering data. The proposed method can adapt to available information about query distributions, data distributions, data sizes and partition-size constraints. The method is based on max-cut partitioning of a similarity graph defined over the given set of data, under constraints on the partition sizes. It maximizes the chances that a pair of data-items that are to be accessed together by queries are allocated to distinct disks. We show that the proposed method can achieve optimal speed-up for a query-set, if there exists any other declustering method which will achieve the optimal speed-up. Experiments in parallelizing grid files show that the proposed method outperforms mapping-function-based methods for interesting query distributions as well for non-uniform data distributions.<<ETX>>
Description Author affiliation: Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA (Duen-Ren Liu; Shekhar, S.)
ISBN 0818669101
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1995-03-06
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 812.18 kB
Page Count 9
Starting Page 373
Ending Page 381


Source: IEEE Xplore Digital Library