MFDBS 91
Editat de Bernhard Thalheim, Janos Demetrovics, Hans-Detlef Gerhardten Limba Engleză Paperback – 24 apr 1991
Preț: 327.69 lei
Preț vechi: 409.62 lei
-20%
Puncte Express: 492
Carte tipărită la comandă
Livrare economică 07-21 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540540090
ISBN-10: 3540540091
Pagini: 408
Ilustrații: VIII, 395 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540540091
Pagini: 408
Ilustrații: VIII, 395 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Complex object multi-level fixpoint queries.- Classifying object-oriented query results in a class/type lattice.- A relational algebra for complex objects based on partial information.- Specifying operations for nested relations by rules and partial orders.- On the relationship between well-founded and stable partial models.- Monadic databases with equality.- Actor-oriented specification of deontic integrity constraints.- Solving ambiguities in updating deductive databases.- On the mean execution time of recursive definitions on relational databases.- Updating hierarchical databases by complex forms.- A direct algorithm for computing the transitive closure of a two-dimensionally structured file.- Multi-granularity locking for nested transaction systems.- The Nested Interpolation Based Grid File.- Complexity of recursive production rules execution.- On the monotonicity of (LDL) logic programs with set.- Semantic improvement of deductive databases.- On the representation of dependencies by propositional logic.- Pairwise-definable subdirect decompositions of general database schemata.- Functional dependencies in hierarchical structures of data.- Objects in relational database schemes with functional, inclusion and exclusion dependencies.- Abstract data type semantics for many-sorted object query algebras.- Temporal specifications of object behavior.- Consistency and non-determinism in a database programming language.- A fact-oriented approach to schema transformation.- A database needs two kinds of negation.- Rationale of the O2 system.- The background of the DASDBS & COSMOS projects.- The rationale behind DBPL.