Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/37448

Title: Hyperion: Building the largest in-memory search tree
Authors: Masker, Markus
Suss, Tim
Nagel, Lars
Zeng, Lingfang
Brinkmann, Andre
Issue Date: 2019
Publisher: © ACM
Citation: MASKER, M. ... et al, 2019. Hyperion: Building the largest in-memory search tree. To be presented at the ACM SIGMOD/PODS International Conference on Management of Data, Amsterdam, The Netherlands, June 30 - July 5, 2019.
Abstract: Indexes are essential in data management systems to increase the speed of data retrievals. Widespread data structures to provide fast and memory-efficient indexes are prefix tries. Implementations like Judy, ART, or HOT optimize their internal alignments for cache and vector unit efficiency. While these measures usually improve the performance substantially, they can have a negative impact on memory efficiency. In this paper we present Hyperion, a trie-based main-memory key-value store achieving extreme space efficiency. In contrast to other data structures, Hyperion does not depend on CPU vector units, but scans the data structure linearly. Combined with a custom memory allocator, Hyperion accomplishes a remarkable data density while achieving a competitive point query and an exceptional range query performance. Hyperion can significantly reduce the index memory footprint, while being at least two times better concerning the performance to memory ratio compared to the best implemented alternative strategies for randomized string data sets.
Description: This paper is closed access until it is published.
Version: Accepted for publication
URI: https://dspace.lboro.ac.uk/2134/37448
Publisher Link: http://sigmod2019.org/
Appears in Collections:Closed Access (Computer Science)

Files associated with this item:

File Description SizeFormat
SIGMOD2019_AcceptedVersion.pdfAccepted version2.24 MBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.