ICDT '90
Editat de Serge Abiteboul, Paris C. Kanellakisen Limba Engleză Paperback – 3 dec 1990
Preț: 334.47 lei
Preț vechi: 418.08 lei
-20%
Puncte Express: 502
Carte tipărită la comandă
Livrare economică 16-30 iulie
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: 9783540535072
ISBN-10: 3540535071
Pagini: 540
Ilustrații: VII, 530 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.81 kg
Ediția:1990
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540535071
Pagini: 540
Ilustrații: VII, 530 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.81 kg
Ediția:1990
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Finite-model theory—a personal perspective.- Playing games with objects.- Representing object identity in a pure functional language.- A class abstraction for a hierarchical type system.- Algebraic optimization of object-oriented query languages.- A relational object model.- Maintaining bounded disorder files in multiprocessor multi-disk environments.- An evaluation model for clustering strategies in the O2 object-oriented database system.- Efficient algorithms for managing the history of evolving databases.- Logic and Databases: An assessment.- A closed form for datalog queries with integer order.- On the expressive power of the relational calculus with arithmetic constraints.- Conjectures and refutations in database design and dependency theory.- A theory of specialization constraints for complex objects.- Removing redundancy and updating databases.- Improving the concurrency of integrity checks and write operations.- A flexible and adaptable tool kit approach for concurrency control in non standard database systems.- A comparative analysis of two-phase-commit protocols.- Efficient voting protocols with witnesses.- Voting and relocation strategies preserving consistency among replicated files.- Well!: An evaluation procedure for all logic programs.- Beginnings of a theory of general database completions.- Recursively indefinite databases.- Low complexity aggregation in graphlog and Datalog.- Deciding boundedness for uniformly connected Datalog programs.- The Revised Gärdenfors postulates and update semantics.- Foundations of canonical update support for closed database views.- Drawing updates from derivations.- Optimization of a subclass of conjunctive queries.- Complex transitive closure queries on a fragmented graph.- Multiple SIP strategies and bottom-upadorning in logic query optimization.- On estimating the size of projections.- Static estimation of query sizes in horn programs.