Skip to main content
SpringerLink
Log in
Book cover

Foundations of Data Organization and Algorithms

3rd International Conference, FODO 1989, Paris, France, June 21-23, 1989. Proceedings

  • Conference proceedings
  • © 1989

Overview

Editors:
  1. Witold Litwin
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hans-Jörg Schek
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (38 papers)

  1. Front Matter

    Download chapter PDF

  2. ITOSS: An integrated toolkit for operating system security

    • Michael Rabin, J. D. Tygar
    Pages 1-15

  3. Heuristic reorganization of clustered files

    • Peter Scheuermann, Young Chul Park, Edward Omiecinski
    Pages 16-30

  4. Cluster mechanisms supporting the dynamic construction of complex objects

    • H. Schöning, A. Sikeler
    Pages 31-46

  5. Query optimization in an extended DBMS

    • Beng Chin Ooi, Ron Sacks-Davis
    Pages 47-63

  6. An algorithm for insertion into a lattice: Application to type classification

    • M. Missikoff, M. Scholl
    Pages 64-82

  7. Duplicate detection and deletion in the extended NF2 data model

    • K. Küspert, G. Saake, L. Wegner
    Pages 83-100

  8. Fast exchange sorts

    • Nachum Dershowitz, Hon-Wai Leong
    Pages 101-113

  9. Efficient organization of semantic databases

    • Naphtali Rishe
    Pages 114-127

  10. The path length of binary trees

    • Rolf Klein, Derick Wood
    Pages 128-136

  11. Efficient multiresolution image processing on hypercube connected SIMD machines

    • Larry S. Davis, P. J. Narayanan
    Pages 137-154

  12. A heuristic for channel routing

    • E. Lodi, F. P. Preparata
    Pages 155-170

  13. A language for the p-ary trees

    • Gerard LEVY
    Pages 171-186

  14. Dynamic external hashing with guaranteed single access retrieval

    • M. V. Ramakrishna, Walid R. Tout
    Pages 187-201

  15. Partial-match retrieval for dynamic files using linear hashing with partial expansions

    • Kotagiri Ramamohanarao, John Shepherd, Ron Sacks-Davis
    Pages 202-216

  16. An analytical model of a deferred and incremental update strategy for secondary indexes

    • Edward Omiecinski, Wei Liu, Ian Akyildiz
    Pages 217-222

  17. A compact multiway merge sorter using VLSI linear-array comparators

    • Tetsuji Satoh, Hideaki Takeda, Nobuo Tsuda
    Pages 223-227

  18. Using logarithmic code-expansion to speedup index access and maintenance

    • Martin L. Kersten
    Pages 228-232

  19. Concurrency in multidimensional linear hashing

    • M. Ouksel, Jalal Abdul-Ghaffar
    Pages 233-240

  20. Retrieving of parts with geometric similarity

    • R. Schneider, H.-P. Kriegel, B. Seeger, S. Heep
    Pages 241-245
Back to top

Keywords

About this book

The Third International Conference on Foundations of Data Organization and Algorithms has been organized by INRIA in Paris from June 21 to 23, 1989. Previous FODO Conferences were held in Warsaw, 1981, and in Kyoto, 1985. The goal of this year's conference is to present advances in techniques of permanent and temporary data organization in different fields. New applications such as image processing, graphics, geographic data processing, robotics, office automation, information systems, language translation, and expert systems have developed various data organizations and algorithms specific to the application requirements. The growing importance of these applications has created a need for general studies on data organization and algorithms as well as for specific studies on new database management systems and on filing services. The articles submitted for the conference were subject to the usual rigorous reviewing process and selected on that basis. They offer an excellent snapshot of the state of the art in the field and should prove invaluable for computer scientists faced by the problems of data organization which are raised by these new applications.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation