There is No Such Thing as an "Index"! or: The next 500 Indexing Papers
Jens Dittrich, Joris Nix, Christian Schön
备注:
revise intro, extend related work by "Genetic Algorithms" and "Decoupling Logical and Physical Indexes", revise experimental evaluation (remove "6.1 Benchmarking Baselines", rename and revise "6.3 Fitness vs Generation", remove "6.4 Breeding State-of-the-Art Index Structures", remove "6.5 Breeding Index Structures on Mixed Workloads", add new experiment "Optimized vs Heuristic Indexes")
Index structures are a building block of query processing and computer science in general. Since the dawn of computer technology there have been index structures. And since then, a myriad of index structures are being invented and published each and every year. In this paper we argue that the very idea of "inventing an index" is a misleading concept in the first place. It is the analogue of "inventing a physical query plan". This paper is a paradigm shift in which we propose to drop the idea to handcraft index structures (as done for binary search trees over B-trees to any form of learned index) altogether. We present a new automatic index breeding framework coined Genetic Generic Generation of Index Structures (GENE). It is based on the observation that almost all index structures are assembled along three principal dimensions: (1) structural building blocks, e.g., a B-tree is assembled from two different structural node types (inner and leaf nodes), (2) a couple of invariants, e.g., for a B-tree all paths have the same length, and (3) decisions on the internal layout of nodes (row or column layout, etc.). We propose a generic indexing framework that can mimic many existing index structures along those dimensions. Based on that framework we propose a generic genetic index generation algorithm that, given a workload and an optimization goal, can automatically assemble and mutate, in other words 'breed' new index structure 'species'. In our experiments we follow multiple goals. We reexamine some good old wisdom from database technology. Given a specific workload, will GENE even breed an index that is equivalent to what our textbooks and papers currently recommend for such a workload? Or can we do even more? Our initial results strongly indicate that generated indexes are the next step in designing index structures.
Indexing Data on the Web: A Comparison of Schema-level Indices for Data Search -- Extended Technical Report
为数据网编制索引提供了许多机会,特别是查找和探索数据源的机会。索引Web of Data时的一个主要设计决策是找到合适的索引模型,即,如何索引和汇总数据。已经进行了各种努力来为给定任务开发具体的指数模型。由于每个索引模型都是独立设计、实现和评估的,因此仍然很难判断一种方法是否可以很好地推广到另一个任务、查询集或数据集。在这项工作中,我们经验性地评估六个具有代表性的指数模型与独特的功能组合。其中包括一个新的索引模型,它结合了RDFS和owl:sameAs的推理。我们首次将所有索引模型实现为一个基于流的框架。我们评估的索引模型的变化,考虑子图的大小为0,1,和2跳两个大的,现实世界的数据集。我们评估的压缩比,摘要比,和F1分数表示的近似质量的基于流的索引计算的指数的质量。实验揭示了不同索引模型、查询和数据集的压缩比、摘要比和近似质量的巨大差异。然而,我们在结果中观察到有意义的相关性,这些相关性有助于为给定的任务、查询类型和数据集确定正确的索引模型。