ICDT '90: Third International Conference on Database Theory, Paris, France, December 12-14, 1990, Proceedings: Lecture Notes in Computer Science, cartea 470
Editat de Serge Abiteboul, Paris C. Kanellakisen Limba Engleză Paperback – 3 dec 1990
Din seria Lecture Notes in Computer Science
- 20%
Preț: 323.37 lei - 20%
Preț: 461.65 lei - 20%
Preț: 461.32 lei - 20%
Preț: 390.69 lei - 20%
Preț: 527.36 lei - 15%
Preț: 388.50 lei - 20%
Preț: 461.52 lei - 20%
Preț: 390.35 lei - 20%
Preț: 496.64 lei - 20%
Preț: 461.52 lei - 20%
Preț: 389.72 lei - 15%
Preț: 461.85 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 252.15 lei - 20%
Preț: 391.14 lei - 20%
Preț: 532.54 lei - 20%
Preț: 461.83 lei - 20%
Preț: 255.91 lei - 20%
Preț: 498.46 lei - 20%
Preț: 497.55 lei - 20%
Preț: 499.36 lei - 20%
Preț: 390.12 lei - 20%
Preț: 391.20 lei - 20%
Preț: 532.41 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 390.94 lei - 20%
Preț: 391.86 lei - 20%
Preț: 389.85 lei - 20%
Preț: 498.32 lei - 20%
Preț: 462.67 lei - 20%
Preț: 460.98 lei - 20%
Preț: 424.26 lei - 20%
Preț: 639.72 lei - 15%
Preț: 535.92 lei - 20%
Preț: 532.28 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 461.57 lei - 20%
Preț: 498.50 lei - 20%
Preț: 461.83 lei - 20%
Preț: 249.95 lei
Preț: 331.30 lei
Preț vechi: 414.13 lei
-20% Nou
Puncte Express: 497
Preț estimativ în valută:
58.63€ • 68.74$ • 51.48£
58.63€ • 68.74$ • 51.48£
Carte tipărită la comandă
Livrare economică 04-18 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540535072
ISBN-10: 3540535071
Pagini: 540
Ilustrații: VII, 530 p.
Dimensiuni: 170 x 250 x 28 mm
Greutate: 0.75 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540535071
Pagini: 540
Ilustrații: VII, 530 p.
Dimensiuni: 170 x 250 x 28 mm
Greutate: 0.75 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
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.