Durable write cache in flash memory SSD for relational and NoSQL databases
It is the first time that a flash memory SSD with durable cache has been used to achieve an order of magnitude improvement in transaction throughput without compromising the atomicity and durability.
OLTP
ERIS live: a NUMA-aware in-memory storage engine for tera-scale multiprocessor systems
demo
a DBMS has to allow flexible data partitioning and data placement at runtime.
In this demonstration, we present ERIS, our NUMA-aware in-memory storage engine. ERIS uses an adaptive partitioning approach that exploits the topology of the underlying NUMA platform and significantly reduces NUMA-related issues.
Morsel-driven parallelism: a NUMA-aware query evaluation framework for the many-core age
we present the morsel-driven query execution framework, where scheduling becomes a fine-grained run-time task that is NUMA-aware. Morsel-driven query processing takes small fragments of input data (morsels) and schedules these to worker threads that run entire operator pipelines until the next pipeline breaker. The degree of parallelism is not baked into the plan but can elastically change during query execution, so the dispatcher can react to execution speed of different morsels but also adjust resources dynamically in response to newly arriving queries in the workload
Patience is a virtue: revisiting merge and sort on modern processors
The vast quantities of log-based data appearing in data centers has generated an interest in sorting almost-sorted datasets. We revisit the problem of sorting and merging data in main memory, and show that a long-forgotten technique called Patience Sort can, with some key modifications, be made competitive with today's best comparison-based sorting techniques for both random and almost sorted data.
A comprehensive study of main-memory partitioning and its application to large-scale comparison- and radix-sort
This paper considers a comprehensive collection of variants of main-memory partitioning tuned for various layers of the memory hierarchy
Palette: enabling scalable analytics for big-memory, multicore machines
demo
An operator may have multiple implementations, each of which uses a different data representation. Palette uses a cost-based approach to automatically select the fastest one on a given dataset.
Query shredding: efficient relational evaluation of queries over nested multisets
不是column store， nested query on relational db，Microsoft LINQ
Nested relational查询
Nested relational query languages have been explored extensively, and underlie industrial language-integrated query systems such as Microsoft's LINQ. However, relational databases do not natively support nested collections in query results. This can lead to major performance problems: if programmers write queries that yield nested results, then such systems typically either fail or generate a large number of queries. We present a new approach to query shredding, which converts a query returning nested data to a fixed number of SQL queries.
Plan bouquets: query processing without selectivity estimation
也不是column的，但是可不可以扩展到comlum上做？
a small "bouquet" of plans is identified from the set of optimal plans in the query's selectivity error space, such that at least one among this subset is near-optimal at each location in the space.
An application-specific instruction set for accelerating set-oriented database primitives
读不到内容，但是我觉得思想蛮新的
in this paper, we show that the development of a database processor is much more feasible nowadays through the availability of customizable processors. We illustrate exemplarily how to create an instruction set extension for set-oriented database primitives. The resulting application-specific processor provides not only a high performance but it also enables very energy-efficient processing
A formal approach to finding explanations for database queries
只是觉得解决的问题比较新，我以前没见过
In this paper we introduce a principled approach to provide explanations for answers to SQL queries based on intervention: removal of tuples from the database that significantly affect the query answers. We provide a formal definition of intervention in the presence of multiple relations which can interact with each other through foreign keys. First we give a set of recursive rules to compute the intervention for any given explanation in polynomial time (data complexity). Then we give simple and efficient algorithms based on SQL queries that can compute the top-K explanations by using standard database management systems under certain conditions. We evaluate the quality and performance of our approach by experiments on real datasets.
Opportunistic physical design for big data analytics
materialized VIEW
When jobs correspond to exploratory queries submitted by data analysts, these materializations yield a large set of materialized views that we propose to treat as an opportunistic physical design. We present a semantic model for UDFs that enables effective reuse of views containing UDFs along with a rewrite algorithm that provably finds the minimum-cost rewrite under certain assumptions.
Complete yet practical search for minimal query reformulations under constraints
Query rewrite, 提及view
We revisit the Chase&Backchase (C&B) algorithm for query reformulation under constraints, which provides a uniform solution to such particular-case problems as view-based rewriting under constraints, semantic query optimization, and physical access path selection in query optimization.
single node in-memory
---------------下面这些从abs看感觉不是in memory的，但是有些idea不错，能不能扩到你的问题上