Cantitate/Preț
Produs

Database Theory – ICDT 2007: 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4353

Editat de Thomas Schwentick, Dan Suciu
en Limba Engleză Paperback – 21 dec 2006

Din seria Lecture Notes in Computer Science

Preț: 32642 lei

Preț vechi: 40802 lei
-20%

Puncte Express: 490

Carte tipărită la comandă

Livrare economică 10-24 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 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: 9783540692690
ISBN-10: 354069269X
Pagini: 436
Ilustrații: XI, 419 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.61 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Information Systems and Applications, incl. Internet/Web, and HCI

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Lectures.- Consistent Query Answering: Five Easy Pieces.- Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis.- Beauty and the Beast: The Theory and Practice of Information Integration.- Information Integration and Peer to Peer.- Approximate Data Exchange.- Determinacy and Rewriting of Conjunctive Queries Using Views: A Progress Report.- Compact Samples for Data Dissemination.- Privacy in GLAV Information Integration.- Axiomatizations for XML.- Unlocking Keys for XML Trees.- Characterization of the Interaction of XML Functional Dependencies with DTDs.- Axiomatizing the Logical Core of XPath 2.0.- Expressive Power of Query Languages.- Query Evaluation on a Database Given by a Random Graph.- The Limits of Querying Ontologies.- Incompleteness, Inconsistency, and Uncertainty.- Complexity of Consistent Query Answering in Databases Under Cardinality-Based and Incremental Repair Semantics.- World-Set Decompositions: Expressiveness and Efficient Algorithms.- On the Expressiveness of Implicit Provenance in Query and Update Languages.- Trajectory Databases: Data Models, Uncertainty and Complete Query Languages.- XML Schemas and Typechecking.- Complexity of Typechecking XML Views of Relational Databases.- Exact XML Type Checking in Polynomial Time.- Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.- Stream Processing and Sequential Query Processing.- Database Query Processing Using Finite Cursor Machines.- Constant-Memory Validation of Streaming XML Documents Against DTDs.- Ranking.- Preferentially Annotated Regular Path Queries.- Combining Incompleteness and Ranking in Tree Queries.- XML Update and Query.- Structural Recursion on Ordered Trees and List-Based Complex Objects.- Combining Temporal Logics for QueryingXML Documents.- Commutativity Analysis in XML Update Languages.- Query Containment.- Containment of Conjunctive Queries over Databases with Null Values.- Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation.