Database Theory - ICDT '92
Editat de Joachim Biskup, Richard Hullen Limba Engleză Paperback – 5 oct 1992
Preț: 330.58 lei
Preț vechi: 413.22 lei
-20%
Puncte Express: 496
Preț estimativ în valută:
58.46€ • 67.03$ • 50.52£
58.46€ • 67.03$ • 50.52£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540560395
ISBN-10: 3540560394
Pagini: 464
Ilustrații: X, 454 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.7 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540560394
Pagini: 464
Ilustrații: X, 454 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.7 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Combinatorial and algebraic results for database relations.- Semantics of disjunctive deductive databases.- Database theory in Russia (1979–1991) (an overview).- On the composition and decomposition of attributes and tuples.- Approximate dependency inference from relations.- Views and decompositions of databases from a categorical perspective.- Computing with infinitary logic.- Query languages with counters.- Naturally embedded query languages.- Optimizing incremental computation of datalog programs with non-deterministic semantics.- Optimizing active databases using the split technique (Preliminary Report).- Updating atomic information in labelled database systems (extended abstract).- Context-specific synchronization for atomic data types.- Hybrid atomicity for nested transactions.- Model and verification of a data manager based on ARIES.- Minimizing indefinite information in disjunctive deductive databases.- Well founded semantics and stable semantics of semi-strict programs.- On finding extensions of default theories.- Incremental evaluation of Datalog queries.- Decidability and undecidability of equivalence for linear Datalog, with applications to normal-form optimizations.- A paradox in database theory.- A hierarchy of faithful set creation in pure OODB's.- Identification, genericity and consistency in object-oriented databases.- Subsumption for complex object data models.- Semantic information connected with data.- Declarative foundations of secure deductive databases.- On materializing views and on-line queries.- Maintaining dictionaries: Space-saving modifications of B-trees.- Set-term matching in logic programming.