Sciweavers

4 search results - page 1 / 1
» Low overhead concurrency control for partitioned main memory...
Sort
View
SIGMOD
2010
ACM
221views Database» more  SIGMOD 2010»
13 years 9 months ago
Low overhead concurrency control for partitioned main memory databases
Database partitioning is a technique for improving the performance of distributed OLTP databases, since “single partition” transactions that access data on one partition do no...
Evan P. C. Jones, Daniel J. Abadi, Samuel Madden
ADC
2000
Springer
326views Database» more  ADC 2000»
13 years 8 months ago
T-Tree or B-Tree: Main Memory Database Index Structure Revisited
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
Hongjun Lu, Yuet Yeung Ng, Zengping Tian
NCA
2006
IEEE
13 years 10 months ago
A Primary-Backup Protocol for In-Memory Database Replication
The paper presents a primary-backup protocol to manage replicated in-memory database systems (IMDBs). The protocol exploits two features of IMDBs: coarse-grain concurrency control...
Lásaro J. Camargos, Fernando Pedone, Rodrig...
SIGMOD
2008
ACM
190views Database» more  SIGMOD 2008»
14 years 4 months ago
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 ...
Stavros Harizopoulos, Daniel J. Abadi, Samuel Madd...