Motivation: The application of next-generation sequencing (NGS) technologies to RNAs
directly extracted from a community of organisms yields a mixture of fragments …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Column-oriented database systems [19, 23] perform better than traditional row-oriented
database systems on analytical workloads such as those found in decision support and …

We design a high-performance parallel merge sort for highly parallel systems. Our merge
sort is designed to use more register communication (not shared memory), and does not …

Tries are the fastest tree-based data structures for managing strings in-memory, but are
space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-chains …

Methods and systems are described that involve usage of dictionaries for compressing a
large set of variable-length string values with fixed-length integer keys in column stores. The …

With the increasing amount of data, there is an urgent need for efficient sorting algorithms to
process large data sets. Hardware sorting algorithms have attracted much attention because …

We discuss how string sorting algorithms can be parallelized on modern multi-core shared
memory machines. As a synthesis of the best sequential string sorting algorithms and …

We describe new implementations of MSD radix sort for efficiently sorting large collections of
strings. Our implementations are significantly faster than previous MSD radix sort …

Storing and retrieving strings in main memory is a fundamental problem in computer
science. The efficiency of string data structures used for this task is of paramount importance …