• Publications
  • Influence
The Bw-Tree: A B-tree for new hardware platforms
TLDR
The architecture and algorithms for the Bw-tree are described, focusing on the main memory aspects, which achieves its very high performance via a latch-free approach that effectively exploits the processor caches of modern multi-core chips.
Adapting microsoft SQL server for cloud computing
TLDR
Cloud SQL Server is a relational database system designed to scale-out to cloud computing workloads and currently serves as the storage engine for Microsoft's Exchange Hosted Archive and SQL Azure.
ALEX: An Updatable Adaptive Learned Index
TLDR
A new learned index called ALEX is presented which addresses practical issues that arise when implementing learned indexes for workloads that contain a mix of point lookups, short range queries, inserts, updates, and deletes and effectively combines the core insights from learned indexes with proven storage and indexing techniques to achieve high performance and low memory footprint.
Access methods for multiversion data
TLDR
An access method designed to provide a single integrated index structure for a versioned timestamped database with a non-deletion policy based on Malcolm Easton's Write Once B-tree is presented.
Deuteronomy: Transaction Support for Cloud Data
TLDR
The architecture of the Deuteronomy TC, a transactional component that manages transactions and their “logical” concurrency control and undo/redo recovery, and the considerations that led to it are described.
AlphaSort: a RISC machine sort
TLDR
A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads and proposes two new benchmarks: Minutesort: how much can you sort in a minute, and DollarSort: how to sort for a dollar.
The performance of a multiversion access method
TLDR
Using both analysis and simulation, the amount of redundancy, the space utilization, and the record addition (insert or update) performance for a spectrum of different rates of insertion versus update are characterised.
The hB-tree: a multiattribute indexing method with good guaranteed performance
TLDR
This work presents results that guarantee that the hB-tree copes well with arbitrary distributions of keys, decent storage utilization, reasonable size index terms, and good search and insert performance.
Process structuring, synchronization, and recovery using atomic actions
TLDR
It is shown how atomic actions can be used to isolate recovery action to a single process and a form of process synchronization, the await statement, is adapted to work naturally with atomic actions.
Unbundling Transaction Services in the Cloud
TLDR
Refactoring of the system architecture could allow easier deployment of application-specific physical structures and may also be helpful to exploit multi-core hardware and to enable flexible transactions in cloud database deployments.
...
1
2
3
4
5
...