ACM SIGMOD Anthology VLDB dblp.uni-trier.de

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}
}
BibTeX

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

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

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 BibTeX

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 BibTeX
[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) BibTeX
[Chan85]
...
[Cher76]
David R. Cheriton, Robert Endre Tarjan: Finding Minimum Spanning Trees. SIAM J. Comput. 5(4): 724-742(1976) BibTeX
[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) BibTeX
[Du82a]
...
[Du84b]
...
[Dube80]
Richard C. Dubes, Anil K. Jain: Clustering Methodologies in Exploratory Data Analysis. Advances in Computers 19: 113-228(1980) BibTeX
[Frie75]
...
[Lee81]
...
[Lee82]
...
[Lee79]
...
[Papa76]
Christos H. Papadimitriou, Kenneth Steiglitz: Some Complexity Results for the Traveling Salesman Problem. STOC 1976: 1-9 BibTeX
[Prim57]
...
[Rolh73]
...
[Shen78]
...
[Sibs73]
R. Sibson: SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method. Comput. J. 16(1): 30-34(1973) BibTeX
[Wu83]
C. Thomas Wu, Walter A. Burkhard: Associative Searching in Multiple Storage Units. ACM Trans. Database Syst. 12(1): 38-64(1987) BibTeX
[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) BibTeX
[Zahn71]
...

Referenced by

  1. Randeep Bhatia, Rakesh K. Sinha, Chung-Min Chen: Hierarchical Declustering Schemes for Range Queries. EDBT 2000: 525-537
  2. Chung-Min Chen, Rakesh K. Sinha: Raster-Spatial Data Declustering Revisited: An Interactive Navigation Perspective. ICDE 1999: 600-607
  3. Shashi Shekhar, Sivakumar Ravada, Vipin Kumar, Douglas Chubb, Greg Turner: Declustering and Load-Balancing Methods for Parallelizing Geographic Information Systems. IEEE Trans. Knowl. Data Eng. 10(4): 632-655(1998)
  4. Bongki Moon, Joel H. Saltz: Scalability Analysis of Declustering Methods for Multidimensional Range Queries. IEEE Trans. Knowl. Data Eng. 10(2): 310-327(1998)
  5. Chialin Chang, Anurag Acharya, Alan Sussman, Joel H. Saltz: T2: A Customizable Parallel Database for Multi-Dimensional Data. SIGMOD Record 27(1): 58-66(1998)
  6. C. Y. Chen, H. F. Lin, Chin-Chen Chang, Richard C. T. Lee: Optimal Bucket Allocation Design of k-ary MKH Files for Partial Match Retrieval. IEEE Trans. Knowl. Data Eng. 9(1): 148-160(1997)
  7. Chialin Chang, Bongki Moon, Anurag Acharya, Carter Shock, Alan Sussman, Joel H. Saltz: Titan: A High-Performance Remote Sensing Database. ICDE 1997: 375-384
  8. Nick Koudas, Christos Faloutsos, Ibrahim Kamel: Declustering Spatial Databases on a Multi-Computer Architecture. EDBT 1996: 592-614
  9. Duen-Ren Liu, Shashi Shekhar: A Similarity Graph-Based Approach to Declustering Problems and Its Application towards Paralleling Grid Files. ICDE 1995: 373-381
  10. Goetz Graefe: Query Evaluation Techniques for Large Databases. ACM Comput. Surv. 25(2): 73-170(1993)
  11. Myoung-Ho Kim, Sakti Pramanik: Optimal File Distribution For Partial Match Retrieval. SIGMOD Conference 1988: 173-182
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
VLDB Proceedings: Copyright © by VLDB Endowment,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:45:29 2009