Efficiency has been a pivotal aspect of the software industry since its inception, as a system
that serves the end-user fast, and the service provider cost-efficiently benefits all parties. A …

Semisort is a fundamental algorithmic primitive widely used in the design and analysis of
efficient parallel algorithms. It takes input as an array of records and a function extracting a …

Analytical database systems offer high-performance in-memory aggregation. If there are
many unique groups, temporary query intermediates may not fit RAM, requiring the use of …

Sorting and searching are large parts of database query processing, eg, in the forms of
index creation, index maintenance, and index lookup, and comparing pairs of keys is a …

In database query processing, aggregation is an operator by which data with a common
property is grouped and expressed in a summary form. Early aggregation is a popular …

An earlier survey of modern b-tree techniques is now over a decade old. Obviously, it lacks
descriptions of techniques invented and published during this time. Just as importantly, it …

Sorting is a fundamental operation in various applications and a traditional research topic in
computer science. Improving the performance of sorting operations can have a significant …

Recent work [8] shows how offset-value coding speeds up database query execution, not
only sorting but also duplicate removal and grouping (aggregation) in sorted streams, order …

Kontinuierliche Datenströme stehen im Zentrum von vielen anspruchsvollen und komplexen
Anwendungen. Neben der Online-Verarbeitung durch ein Datenstromsystem müssen …

Interesting orderings let sort-based query processing out-perform hash-based algorithms,
but only tree-of-losers priority queues and offset-value coding permit competing in all cases …