Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools

08/02/2018
by   Timo Bingmann, et al.
0

This dissertation focuses on two fundamental sorting problems: string sorting and suffix sorting. The first part considers parallel string sorting on shared-memory multi-core machines, the second part external memory suffix sorting using the induced sorting principle, and the third part distributed external memory suffix sorting with a new distributed algorithmic big data framework named Thrill.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/23/2020

Communication-Efficient String Sorting

There has been surprisingly little work on algorithms for sorting string...
research
05/11/2018

An O(N) Sorting Algorithm: Machine Learning Sorting

We propose an O(N) sorting algorithm based on Machine Learning method, w...
research
05/08/2023

Parallel External Sorting of ASCII Records Using Learned Models

External sorting is at the core of many operations in large-scale databa...
research
12/17/2020

Sorting in Memristive Memory

Sorting is needed in many application domains. The data is read from mem...
research
09/17/2019

Leyenda: An Adaptive, Hybrid Sorting Algorithm for Large Scale Data with Limited Memory

Sorting is the one of the fundamental tasks of modern data management sy...
research
07/26/2022

Implementing the Comparison-Based External Sort

In the age of big data, sorting is an indispensable operation for DBMSes...
research
03/25/2021

Accelerating Big-Data Sorting Through Programmable Switches

Sorting is a fundamental and well studied problem that has been studied ...

Please sign up or login with your details

Forgot password? Click here to reset