A Highly Scalable Index Structure for Multicore In-Memory Database Systems

Hitoshi Mitake, Hiroshi Yamada, Tatsuo Nakajima*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we present some insights from the analysis of the drawbacks of the advanced concurrency control techniques. Based on the analysis, we reveal that a commonly used technique for index structures, read-copy update (RCU), has the most significant impact on the throughput and latency of in-memory database systems. For overcoming the drawbacks, we developed Glasstree, a new index structure that produces a smaller load on the memory allocator by enhancing Masstree. Glasstree achieved high throughput and stable latency than Masstree under various workloads.

Original languageEnglish
Title of host publicationIntelligent Distributed Computing XIII, IDC 2019
EditorsIgor Kotenko, Vasily Desnitsky, Costin Badica, Didier El Baz, Mirjana Ivanovic
PublisherSpringer
Pages210-217
Number of pages8
ISBN (Print)9783030322571
DOIs
Publication statusPublished - 2020
Event13th International Symposium on Intelligent Distributed Computing, IDC 2019 - St. Petersburg, Russian Federation
Duration: 2019 Oct 72019 Oct 9

Publication series

NameStudies in Computational Intelligence
Volume868
ISSN (Print)1860-949X
ISSN (Electronic)1860-9503

Conference

Conference13th International Symposium on Intelligent Distributed Computing, IDC 2019
Country/TerritoryRussian Federation
CitySt. Petersburg
Period19/10/719/10/9

Keywords

  • Epoch-based reclamation
  • In-memory database
  • Index tree structure
  • Multicore scalability

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'A Highly Scalable Index Structure for Multicore In-Memory Database Systems'. Together they form a unique fingerprint.

Cite this