Partitioning similarity graphs: A framework for declustering problems

Information Systems

Volumn 21, Issue 6, 1996, Pages 475-496

  Liu, Duen Ren ^a   Shekhar, Shashi ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b University of Minnesota   (United States)

Author keywords

Declustering; Geographic Databases; Grid File; Parallel Databases; Similarity Graph

Indexed keywords

CONSTRAINT THEORY; DATA PROCESSING; GEOGRAPHIC INFORMATION SYSTEMS; GRAPH THEORY; HEURISTIC METHODS; MAGNETIC DISK STORAGE; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; QUERY LANGUAGES; STORAGE ALLOCATION (COMPUTER);

ATOMIC DATA ITEMS; DATA DISTRIBUTION; DATA SIZES; DECLUSTERING; GEOGRAPHIC DATABASES; GRAPH PARTITIONING; GRID FILE; PARALLEL DATABASES; PARTITION SIZE CONSTRAINTS; SIMILARITY GRAPH;

DATABASE SYSTEMS;

EID: 0030233888     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/0306-4379(96)00024-5     Document Type: Article

References (35)

1. E.R. Barnes. An algorithm for partitioning the nodes of a graph. SIAM Journal Alg. Disc. Meth., 3(4):541-550 (1982).
2. W. J. Camp, S. J. Plimpton et al.. Massively parallel methods for engineering and science problems. Communication of ACM, 37(4):31-41 (1994).
3. C.C. Chang and C.Y. Cheng. Performance of two-disk partition data allocations. BIT, 27(3):306-314 (1987).
4. L. T. Chen and D. Rotem. Declustering objects for visualization. In Proc. of Intl Conference on Very Large Data Bases, pp. 85-96, Dublin, Ireland (1993).
5. C.K. Cheng and Y.C. Wei. An improved two-way partitioning algorithm with stable performance. IEEE Trans. on Computer-Aided Design, 10(12):1502-1511 (1991).
6. D.J. DeWitt et al.. The gamma database machine project. IEEE Trans. on Knowledge and Data Engineering, 2(1) (1990).
7. H. C. Du. Disk allocation methods for binary cartesian product files. BIT, 26(2):138-147 (1986).
8. H. C. Du and J. S. Sobolewski. Disk allocation for product files on multiple disk systems. ACM Trans. on Database Systems, 7(1):82-101 (1982).
9. C. Faloutsos and P. Bhagwat. Declustering using fractals. In Proc. of Intl Symposium on Databases in Parallel and Distributed Systems, pp. 18-25 (1993).
10. C. Faloutsos and I. Kamel. Beyond uniformity and independence : Analysis of R-trees using the concept of fractal dimension. In Proc. Symp. on Principles of Database Systems, SIGMOD-SIGACT PODS, pp. 4-13, Minneapolis, MN (1994).
11. C. Faloutsos and D. Metaxas. Disk allocation methods using error correcting codes. IEEE Trans. on Computers, 40(8):907-914 (1991).
12. M.T. Fang, R.C.T. Lee, and C.C. Chang. The idea of declustering and its applications. In Proc. of Intl Conference on Very Large Databases, VLDB, pp. 181-188, Kyoto, Japan (1986).
13. C.M. Fiduccia and R.M. Mattheyses. A linear time heuristic for improving network partitions. In Proc. of 19th Design Automation Conference, pp. 175-181, Las Vegas, Nevada (1982).
14. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979).
15. S. Ghandeharizadeh and D.J. DeWitt. A mutltiuser performance analysis of alternative declustering strategies. In Proc. of the 6th Intl Conference on Data Engineering, IEEE, pp. 466-475, Los Angeles, CA (1990).
16. S. Ghandeharizadeh and D.J. DeWitt. Hybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machine. In Proc. of Intl Conference on Very Large Databases, VLDB, pp. 481-492, Brisbane, Australia (1990).
17. S. Ghandeharizadeh, D.J. DeWitt, and W. Qureshi. A performance analysis of alternative multi-attribute declustering strategies. In Proc. of Intl Conference on Management of Data, ACM SIGMOD, pp. 29-38, San Diego, CA (1992).
18. B. Himmatsingka and J. Srivastava. Performance evaluation of grid based multi-attribute record declustering methods. In Proc. of the Tenth Intl Conference on Data Engineering, IEEE, pp. 356-365, Housten, Texas (1994).
19. H.V. Jagadish. Linear clustering of objects with multiple attributes. In Proc. of Intl Conference on Management of Data, ACM SIGMOD, pp. 332-342, Atlantic, NJ (1990).
20. I. Kamel and C. Faloutsos. Parallel R-trees. In Proc. of Intl Conference on Management of Data, ACM SIGMOD, pp. 195-204, San Diego, CA (1992).
21. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. In Proc. Intl Conference on Parallel Processing, ICPP, 3, pp. 113-122, Oconomowoc, Wisconsin (1995).
22. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J., 49(2):291-307 (1970).
23. K. Kim and V.K. Prasanna. Latin squares for parallel array access. IEEE Trans. on Parallel and Distributed Systems, 4(4):361-370 (1993).
24. M.H. Kim and S. Pramanik. Optimal file distribution for partial match queries. In Proc. of SIGMOD Conference on Management of Data, ACM, pp. 173-182, Chicago, IL (1988).
25. V. Kouramajian, R. Elmasri, and A. Chaudhry. Declustering techniques for parallelizing temporal access structures. In Proc. of the Tenth Intl Conference on Data Engineering, IEEE, pp. 232-242, Housten, Texas (1994).
26. R. Krishnamurthy and K.-Y. Whang. Multilevel grid files. IBM Research Report, Yorktown Heights (1985).
27. J. Li, J. Srivastava, and D. Rotem. CMD: A multidimensional declustering method for parallel database systems. In Proc. of Intl Conference on Very Large Data Bases, pp. 3-14, Vancouver, B.C., Canada (1992).
28. D.-R. Liu. Database Design for Spatial Network Management Systems: Clustering and Declustering Techniques. Ph.D. dissertation, Department of Computer Science, University of Minnesota (1995).
29. J. Nievergelt, H. Hinteberger, and K.D. Sevcik. The grid file: An adaptable, symmetric multi-key file structure. ACM Trans. on Database Systems, 9(1):38-71 (1984).
30. D. Rotem, G.A. Schloss, and A. Segev. Data allocation for multidisk databases. IEEE Trans. on Knowledge and Data Engineering, 5(5):882-887 (1993).
31. B. Seeger and P.A. Larson. Multi-disk B-trees. In Proc. of Intl Conference on Management of Data, ACM SIGMOD, pp. 436-445, Denver, Colorado (1991).
32. S. Shekhar, S. Ravada, et al.. al. Load-balancing in high performance GIS: Partitioning polygonal maps. In Proc. of 4th Symposium on Spatial Databases, SSD'95, pp. 197-215, Portland, Maine (1995).
33. G. Weikum, P. Zabback, and P. Scheuermann. Dynamic file allocation in disk arrays. In Proc. of Intl Conference on Management of Data, ACM SIGMOD, pp. 406-415, Denver, Colorado (1991).
34. C.W. Yeh, C.K. Cheng, and T.T. Y. Lin. A general purpose multiple way partitioning algorithm. In Proc. of 28th ACM/IEEE Design Automation Conference, pp. 421-426, San Francisco, CA (1991).
35. Y. Zhou, S. Shekhar, and M. Coyle. Disk allocation methods for parallelizing grid files. In Proc. of the Tenth Intl Conference on Data Engineering, IEEE, pp. 243-252, Housten, Texas (1994).