Skip to main content
Springer Nature Link
Log in

A declustering algorithm for minimising spatial join cost

  • Session 11: Algorithms and Applications
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1276))

Included in the following conference series:

  • 121 Accesses

Abstract

Spatial joins are important, yet time-consuming operations in spatial databases. In this paper we consider to minimise the I/O cost for the spatial join processing. A graph model is proposed to formalise the cost, and an algorithm originally proposed for distributed database design is adapted for spatial object declustering. We improve the algorithm by giving special consideration to the clusters with overlapped objects. Our algorithm can not only reduce the number of objects fetched from disk for refinement processing, but also be computationally more efficient than the previous algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. J. Abel. BIRO-DBMS: A database toolkit for geographical information systems. Int. J. Geographical Information Systems, 4(3):443–464, 1989.

    Google Scholar 

  2. T. Brinkhoff, H. P. Kriegel, and B. Seeger. Efficient processing of spatial joins using R-trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 237–246, 1993.

    Google Scholar 

  3. R. H. Güting. An introduction to spatial database systems. The VLDB J., 3(4):357–399, 1994.

    Google Scholar 

  4. J. A. Hoffer and D. J. Severance. The use of cluster analysis in physical database design. In Proc. 1st Int. Conf. on Very Large Data Bases, 1975.

    Google Scholar 

  5. S. Navathe and S. Ceri. Vertical partitioning algorithms for database design. ACM Trans. on Database Systems, 9(4), 1984.

    Google Scholar 

  6. J. Orenstein and F. A. Manola. Probe spatial data modeling and query processing in an image database application. IEEE TOSE, 14(5):611–629, 1988.

    Google Scholar 

  7. F. P. Preparata and M. I. Shamos. Computational Geometry: an introduction. Springer-Verlag, 1985.

    Google Scholar 

  8. P. Valduriez. Join indices. ACM Trans. Database Systems, 12(2):219–246, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Maths and Computing, University of Southern Queensland, QLD 4350, Toowoomba, Australia

    Yanchun Zhang & Jitian Xiao

  2. CSIRO Mathematical and Information Sciences, GPO Box 664, 2601, Canberra, ACT, Australia

    Xiaofang Zhou

Authors
  1. Yanchun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jitian Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaofang Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tao Jiang D. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Y., Xiao, J., Zhou, X. (1997). A declustering algorithm for minimising spatial join cost. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045103

Download citation

  • DOI: https://doi.org/10.1007/BFb0045103

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63357-0

  • Online ISBN: 978-3-540-69522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics