pith. sign in

arxiv: 1901.07627 · v1 · pith:L5PUIOWUnew · submitted 2019-01-22 · 💻 cs.DB

Just-in-Time Index Compilation

classification 💻 cs.DB
keywords indexjust-in-timestructuresenoughexistingreorganizationadaptalgebra
0
0 comments X
read the original abstract

Creating or modifying a primary index is a time-consuming process, as the index typically needs to be rebuilt from scratch. In this paper, we explore a more graceful "just-in-time" approach to index reorganization, where small changes are dynamically applied in the background. To enable this type of reorganization, we formalize a composable organizational grammar, expressive enough to capture instances of not only existing index structures, but arbitrary hybrids as well. We introduce an algebra of rewrite rules for such structures, and a framework for defining and optimizing policies for just-in-time rewriting. Our experimental analysis shows that the resulting index structure is flexible enough to adapt to a variety of performance goals, while also remaining competitive with existing structures like the C++ standard template library map.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.