Indexes can improve query-processing performance by avoiding full table scans. Although
traditional indexes (eg, B+-tree) have been widely used, learned indexes are proposed to …

Recently, numerous promising results have shown that updatable learned indexes can
perform better than traditional indexes with much lower memory space consumption. But it is …

Non-Volatile Memory (NVM) has emerged as an alternative to next-generation main
memories. Although many tree indices have been proposed for NVM, they generally use B+ …

Although many updatable learned indexes have been proposed in recent years, whether
they can outperform traditional approaches on disk remains unknown. In this study, we …

As modern applications generate data at an unprecedented speed and often require the
querying/analysis of data spanning a large duration, it is crucial to develop indexing …

Targeting in-memory one-dimensional search keys, we propose a novel DIstribution-driven
Learned Index tree (DILI), where a concise and computation-efficient linear regression …

The growth in data storage capacity and the increasing demands for high performance have
created several challenges for concurrent indexing structures. One promising solution is the …

Blockchain systems suffer from high storage costs as every node needs to store and
maintain the entire blockchain data. After investigating Ethereum's storage, we find that the …

Learned indexes have been demonstrated to outperform traditional ones in memory-
resident scenarios. However, recent studies show that they fail to outperform B+ tree when …

Streaming graph has been broadly employed across various application domains. It
involves updating edges to the graph and then performing analytics on the updated graph …