ICDT'86
Springer Berlin (Verlag)
978-3-540-17187-4 (ISBN)
Giorgio Ausiello is Professor Emeritus in the Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Università di Roma "La Sapienza". He has coauthored numerous formal academic journal and conference publications. He has chaired many related conferences and research groups, and he was a founding member of the European Association for Theoretical Computer Science (EATCS), and its President from 2006 to 2009. His main research interests include on-line algorithms, approximation algorithms, dynamic graph algorithms, optimization problems in vehicle routing and logistics, and streaming algorithms; he has also researched and published on programming theorys, computational complexity, and database theory.
Logic programming and parallel complexity.- The generalized counting method for recursive logic queries.- Restructuring of complex objects and office forms.- Set containment inference.- A domain theoretic approach to higher-order relations.- On the desirability of ?-acyclic BCNF database schemes.- Update semantics under the domain closure assumption.- Unsolvable problems related to the view integration approach.- Horizontal decompositions based on functional-dependency-setimplications.- Update serializability in locking.- Filtering data flow in deductive databases.- Multidimensional order preserving linear hashing with partial expansions.- Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers.- Towards online schedulers based on Pre-Analysis Locking.- Query processing in incomplete logical databases.- to the theory of nested transactions.- Entity-relationship consistency for relational schemas.- Modelling large bases of categorical data with acyclic schemes.- Some extensions to the closed world assumption in databases.- Expedient stochastic move-to-front and optimal stochastic move-to-rear list organizing strategies.- The cost of locking.- Theoretical foundation of algebraic optimization utilizing unnormalized relations.- A polynomial-time join dependency implication algorithm for unary multi-valued dependencies.- Interaction-free multivalued dependency sets.- Updating logical databases containing null values.- A new characterization of distributed deadlock in databases.
| Erscheint lt. Verlag | 1.12.1986 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | VIII, 448 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 731 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Informatik ► Theorie / Studium ► Kryptologie | |
| Schlagworte | algorithm • Algorithm analysis and problem complexity • algorithms • Complexity • Database • data structures • Datenbank • deductive database • Logic • Optimization • programming • Semantics |
| ISBN-10 | 3-540-17187-8 / 3540171878 |
| ISBN-13 | 978-3-540-17187-4 / 9783540171874 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
