Most existing parametric query optimization (PQO) techniques rely on traditional query
optimizer cost models, which are often inaccurate and result in suboptimal query …

The primordial function of a database system is to efficiently compute correct answers to
user queries. Therefore, robust query processing (RQP), where strong numerical guarantees …

The Log-Structured Merge-Tree (LSM-tree) has been widely adopted for use in modern
NoSQL systems for its superior write performance. Despite the popularity of LSM-trees, they …

A fundamental problem in database systems is choosing the best physical design, ie, a
small set of auxiliary structures that enable the fastest execution of future queries. Almost all …

Selectivity estimates for optimizing OLAP queries often differ significantly from those actually
encountered during query execution, leading to poor plan choices and inflated response …

While much of the research on transaction processing has focused on improving overall
performance in terms of throughput and mean latency, surprisingly less attention has been …

The performance of a query crucially depends on the ability of the query optimizer to choose
a good execution plan from a large space of alternatives. With the discovery of algebraic …

Parametric query optimization (PQO) must address two problems: identify a relatively small
number of plans to cache for a parameterized query (populateCache), and efficiently select …

Deco is a comprehensive system for answering declarative queries posed over stored
relational data together with data obtained on-demand from the crowd. In this paper we …

While selecting the execution plan for a given query based on a single estimated cost is a
generally-adopted strategy, it is usually error-prone and fails to comprehensively profile the …