Foundations of data organization and algorithms. 3rd international conference, FODO 1989, Paris, France, June 21-23, 1989. Proceedings (Q1187671)

[The articles of this volume will not be indexed individually.] The existence of FODO conferences reflects the growing need for general studies on data organization and algorithms as well as for specific studies on new database systems, all connected to a variety of applications processing large amount of data. The proceedings of FODO 1989 contain 27 papers selected by the program committee for full presentation, 8 short presentations, and 3 invited talks. The topics discussed there include tools to comprise the ITOSS model for computer security, inplace reorganization of files, query optimization, variations of sorting, spatial-, nested relational-, object oriented-, and statistical databases, detecting and deleting duplicates, sorting, hashing, channel routing, updating secondary indexes, path length of binary trees, representation of curved shapes, concurrency control mechanisms, effective processing of images on hypercubes, efficient implementation of semantic data models, interfacing databases and AI, Prolog III, application of neural networks in expert system design, structures for inverted files, and retrieving similar data. The proceedings start with the chapter `Operating systems and data organization' consisting of three articles --- ITOSS: an integrated toolkit for operating systems security by \textit{M. Rabin} and \textit{J. D. Tygar} (invited talk), Heuristic reorganization of clustered files by \textit{P. Scheuerman}, \textit{Y. C. Park}, and \textit{E. Omiecinski}, and Cluster mechanisms supporting the dynamic construction of complex objects by \textit{H. Schöning} and \textit{A. Sikeler}. The title of the second chapter is `Data organization for extended DBMSs'; three articles are included here. Query optiization in an extended DBMS by \textit{B. C. Ooi} and \textit{R. Sacks-Davis}, An algorithm for insertion into a lattice: application to type classification of \textit{M. Missikoff} and \textit{M. Scholl}, and Duplicate detection and deletion in the extended \(NF^ 2\) data model by \textit{K. Küspert}, \textit{G. Saake} and \textit{L. Wegner}. The next chapter addresses `Efficiency of data organizations' and contains Fast exchange sorts by \textit{N. Dershowitz} and \textit{H. W. Leong}, Efficient organization of semantic databases by \textit{N. Rishe}, and The path length of binary trees by \textit{R. Klein} and \textit{D. Wood}. The fourth chapter deals with `New technologies'; Efficient multiresoluting image processing on hypercube connected SIMD machines by \textit{L. S. Davis} and \textit{P. J. Narayanan} (invited talk) and A heuristic for channel routing by \textit{E. Lodi} and \textit{F. P. Preparata} are included here. The theme of the fifth chapter is `Basic data structures'; in fact all three articles here deal with some form of hashing. These are: A language for the \(P\)-ary trees --- Application to the dynamic virtual hashing methods by \textit{G. Levy}, Dynamic external hashing with guaranteed single access retrieval by \textit{M. V. Ramakrishna} and \textit{W. R. Tout}, and Partial-match retrieval for dynamic files using linear hashing with partial expansions by \textit{K. Ramamohanarao}, \textit{J. Shepherd}, and \textit{R. Sacks-Davis}. The sixth chapter contains `Short presentations' --- an analytical model of a deferred and incremental update strategy for secondary indexes by \textit{E. Omiecinski}, \textit{W. Liu} and \textit{I. Akyildiz}, A compact multiway merge sorter using VLSI linear-array comparators by \textit{T. Satoh}, \textit{H. Takeda} and \textit{N. Tsuda}, Using logarithmic code- expansion to speedup index access and maintenance by \textit{M. L. Kersten}, Concurrency in multidimensional linear hashing by \textit{M. Ouksel} and \textit{J. Abdul-Ghaffar}, Retrieving of parts with geometric similarity by \textit{R. Scheider}, \textit{H.-P. Kriegel}, \textit{B. Seeger} and \textit{S. Heep}, Search for multi-component objects in large spatial databases by \textit{S. Menon} and \textit{T. R. Smith}, Optimization at a high level of abstraction by \textit{I. Richard} and \textit{E. Milgron}, and A spatial database shell for relational database management systems by \textit{D. J. Abel}. The next chapter `Data organizations for logic programming' contains Une introduction à Prolog III by \textit{A. Colmerauer} (invited talk, in French), Prolog programs and standard data bases by \textit{A. Caloini}, \textit{S. Mainetti} and \textit{P. Paolini}, and A distributed locking algorithm for a transaction system in flat concurrent prolog by \textit{E. Reches}, \textit{E. Gudes} and \textit{E. Shapiro}. The articles: Advances in the design of the BANG file by \textit{M. W. Freeston}, Manipulating three- dimensional triangulations by \textit{E. Bruzzone}, \textit{L. de Floriani} and \textit{E. Puppo}, and The arc tree: and approximation scheme to represent arbitrary curved shapes by \textit{O. Günther} and \textit{E. Wong} form the eighth chapter called Multidimensional data. `Engineering the object oriented DBMSs' is the title of the next chapter with the articles: Behavior analysis of object-oriented databases: method structure, execution trees and reachability by \textit{R. Hull}. \textit{K. Tanaka}, and \textit{M. Yoshikawa}, Engineering the object-relation database model in \(O\)-raid by \textit{P. Dewan}, \textit{A. Vikram} and \textit{B. Bhargawa}, and ROOST: A relational object oriented system by \textit{N. Roussopoulos} and \textit{H. S. Kim}. The tenth chapter is devoted to ` Interfaces and formal models', and consists of the papers; Complex-statistical-table structure and operators for macro statistical databases by \textit{L. Lakhal}, \textit{R. Cicchetti} and \textit{S. Miranda}, A domain theoretic approach to incomplete information in nested relational databases by \textit{M. Levene} and \textit{G. Loizou}, and A formal definition of binary topological relationships by \textit{M. J. Egenhofer}. The next chapter `New applications' contains only one article --- Applying neural computing to expert system design: coping with complex sensory data and attribute selection by \textit{H. Tirri}. The proceedings end with the chapter on Data sharing with the papers: A concurrency control algorithm for memory-resident database systems by \textit{T. J. Lehman} and \textit{M. J. Carey}, Timestamping ordering concurrency control mechanisms for transactions of various length by \textit{X. Zhong} and \textit{Y. Kambayashi}, and Shared VS separated inverted files by \textit{E. Grazzini} and \textit{F. Pippolini}.