Partitioning Similarity Graphs: A Framework for Declustering Problems

@article{Liu1996PartitioningSG,
  title={Partitioning Similarity Graphs: A Framework for Declustering Problems},
  author={Duen-Ren Liu and Shashi Shekhar},
  journal={Inf. Syst.},
  year={1996},
  volume={21},
  pages={475-496}
}
Declustering problems are well-known in the databases for parallel computing environments. In this paper, we propose a new similarity-based technique for declustering data. The proposed method can adapt to the available information about query distribution (e.g. size, shape and frequency) and can work with alternative atomic data-types. Furthermore, the proposed method is flexible and can work with alternative data distributions, data sizes and partition-size constraints. The method is based on… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 57 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Linear Clustering of Objects with Multiple Attributes

H V Jagadzsh, T Bell Laboratones Murray Hdl
1998

Database Design for Spatial Network Management Systems: Clustering and Declustering Techniques

D.-R. Liu
Ph.D. dissertation, Department of Computer Science, • 1995

Load-balancing in high performance GIS: Partitioning polygonal maps

S. Shekhar, S. Ravada, et al.. al
In Proc. of 4th Symposium on Spatial Databases, • 1995

A general purpose, multiple-way partitioning algorithm

IEEE Trans. on CAD of Integrated Circuits and Systems • 1994

Performance evaluation of grid based multi-attribute record declustering methods

B. Himmatsingka, J. Srivastava
In Pruc. of the Tenth Intl Conference on Data Engineering, • 1994

Similar Papers

Loading similar papers…