Abstract
In this paper, we propose an efficient declustering algorithm which is adaptable in different data distribution. Previous declustering algorithms have a potential drawback by assuming data distribution is uniform. However, our method shows a good declustering performance for spatial data regardless of data distribution by taking it into consideration. First, we apply a spatial clustering algorithm to find the distribution in the underlying data and then allocate a disk page to each unit of cluster. Second, we analyize the effect of outliers on the performance of declustering algorithm and propose to handle them separately. Experimental results show that these approaches outperform traditional declustering algorithms based on tiling and mapping function such as DM, FX, HCAM and Golden Ratio Sequence.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Du, H.C., Sobolewski, J.S.: Disk Allocation for Cartisian Files on Multiple-Disk Systems. Int. J.ACM TODS, Vol. 7,No.1, (1982) 82–102
Fang, M.T., Lee, R.C.T., Chang, C.C.: The Idea of De-Clustering and Its Applications. VLDB (1986) 181–188
Faloutsos, C., Metaxas, D.: Disk Allocation methods using error correcting codes. Int. J. IEEE Trans on Computers, Vol. 40,No. 8, (1991) 907–914
Faloutsos, C., Bhagwat, P.: Declustering using fractals. Parallel and Distributed Information Systems Conf (1993) 18–25
Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An efficient data clustering methods for very large databases. SIGMOD (1996) 103–114
Kang, I.S., Kim, T.W.,, Li, K.J.: A spatial data mining method by delaunay triangulation. Proc. ACM-GIS. (1997) 35–39
Leutenegger, S.T., Lopez, M.A., Edgington, J.M.: STR: A simple and efficient algorithm for r-tree packing. ICDE. (1997) 497–506
Abdel-Ghaffar, K., Abbadi, A.E.: Optimal allocation of two-dimensional data. ICDT (1997) 409–418
Sheikhleslami, G., Chatterjee, S., Zhang, A.:Wavecluster: A multi-resolusion clustering approach for very large spatial databases. VLDB (1998) 428–439
Guha, S., Rastogi, R., Shim, K.: CURE: An efficient clustering algorithms for large databases. SIGMOD (1998) 73–84
Knorr, E., Ng, R.: Algorithms for Mining Distance-Based Outliers in Large Datasets. VLDB (1998) 392–403
Barnett, V., Lewis, T.: Outliers in Statistical Data. Third Edition, John Wiley & Sons Ltd. (1998)
Moon, B.K., Saltz, J.H.: Scalability Analysis of Declustering Methods for Multidimensional Range Queries. Int. J. IEEE TKDE, Vol. 10,No. 2, (1998) 310–327
Prabhakar, S., Abdel-Ghaffar, K., El Abbadi, A.: Cyclic allocation of twodimensional data. ICDE (1998) (94–101)
Ramaswamy, S., Rastogi, R., Shim, K.: Efficient Algorithms for Mining Outliers from Large Data Sets. SIGMOD (2000) (427–438)
Bhatia, R., Sinha, R.K., Chen, C.-M.:Declustering using golden ratio sequences. ICDE (2000) 271–280
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, HC., Li, KJ. (2001). Declustering Spatial Objects by Clustering for Parallel Disks. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_45
Download citation
DOI: https://doi.org/10.1007/3-540-44759-8_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42527-4
Online ISBN: 978-3-540-44759-7
eBook Packages: Springer Book Archive