Declustering signature files based on a dynamic measure

For processing a signature in parallel, a declustering algorithm that must avoid data skew and execution skew is needed. In this paper we propose a new signature file declustering method, called MIN-entropy, that achieves balanced distribution for effective parallel processing. The MIN-entropy declu...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 2000-06, Vol.74 (5), p.235-241
Main Authors: Im, Byoung-Mo, Kim, Myoung Ho, Kang, Hyung-Il, Yoo, Jae Soo
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Information retrieval
Information retrieval. Graph
Information systems. Data bases
Information theory
Memory organisation. Data processing
Parallel database
Parallel processing
Signature file
Signatures
Software
Studies
Theoretical computing
Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For processing a signature in parallel, a declustering algorithm that must avoid data skew and execution skew is needed. In this paper we propose a new signature file declustering method, called MIN-entropy, that achieves balanced distribution for effective parallel processing. The MIN-entropy declusters a signature file based on a new dynamic measure of execution load, called signature-entropy, that is derived from the previously declustered signature. Since the MIN-entropy effectively declusters a signature file by using the dynamic measure, it can provide high performance for a variety of workloads and configurations. We show through the simulation experiments that the MIN-entropy improves performance under various data workloads.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(00)00059-4