The Idea of De-Clustering and its Applications.

M. T. Fang, Richard C. T. Lee, Chin-Chen Chang: The Idea of De-Clustering and its Applications. VLDB 1986: 181-188

@inproceedings{DBLP:conf/vldb/FangLC86,
  author    = {M. T. Fang and
               Richard C. T. Lee and
               Chin-Chen Chang},
  editor    = {Wesley W. Chu and
               Georges Gardarin and
               Setsuo Ohsuga and
               Yahiko Kambayashi},
  title     = {The Idea of De-Clustering and its Applications},
  booktitle = {VLDB'86 Twelfth International Conference on Very Large Data Bases,
               August 25-28, 1986, Kyoto, Japan, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1986},
  isbn      = {0-934613-18-4},
  pages     = {181-188},
  ee        = {db/conf/vldb/FangLC86.html},
  crossref  = {DBLP:conf/vldb/86},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

The idea of de-clustering is defined as follows: Given a set of data, divide them into two groups such that these two groups are similar to each other. We shall show that this de-clustering technique can be used to solve the multi-disk data allocation problem for parallel processing.

Copyright © 1986 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb7588 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Wesley W. Chu, Georges Gardarin, Setsuo Ohsuga, Yahiko Kambayashi (Eds.): VLDB'86 Twelfth International Conference on Very Large Data Bases, August 25-28, 1986, Kyoto, Japan, Proceedings. Morgan Kaufmann 1986, ISBN 0-934613-18-4
Contents

References

[Bent78]: ...
[Bent80]: ...
[Chan80]: Chin-Chen Chang, Richard C. T. Lee, David Hung-Chang Du: Some Properties of Cartesian Product Files. SIGMOD Conference 1980: 157-168
[Chan84]: Chin-Chen Chang, M. W. Du, Richard C. T. Lee: Performance Analyses of Cartesian Product Files and Random Files. IEEE Trans. Software Eng. 10(1): 88-99(1984)
[Chan85]: ...
[Cher76]: David R. Cheriton, Robert Endre Tarjan: Finding Minimum Spanning Trees. SIAM J. Comput. 5(4): 724-742(1976)
[Dayh69]: ...
[Dijk59]: ...
[Du82]: David Hung-Chang Du, J. S. Sobolewski: Disk Allocation for Cartesian Product Files on Multiple-Disk Systems. ACM Trans. Database Syst. 7(1): 82-101(1982)
[Du82a]: ...
[Du84b]: ...
[Dube80]: Richard C. Dubes, Anil K. Jain: Clustering Methodologies in Exploratory Data Analysis. Advances in Computers 19: 113-228(1980)
[Frie75]: ...
[Lee81]: ...
[Lee82]: ...
[Lee79]: ...
[Papa76]: Christos H. Papadimitriou, Kenneth Steiglitz: Some Complexity Results for the Traveling Salesman Problem. STOC 1976: 1-9
[Prim57]: ...
[Rolh73]: ...
[Shen78]: ...
[Sibs73]: R. Sibson: SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method. Comput. J. 16(1): 30-34(1973)
[Wu83]: C. Thomas Wu, Walter A. Burkhard: Associative Searching in Multiple Storage Units. ACM Trans. Database Syst. 12(1): 38-64(1987)
[Yao75]: Andrew Chi-Chih Yao: An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees. Inf. Process. Lett. 4(1): 21-23(1975)
[Zahn71]: ...