Skip to main content
SpringerLink
Log in
Book cover

British National Conference on Databases

BNCOD 1993: Advances in Databases pp 1–22Cite as

Begriffsverzeichnis: a concept index

  • Invited Papers
  • Conference paper
  • First Online:

  • 135 Accesses

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

Abstract

This paper describes a generalised technique for the indexing of data structures of different complexities. It represents the culmination of a long research effort to devise efficient and well-behaved indexing for the lowlevel support of persistent programming languages: more specifically, persistent logic programming and object-oriented programming environments, which the author sees as the future of database systems.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger. The R*-Tree: an efficient and robust access method for points and rectangles. Proc. ACM SIGMOD Conf., 1990.

    Google Scholar 

  2. J.L. Bentley. Multidimensional Binary Search Trees in Database Applications. IEEE Trans. on Soft. Eng., Vol. SE-5, No. 4, July 1979.

    Google Scholar 

  3. J.L. Bentley and J.H. Friedman. Data Structures for Range Searching. ACM Computing Surveys, Vol. 11, No. 4, December 1979.

    Google Scholar 

  4. W.A. Burkhard. Interpolation-Based Index Maintenance. Proc. ACM SIGMOD-SIGACT Symposium, 1983.

    Google Scholar 

  5. R. Fagin, J. Nievergelt, N. Pippenger and H.R. Strong. Extendible Hashing: A Fast Access Method for Dynamic Files. ACM-TODS, Vol. 4, No. 3, September 1979.

    Google Scholar 

  6. M.W. Freeston. Data Structures for Knowledge Bases: Multi-Dimensional File Organisations. ECRC, Technical Report TR-KB-13, 1986.

    Google Scholar 

  7. M. Freeston. The BANG File: a New Kind of Grid File. Proc. ACM SIGMOD Conf., San Francisco, May 1987.

    Google Scholar 

  8. M. Freeston. Grid files for Efficient Prolog Clause Access. Prolog and Databases: Implementations and Applications, Ed. Gray P.M.D. and Lucas R.J., Pub. Ellis Horwood.

    Google Scholar 

  9. M. Freeston. Advances in the design of the BANG File. 3rd International Conference on Foundations of Data Organization and Algoritms (FODO), Paris, June 1989.

    Google Scholar 

  10. M. Freeston. A Well-Behaved File Structure for the Storage of Spatial Objects. Symposium on the Design and Implementation of Large Spatial Databases, Santa Barbara, California, July 1989, Lecture Notes in Computer Science No. 409, Springer-Verlag, 1989.

    Google Scholar 

  11. M. Freeston. The Comparative Performance of BANG Indexing for Spatial Objects. 5th International Symposium on Spatial Data Handling, Charleston, South Carolina, August 1992.

    Google Scholar 

  12. M. Freeston. On the Generalised Indexing of Complex Structures. ECRC Technical Report ECRC-93-9, May 1993.

    Google Scholar 

  13. M. Freeston. On the Generalised Application of Spatial Indexing Techniques in Deductive GIS Systems. British Computer Journal, special issue on spatial data, Ed. Freeston and Nievergelt, October 1993 [In preparation].

    Google Scholar 

  14. G. Gardarin, P. Valduriez, Y. Viemont. Les Arbres de Predicats. INRIA, Rapports de Recherche, No. 203, April 1983.

    Google Scholar 

  15. O. Gunther. The Design of the Cell Tree: an Object-Oriented Index Structure for Geometric Databases. Proc. IEEE 5th Int. Conf. on Data Engineering, Los Angeles, 1989.

    Google Scholar 

  16. A. Guttman. R-trees: a dynamic index structure for spatial searching. Proc. ACM SIGMOD Conf., Boston, 1984.

    Google Scholar 

  17. A. Henrich, H.-W. Six and P. Widmayer. The LSD-tree: Spatial Access to Multidimensional Point and Non-point Objects. 15th Int. Conf. on Very Large Data Bases (VLDB), 1989.

    Google Scholar 

  18. K.H. Hinrichs. The grid file system: implementation and case studies of applications. Doctoral Thesis Nr. 7734, ETH Zürich, 1985.

    Google Scholar 

  19. A. Hutflesz, H.-W. Six and P. Widmayer. The Twin Grid File: A Nearly Space Optimal Index Structure. Proc. 1st Int. Conf. on Extending Database Technology (EDBT), Venice, Italy, March 1988, Lecture Notes in Computer Science No. 303, Springer-Verlag, 1988.

    Google Scholar 

  20. A. Hutflesz, H.-W. Six and P. Widmayer. The R-file: An Efficient Access Structure for Proximity Queries. Proc. 6th Int. Conf. on Data Engineering, 1990.

    Google Scholar 

  21. H.P. Kriegel, M. Schiwietz, R. Schneider and B. Seeger. A Performance Comparison of Multidimensional Point and Spatial Access Methods. Proc. Symposium on Large Spatial Databases, Zürich, 1990, Lecture Notes in Computer Science No. 409, Springer-Verlag, 1990.

    Google Scholar 

  22. D.T. Lee, C.K. Wong. Quintary Trees: A File Structure for Multidimensional Database Systems. ACM-TODS, Vol. 5, No. 3, September 1980.

    Google Scholar 

  23. D.B. Lomet and B. Salzberg. The hB-tree: a Robust Multi-Attribute Indexing Method. ACM Trans. on Database Systems, Vol. 15, 4, 1989.

    Google Scholar 

  24. J. Nievergelt, H. Hintenberger, K.C. Sevcik. The Grid File: an adaptable, symmetric multikey file structure. Internal Report No. 46, Institut für Informatik, ETH Zurich, December 1981.

    Google Scholar 

  25. Y. Ohsawa and M. Sakauchi. The BD-Tree: a new n-dimensional data structure with highly efficient dynamic characteristics. IFIP 9th World Computer Congress, Paris, 1983.

    Google Scholar 

  26. J.A. Orenstein. Spatial Query Processing in an Object-Oriented Database System. Proc. ACM SIGMOD Conf., 1986.

    Google Scholar 

  27. E.J. Otoo. A Multidimensional Digital Hashing Scheme for Files with Composite Keys. ACM 1985.

    Google Scholar 

  28. M. Ouksel and P. Scheuermann. Storage Mapping for Multidimensional Linear Dynamic Hashing. Proc. of 2nd Symposium on Principles of Database Systems, Atlanta, 1983.

    Google Scholar 

  29. E.A. Ozkarahan and M. Ouksel. Dynamic and Order Preserving Data Partitioning for Database Machines. Proc. of 11th Int. Conf. on Very Large Data Bases, Stockholm, August 1985.

    Google Scholar 

  30. J.T. Robinson. The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes. Proc. ACM SIGMOD Conf., 1981.

    Google Scholar 

  31. H. Samet. Quadtrees and Related Hierarchical Data Structures for Computer Graphics and Image Processing, 1986.

    Google Scholar 

  32. H. Samet. The Design and Analysis of Spatial Data Structures. Pub. Addison Wesley, 1989.

    Google Scholar 

  33. B. Seeger and H.P. Kriegel. Design and Implementation of Spatial Access Methods. Proc. 14th Int. Conf on Very Large Data Bases (VLDB), Long Beach, California, 1988.

    Google Scholar 

  34. B. Seeger and H.P. Kriegel. The Buddy-tree: an Efficient and Robust Access Method for Spatial Data Base Systems. Proc. 16th Int. Conf. on Very Large Data Bases, Brisbane, 1990.

    Google Scholar 

  35. T. Sellis, N. Roussopoulos and C. Faloutsos. The R+ Tree: a Dynamic Index for Multi-dimensional Objects. Proceeding 13th Int. Conf. on Very Large Data Bases, Brighton, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ECRC, Arabellastrasse 17, DW-8000, Munich 81, Germany

    Michael Freeston

Authors
  1. Michael Freeston
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Frederick Worboys Anna Frances Grundy

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freeston, M. (1993). Begriffsverzeichnis: a concept index. In: Worboys, M.F., Grundy, A.F. (eds) Advances in Databases. BNCOD 1993. Lecture Notes in Computer Science, vol 696. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56921-9_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-56921-9_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56921-3

  • Online ISBN: 978-3-540-47785-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation