C-store: a column-oriented DBMS
M Stonebraker, DJ Abadi, A Batkin, X Chen… - … Databases Work: the …, 2018 - dl.acm.org
This paper presents the design of a read-optimized relational DBMS that contrasts sharply
with most current systems, which are write-optimized. Among the many differences in its …
with most current systems, which are write-optimized. Among the many differences in its …
The end of an architectural era: It's time for a complete rewrite
In previous papers [SC05, SBC+ 07], some of us predicted the end of" one size fits all" as a
commercial relational DBMS paradigm. These papers presented reasons and experimental …
commercial relational DBMS paradigm. These papers presented reasons and experimental …
" One size fits all" an idea whose time has come and gone
M Stonebraker, U Çetintemel - … databases work: the pragmatic wisdom of …, 2018 - dl.acm.org
The last 25 years of commercial DBMS development can be summed up in a single phrase:"
One size fits all". This phrase refers to the fact that the traditional DBMS architecture …
One size fits all". This phrase refers to the fact that the traditional DBMS architecture …
OLTP through the looking glass, and what we found there
Online Transaction Processing (OLTP) databases include a suite of features---disk-resident
B-trees and heap files, locking-based concurrency control, support for multi-threading---that …
B-trees and heap files, locking-based concurrency control, support for multi-threading---that …
The design and implementation of INGRES
M Stonebraker, E Wong, P Kreps, G Held - Making Databases Work: the …, 2018 - dl.acm.org
The currently operational (March 1976) version of the INGRES database management
system is described. This multiuser system gives a relational view of data, supports two high …
system is described. This multiuser system gives a relational view of data, supports two high …
Orthogonal range searching on the RAM, revisited
We present a number of new results on one of the most extensively studied topics in
computational geometry, orthogonal range searching. All our results are in the standard …
computational geometry, orthogonal range searching. All our results are in the standard …
[LIBRO][B] Algorithms for memory hierarchies: advanced lectures
Algorithms that have to process large data sets have to take into account that the cost of
memory access depends on where the data is stored. Traditional algorithm design is based …
memory access depends on where the data is stored. Traditional algorithm design is based …
Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
Key-value data structures constitute the core of any datadriven system. They provide the
means to store, search, and modify data residing at various levels of the storage and …
means to store, search, and modify data residing at various levels of the storage and …
Independent range sampling
This paper studies the independent range sampling problem. The input is a set P of n points
in R. Given an interval q=[x, y] and an integer t≥ 1, a query returns t elements uniformly …
in R. Given an interval q=[x, y] and an integer t≥ 1, a query returns t elements uniformly …
The next 50 years in database indexing or: the case for automatically generated index structures
Index structures are a building block of query processing and computer science in general.
Since the dawn of computer technology there have been index structures. And since then, a …
Since the dawn of computer technology there have been index structures. And since then, a …