Recent research has shown that learned models can outperform state-of-the-art index
structures in size and lookup performance. While this is a very promising result, existing …

While index structures are crucial components in high-performance query processing
systems, they occupy a large fraction of the available memory. Recently-proposed compact …

In this work we present an optimized version of the Adaptive Radix Tree (ART) index
structure for GPUs. We analyze an existing GPU implementation of ART (GRT), identify …

Index structures often materialize one or multiple levels of explicit indirections (aka pointers)
to allow for a quick traversal to the data of interest. Unfortunately, dereferencing a pointer to …

This three-volume set CCIS 2213-2215 constitutes the refereed proceedings of the 10th
International Conference of Pioneering Computer Scientists, Engineers and Educators …

Efficient data processing is one of the core techniques that enables modern data driven
computer systems. Database systems are uniquely positioned to use increasing hardware …

Abstract Adaptive Radix Tree (ART) is an efficient data structure for key-based lookup and
insertion operations. It finds extensive applications in various domains, including database …

Recent works on learned indexes have changed the way we look at the decades-old field of
Database Management System indexing. However, they are limited to too many …

As the chairs of the 10th International Conference of Pioneering Computer Scientists,
Engineers and Educators 2024 (ICPCSEE 2024, originally ICYCSEE), it is our great …

Lookup of strings into in-memory database indexes is a problem with different
considerations from those using integer keys. With their variable sizes, efficiently inserting …