ICDT'86 (häftad)
Fler böcker inom
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
448
Utgivningsdatum
1986-12-01
Upplaga
1986 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Ausiello, Giorgio (ed.), Atzeni, Paolo (ed.)
Illustrationer
VIII, 448 p.
Dimensioner
234 x 156 x 23 mm
Vikt
636 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9783540171874

ICDT'86

International Conference on Database Theory. Rome, Italy, September 8-10, 1986. Proceedings

av Giorgio Ausiello, Paolo Atzeni
Häftad,  Engelska, 1986-12-01
760
Köp
Spara som favorit
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
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.
Visa hela texten

Passar bra ihop

  1. ICDT'86
  2. +
  3. The Anxious Generation

De som köpt den här boken har ofta också köpt The Anxious Generation av Jonathan Haidt (inbunden).

Köp båda 2 för 1049 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

Giorgio Ausiello, Paolo Atzeni

Innehållsförteckning

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.

Du kanske gillar