Optimizing spatial data structures for static data

  • Lukas Bachmann
  • Bernd-Uwe Pagel
  • Hans-Werner Six
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 884)


During the last decade various spatial data structures have been designed and compared against each other, all of them reflecting a dynamic situation with ongoing object insertion and deletion processes. Assuming the frequently occurring situation where the data is known in beforehand and using as performance measure the expected number of data bucket accesses needed to perform a window query, the original dynamic clustering problem turns into a classical optimization problem. For the special case of bucket capacity c b = 2 we present a mapping onto the well-known graph matching problem. For the general case of c b ≥ 3 and arbitrary cost functions, the optimization problem is NP-hard. In first experiments with simulated annealing heuristics the best dynamic structures are outperformed by more than 25%. However, we understand our contribution as a lower bound result rather than another speed-up variant of classical spatial data structures.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 47–57, Boston, 1984.Google Scholar
  2. 2.
    Henrich, A., Six, H.-W., and Widmayer, P.: The LSD-tree: spatial access to multidimensional point-and non-point objects. In: 15th Int. Conf. on VLDB, pp. 45–53, Amsterdam, 1989.Google Scholar
  3. 3.
    Kamel, I. and Faloutsos, C.: On packing R-trees. In: Proc. 2nd Int. Conf. on Information and Knowledge Management, pp. 490–499, Washington D.C., 1993.Google Scholar
  4. 4.
    Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rhinehart and Winston, 1976.Google Scholar
  5. 5.
    Meyer, B. Eiffel: The Language. Prentice Hall, 1991.Google Scholar
  6. 6.
    Pagel, B.-U. and Six, H.-W.: On optimal static spatial data structures. Technical report, University of Hagen, in preparation.Google Scholar
  7. 7.
    Pagel, B.-U., Six, H.-W., and Toben, H.: The transformation technique for spatial objects revisited. In: Abel, D., Ooi, B.-C. (eds.): Proc. 3rd Int. Symposium on Large Spatial Databases (SSD), pp. 73–88, Singapore, June 1993. Lecture Notes in Computer Science No. 692, Springer Verlag.Google Scholar
  8. 8.
    Pagel, B.-U., Six, H.-W., Toben, H., and Widmayer, P.: Towards an analysis of range query performance in spatial data structures. In: Proc. ACM 12th Symposium on Principles of Database Systems (PODS), pp. 214–221, Washington, D.C., May 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Lukas Bachmann
    • 1
  • Bernd-Uwe Pagel
    • 1
  • Hans-Werner Six
    • 1
  1. 1.University of HagenGermany

Personalised recommendations