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.
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Research
Illustrationen
Maße
Höhe: 235 mm
Breite: 155 mm
Dicke: 30 mm
Gewicht
ISBN-13
978-3-540-51295-0 (9783540512950)
DOI
Schweitzer Klassifikation
ITOSS: An integrated toolkit for operating system security.- Heuristic reorganization of clustered files.- Cluster mechanisms supporting the dynamic construction of complex objects.- Query optimization in an extended DBMS.- An algorithm for insertion into a lattice: Application to type classification.- Duplicate detection and deletion in the extended NF2 data model.- Fast exchange sorts.- Efficient organization of semantic databases.- The path length of binary trees.- Efficient multiresolution image processing on hypercube connected SIMD machines.- A heuristic for channel routing.- A language for the p-ary trees.- Dynamic external hashing with guaranteed single access retrieval.- Partial-match retrieval for dynamic files using linear hashing with partial expansions.- An analytical model of a deferred and incremental update strategy for secondary indexes.- A compact multiway merge sorter using VLSI linear-array comparators.- Using logarithmic code-expansion to speedup index access and maintenance.- Concurrency in multidimensional linear hashing.- Retrieving of parts with geometric similarity.- Search for multi-component objects in large spatial databases.- Optimization at a high level of abstraction.- A spatial database shell for relational database management systems.- Une introduction à Prolog III.- Prolog programs and standard data bases.- A distributed locking algorithm for a transactions system in flat concurrent prolog.- Advances in the design of the BANG file.- Manipulating three-dimensional triangulations.- The arc tree: An approximation scheme to represent arbitrary curved shapes.- Behavior analysis of object-oriented databases: Method structure, execution trees, and reachability.- Engineering the object-relation database model in O-raid.- ROOST.-Complex-statistical-table structure and operators for macro statistical databases.- A domain theoretic approach to incomplete information in nested relational databases.- A formal definition of binary topological relationships.- Applying neural computing to expert system design: Coping with complex sensory data and attribute selection.- A concurrency control algorithm for memory-resident database systems.- Timestamp ordering concurrency control mechanisms for transactions of various length.- Shared vs separate inverted files.
