Hyperion: Building the largest in-memory search tree

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 t...

Full description

Bibliographic Details

Main Authors:	Markus Masker, Tim Suss, Lars Nagel, Lingfang Zeng, Andre Brinkmann
Format:	Default Conference proceeding
Published:	2019
Subjects:	Other information and computing sciences not elsewhere classified Hyperion Data Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/37448
Tags:	Add Tag No Tags, Be the first to tag this record!