Vor Ort
Merkzettel Warenkorb
  • Produktbild: Foundations of Data Organization and Algorithms
  • Produktbild: Foundations of Data Organization and Algorithms
Band 367

Foundations of Data Organization and Algorithms Third International Conference, FODO 1989, Paris, France, June 21-23, 1989. Proceedings

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

07.06.1989

Herausgeber

Witold Litwin + weitere

Verlag

Springer Berlin

Seitenzahl

533

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

964 g

Auflage

1989

Sprache

Englisch

ISBN

978-3-540-51295-0

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

07.06.1989

Herausgeber

Verlag

Springer Berlin

Seitenzahl

533

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

964 g

Auflage

1989

Sprache

Englisch

ISBN

978-3-540-51295-0

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Foundations of Data Organization and Algorithms
  • Produktbild: Foundations of Data Organization and Algorithms
  • 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.