The architecture of the Dalí main memory storage manager

Bohannon, Philip; Rastogi, Rajeev; Silberschatz, Abraham; Sudarshan, S.

doi:10.1002/bltj.2030

Cited by 15 publications

(16 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We observe a rapid increase in the problem queue size given a small increase in the dataset. For instance, the queue increases rapidly from about 6X10 4 when the dataset is 3M to an average of about 12X10 4 (double the previous size) when the dataset is increased by 1M.…”

Section: Figure 12 Operational Throughput For Different MIX Of Worklmentioning

confidence: 98%

“…They allow for both efficient random as well as sequential processing of keys and are therefore widely used in DBMS. Recent advances in main memory technology and the availability of configured systems with memory sizes of the order of hundreds of gigabytes and tens of terabytes have motivated several research in developing main memory index schemes [4,15,18,20]. The usage is such that the index of a main memory resident database or a disk-resident database is kept entirely in memory for high transaction throughput.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Concurrent Operations of O2-Tree on Shared Memory Multicore Architectures

Ohene-Kwofie

Otoo

Nimako

2014

ICST Transactions on Scalable Information Systems

View full text Add to dashboard Cite

Modern computer architectures provide high performance computing capability by having multiple CPU cores.Such systems are also typically associated with very large main-memory capacities, thereby allowing them to be used for fast processing of in-memory database applications. However, most of the concurrency control mechanism associated with the index structures of these memory resident databases do not scale well, under high transaction rates.This paper presents the O2-Tree, a fast main memory resident index, which is also highly scalable and tolerant of high transaction rates in a concurrent environment using the relaxed balancing tree algorithm. The O2-Tree is a modified Red-Black tree in which the leaf nodes are formed into blocks that hold key-value pairs, while each internal node stores a single key that results from splitting leaf nodes. Multi-threaded concurrent manipulation of the O2-Tree outperforms popular NoSQL based key-value stores considered in this paper.

show abstract

Section: Figure 12 Operational Throughput For Different MIX Of Worklmentioning

confidence: 98%

Section: Related Workmentioning

confidence: 99%

Concurrent Operations of O2-Tree on Shared Memory Multicore Architectures

Ohene-Kwofie

Otoo

Nimako

2014

ICST Transactions on Scalable Information Systems

View full text Add to dashboard Cite

show abstract

“…Dali is main memory DBMS created at AT&T Bell Laboratories [7]. REDO log and UNDO log is managed by each transaction in order to reduce performance degradation caused by contention between transactions.…”

Section: A Dalimentioning

confidence: 99%

Recovery Methods in Main Memory DBMS

Kim¹,

Kang²,

Lee³

2012

International journal of advanced smart convergence

View full text Add to dashboard Cite

Recently, to efficiently support the real-time requirements of RTLS( Real Time Location System) services, interest in the main memory DBMS is rising. In the main memory DBMS, because all data can be lost when the system failure happens, the recovery method is very important for the stability of the database. Especially, disk I/O in executing the log and the checkpoint becomes the bottleneck of letting down the total system performance. Therefore, it is urgently necessary to research about the recovery method to reduce disk I/O in the main memory DBMS. Therefore, In this paper, we analyzed existing log techniques and check point techniques and existing main memory DBMSs' recovery techniques for recovery techniques research for main memory DBMS.

show abstract

“…While no commercial query optimizer is targeted at precisely the kind of workload found in computer games, there is a substantial body of research on in-memory databases [Boncz and Kersten 1995;Bohannon et al 1997], and more recent research has focused on optimizing queries over streams of data [Carney et al 2002;Motwani et al 2003;Demers et al 2007]. When combined with traditional database query optimization techniques, this work can be directly applied to game processing.…”

Section: Advantages Of Declarative Processingmentioning

confidence: 99%

Declarative processing for computer games

White

Sowell

Gehrke

et al. 2008

Proceedings of the 2008 ACM SIGGRAPH Symposium on Video Games

View full text Add to dashboard Cite

Most game developers think of databases as nothing more than a persistence solution. However, database research is concerned with the wider problem of declarative processing. In this paper we demonstrate how declarative processing can be applied to computer games. We introduce the state-effect pattern, a design pattern that allows game developers to design parts of their game declaratively. We present SGL, a special scripting language which supports this design pattern and which can be compiled to a declarative language like SQL. We show how database techniques can process this design pattern in a way that improves performance by an order of magnitude or more. Finally, we discuss some design decisions that developers must make in order to adopt this pattern effectively.

show abstract

The architecture of the Dalí main memory storage manager

Cited by 15 publications

References 37 publications

Concurrent Operations of O2-Tree on Shared Memory Multicore Architectures

Concurrent Operations of O2-Tree on Shared Memory Multicore Architectures

Recovery Methods in Main Memory DBMS

Declarative processing for computer games

Contact Info

Product

Resources

About