The transformation technique for spatial objects revisited

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


The transformation technique is one of the earliest approaches for storing a set of bounding boxes of arbitrary geometric objects such that insertion, deletion and proximity queries can be carried out with reasonable performance. The basic idea is to transform the bounding boxes into points in higher dimensional space in order to apply data structures for points which are better understood and easier to handle. Even though the basic concept of the transformation idea at first glance seems fascinatingly simple and elegant, the majority of the data structure community regard this technique as less appropriate because some of its properties are considered harmful.

Main contribution of this paper is to shed some new light on the transformation technique in a sense that some of these properties can be proven to be harmless while the harmful ones can be overcome by new methods. Furthermore, we demonstrate that new kinds of transformations which take other than pure location parameters into account, provide the transformation technique with new quality.


Image Space Geometric Object Query Range Domain Space Transformation Technique 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Freeston, M.W.: The BANG file: a new kind of grid file. In: Proc. ACM SIGMOD Int. Conf. on the Management of Data, pp. 260–169, San Francisco 1987.Google Scholar
  2. 2.
    Günther, O. (ed.): Efficient structures for geometric data management, volume 337 of Lecture Notes in Computer Science. Springer Verlag, Berlin 1988.Google Scholar
  3. 3.
    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
  4. 4.
    Henrich, A., Six, H.-W.: How to split buckets in spatial data structures. In: Gambosi, G., Scholl, M., Six, H.-W. (eds.): Geographic Database Management Systems, pp. 212–244, Capri (Italy), May 1991. Esprit Basic Research Series DG XIII, Springer-Verlag.Google Scholar
  5. 5.
    Henrich, A., Six, H.-W., 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
  6. 6.
    Hutflesz, A., Six, H.-W., Widmayer, P.: The R-file: an efficient access structure for proximity queries. In: Proc. 6th Int. Conf. on Data Engineering, pp. 372–379, Los Angeles 1990.Google Scholar
  7. 7.
    Kriegel, H.-P., Seeger, B.: Multidimensional order preserving linear hashing with partial expansions. In: Proc. Int. Conf. on Database Theory, pp. 203–220, Rome 1986.Google Scholar
  8. 8.
    Krishnamurthy, R., Whang, K.-Y.: Multilevel grid files. Research report, IBM Yorktown Heights (1985).Google Scholar
  9. 9.
    Meyer, B.: Eiffel: The Language. Prentice Hall (1991).Google Scholar
  10. 10.
    Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: an adaptable, symmetric multikey file structure. ACM Transactions on Database Systems, 9(1):38–71 (1984).Google Scholar
  11. 11.
    Ohler, T.: The multi class grid file: an access structure for multi class range queries. In: Proc. 5th Int. Symp. on Spatial Data Handling, pp. 260–271, Charleston 1992.Google Scholar
  12. 12.
    Pagel, B.-U., Six, H.-W., Toben, H., Widmayer, P.: Towards an analysis of range query performance in spatial data structures. In: Proc. ACM 12th Symposium on Principles of Database Systems (PODS), Washington D.C., May 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Bernd-Uwe Pagel
    • 1
  • Hans-Werner Six
    • 1
  • Heinrich Toben
    • 1
  1. 1.FernUniversität HagenDeutschland

Personalised recommendations