We present the first learned index that supports predecessor, range queries and updates
within provably efficient time and space bounds in the worst case. In the (static) context of …

This is the newly revised and expanded edition of the popular introduction to the design and
implementation of geometry algorithms arising in areas such as computer graphics, robotics …

Computational geometry as an area of research in its own right emerged in the early
seventies of this century. Right from the beginning, it was obvious that strong connections of …

Shamos [1] recently showed that the diameter of a convex n-sided polygon could be
computed in O (n) time using a very elegant and simple procedure which resembles rotating …

A finite set of lines partitions the Euclidean plane into a cell complex. Similarly, a finite set of
(d-1)-dimensional hyperplanes partitions d-dimensional Euclidean space. An algorithm is …

Index structures in memory systems become important to improve the entire system
performance. The promising learned indexes leverage deep-learning models 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 …

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 …

We address the problem of designing, implementing, and experimenting with compressed
data structures that support rank and select queries over a dictionary of integers. We shine a …