Database Management Systems provides comprehensive and up-to-date coverage of the
fundamentals of database systems. Coherent explanations and practical examples have …

We study the problem of optimizing subgraph queries using the new worst-case optimal join
plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time …

Publisher Summary The history of histograms is long and rich, full of detailed information in
every step. It includes the course of histograms in different scientific fields, the successes …

Protecting rights over relational data is of ever increasing interest, especially considering
areas where sensitive, valuable content is to be outsourced. A good example is a data …

XML and other semi-structured data may have partially specified or missing schema
information, motivating the use of a structural summary which can be automatically …

This paper describes the overall design and architecture of the Timber XML database
system currently being implemented at the University of Michigan. The system is based upon …

Estimating the selectivity of a query is a key step in almost any cost-based query optimizer.
Most of today's databases rely on histograms or samples that are periodically refreshed by …

Like HTML, many XML documents are resident on native file systems. Since XML data is
irregular and verbose, the disk space and the network bandwidth are wasted. To overcome …

We study the problem of optimizing one-time and continuous subgraph queries using the
new worst-case optimal join plans. Worst-case optimal plans evaluate queries by matching …

The advent of XML as a universal exchange format, and of Web services as a basis for
distributed computing, has fostered the apparition of a new class of documents: dynamic …