New Added

Database theory–ICDT 2001 : 8th international conference, London, UK, January 4-6, 2001 : proceedings

Like Score+606

Database theory–ICDT 2001 : 8th international conference, London, UK, January 4-6, 2001 : proceedings
Original Title Database theory–ICDT 2001 : 8th international conference, London, UK, January 4-6, 2001 : proceedings
Author International Conference on Database Theory (8th : 2001 : London, England), Bussche, Jan van den, Vianu, Victor
Publication date

Topics Database management
Publisher Berlin , New York : Springer
Collection folkscanomy_miscellaneous, folkscanomy, additional_collections
Language English
Book Type EBook
Material Type Book
File Type PDF
Downloadable Yes
Support Mobile, Desktop, Tablet
Scan Quality: Best No watermark
PDF Quality: Good
Availability Yes
Price 0.00
Submitted By
Sketch the Cow
Submit Date December 30, 2015
Database Theory — ICDT 2001: 8th International Conference London, UK, January 4–6, 2001 Proceedings
Author: Jan Van den Bussche, Victor Vianu
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-41456-8
DOI: 10.1007/3-540-44503-X

Table of Contents:

  • Expressive Power of SQL
  • Query Evaluation via Tree-Decompositions
  • Scalar Aggregation in FD-Inconsistent Databases
  • On Decidability and Complexity of Description Logics with Uniqueness Constraints
  • Expressiveness Issues and Decision Problems for Active Database Event Queries
  • A Theory of Transactions on Recoverable Search Trees
  • Minimizing View Sets without Losing Query-Answering Power
  • Cost Based Data Dissemination in Broadcast Networks
  • Parallelizing the Data Cube
  • Asymptotically Optimal Declustering Schemes for Range Queries
  • Flexible Data Cubes for Online Aggregation
  • Mining for Empty Rectangles in Large Data Sets
  • FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies
  • Axiomatization of Frequent Sets
  • On Answering Queries in the Presence of Limited Access Patterns
  • The Dynamic Complexity of Transitive Closure Is in DynTC°
  • Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls
  • A Semi-monad for Semi-structured Data (ICDT Version)
  • Algebraic Rewritings for Optimizing Regular Path Queries
  • Why and Where: A Characterization of Data Provenance

Includes bibliographical references and index

We will be happy to hear your thoughts

Leave a reply

eBookmela
Logo
Register New Account
Reset Password
Compare items
  • Total (0)
Compare
0