DB - Balancing Vectorized Query Execution with Bandwidth-Optimized Storage.pdf I had two supervisors at CWI. Martin Kersten always kept an eye on what this new student from Poland was doing, and teased me with hard problems and tricky questions when appropriate. Still, it was Peter Boncz who had to live with all my questions, ideas, problems and complaints almost every day. The discussions we had were one of the most thought-stimulating moments of my life, even when we disagreed on ...

This doc describes a new extensible query optimization framework that resolves many of the shortcomings of the EXODUS and Volcano optimizer generators. In addition to extensibility, dynamic programming, and memorization based on and extended from the EXODUS and Volcano prototypes, this new optimizer provides (i) manipulation of operator arguments using rules or functions, (ii) operators that are both logical and physical for predicates etc., (iii) schema-specific rules for materialized views,

DB - The Volcano Optimizer Generator - Extensibility and Efficient Search.pdf Emerging database application domains demand not only new functionality but also high performance. To satisfy these two requirements, the Volcano project provides efficient, extensible tools for query and request processing, particularly for object-oriented and scientific database systems. One of these tools is a new optimizer generator. Data model, logical algebra, physical algebra, and optimization rules are ...

Two highly efficient algorithms are known for optimally ordering joins while avoiding cross products: DPccp, which is based on dynamic programming, and Top-Down Partition Search, based on memoization. Both have two severe limitations: They handle only (1) simple (binary) join predicates and (2) inner joins. However, real queries may contain complex join predicates, involving more than two relations, and outer joins as well as other non-inner joins.

DB-KIT 提供了一系列由作者发布的基础和高级解决方案，用于处理监控和故障诊断问题。 基于过去十年的研究工作，DB-KIT 包括仅使用过程数据即可实现各种广泛使用的预测和诊断方法的功能。 凭借易于使用的功能和直观的演示，用户会发现它对进一步调查、比较研究以及教育目的很有用。

DB - Eris - Coordination-Free Consistent Transactions Using In-Network Concurrency Control.pdf Distributed storage systems aim to provide strong consistency and isolation guarantees on an architecture that is partitioned across multiple shards for scalability and replicated for fault tolerance. Traditionally, achieving all of these goals has required an expensive combination of atomic commitment and replication protocols – introducing extensive coordination overhead.

DB - Fast and General Distributed Transactions using RDMA and HTM.pdf Recent transaction processing systems attempt to leverage advanced hardware features like RDMA and HTM to significantly boost performance, which, however, pose several limitations like requiring priori knowledge of read/write sets of transactions and providing no availability support. In this paper, we present DrTM+R, a fast in-memory transaction processing system that retains the performance benefit from advanced hardware

Large-scale Incremental Processing Using Distributed Transactions and Notifications.pdf Updating an index of the web as documents are crawled requires continuously transforming a large repository of existing documents as new documents arrive. This task is one example of a class of data processing tasks that transform a large repository of data via small, independent mutations. These tasks lie in a gap between the capabilities of existing infrastructure.

DB - Making Snapshot Isolation Serializable.pdf Snapshot Isolation (SI) is a multiversion concurrency control algorithm, first described in Berenson et al. [1995]. SI is attractive because it provides an isolation level that avoids many of the common concurrency anomalies, and has been implemented by Oracle and Microsoft SQL Server (with certain minor variations). SI does not guarantee serializability in all cases, but the TPC-C benchmark application [TPC-C],

The common wisdom is that distributed transactions do not scale. But what if distributed transactions could be made scalable using the next generation of networks and a redesign of distributed databases? There would be no need for developers anymore to worry about co-partitioning schemes to achieve decent performance. Application development would become easier as data placement would no longer determine how scalable an application is. Hardware provisioning would be simplified as the system ...