Just-in-Time Index Compilation
Just-in-Time Index Compilation
复制标题
DOI：
--
复制
发表时间：
2019-01
期刊：
影响因子：
--
通讯作者：
D. Balakrishnan;Lukasz Ziarek;Oliver Kennedy
中科院分区：
文献类型：
--
作者：
D. Balakrishnan;Lukasz Ziarek;Oliver Kennedy
创建或修改主索引是一个耗时的过程，因为索引通常需要从头开始重建。在本文中，我们探索了一种更优雅的“即时”索引重组方法，其中小的更改在后台动态应用。为了实现这种类型的重组，我们形式化了一种可组合的组织语法，它不仅能够捕获现有索引结构的实例，而且还能捕获任意混合结构的实例。我们介绍了这种结构的重写规则代数，以及用于定义和优化实时重写策略的框架。我们的实验分析表明，生成的索引结构足够灵活，可以适应各种性能目标，同时与c++标准模板库映射等现有结构保持竞争力。
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.