Document - eBookmela
Loading...

Database theory ICDT 2001 : 8th international conference, London, UK, January 4 6, 2001 : proceedings | International Conference on Database Theory (8th : 2001 : London, England), Bussche, Jan van den, Vianu, Victor

Likes0
Telegram icon Share on Telegram

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

User Rating: Be the first one!

Author: International Conference on Database Theory (8th : 2001 : London, England), Bussche, Jan van den, Vianu, Victor

Added by: sketch

Added Date: 2015-12-30

Publication Date: 2000

Language: eng

Subjects: Database management

Publishers: Berlin ; New York : Springer

Collections: folkscanomy miscellaneous, folkscanomy, additional collections

ISBN Number: 3540414568

Pages Count: 300

PPI Count: 300

PDF Count: 1

Total Size: 248.98 MB

PDF Size: 4.51 MB

Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc

Edition: [Elektronische Ressource]

Archive Url

Downloads: 715

Views: 765

Total Files: 18

Media Type: texts

Description

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
eBookmela
Logo
Register New Account