Query performance prediction, the task of predicting the latency of a query, is one of the most
challenging problem in database management systems. Existing approaches rely on …

We define and design succinct indexes for several abstract data types (ADTs). The concept
is to design auxiliary data structures that ideally occupy asymptotically less space than the …

Since the boom in new proposals on techniques for efficient querying of XML data is now
over and the research world has shifted its attention toward new types of data formats, we …

This paper is an experimental and analytical study of two classes of summary-based
cardinality estimators that use statistics about input relations and small-size joins in the …

BACKGROUND Structured Query Language (SQL) is a popular computer language
employed to create, modify, retrieve and manipulate data from relational database …

As the Extensible Markup Language (XML) rapidly establishes itself as the de facto standard
for presenting, storing, and exchanging data on the Internet, large volume of XML data and …

Effective support for XML query languages is becoming increasingly important with the
emergence of new applications that access large volumes of XML data. All existing …

Estimating the join selectivity is a crucial problem in many aspects of query processing, such
as query optimization and query refinement. Selectivity estimation has been extensively …

XML has gained widespread acceptance as a premier format for publishing, sharing and
manipulating data through the web. While the semi-structured nature of XML provides a high …

This article introduces the Tuple Graph (TuG) synopses, a new class of data summaries that
enable accurate approximate answers for complex relational queries. The proposed …