Fetching the paper…
Reading the bibliography…
Index structures are one of the most important tools that DBAs leverage to improve the performance of analytics and transactional workloads.
Computational Methods for Best Spline Function Approximation
R.E Esch and W.L Eastman. 1969 · 1969
Earlier work this paper cites.
Chebyshev Approximation by Spline Functions with Free Knots
Dietrich Braess. 1971 · 1971
Earlier work this paper cites.
Segmentation of Plane Curves
T. Pavlidis and S. L. Horowitz. 1974 · 1974
Earlier work this paper cites.
Prefix B-trees
Rudolf Bayer and Karl Unterauer. 1977 · 1977
Earlier work this paper cites.
The Design of POSTGRES. In
Michael Stonebraker and Lawrence A. Rowe. 1986 · 1986
Earlier work this paper cites.
The Case for Partial Indexes
Michael Stonebraker. 1989 · 1989
Earlier work this paper cites.
The Log-structured Merge-tree (LSM-tree)
Patrick O’Neil et al · 1996
Earlier work this paper cites.
Approximate Queries and Representations for Large Data Sequences. In
Hagit Shatkay and Stanley B Zdonik. 1996 · 1996
Earlier work this paper cites.
Bitmap Index Design and Evaluation. In
Chee-Yong Chan and Yannis E. Ioannidis. 1998 · 1998
Earlier work this paper cites.
Compressing Relations and Indexes. In
Jonathan Goldstein et al · 1998
Earlier work this paper cites.
Piecewise Linear Modeling and Analysis
Domine M. W. Leenaerts and Wim M. Van Bokhoven. 1998 · 1998
Earlier work this paper cites.
Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing. In
Guido Moerkotte. 1998 · 1998
Earlier work this paper cites.
Dimensionality Reduction for Similarity Searching in Dynamic Databases. In
K. V. Ravi Kanth et al · 1998
Earlier work this paper cites.
Performance Measurements of Compressed Bitmap Indices. In
Theodore Johnson. 1999 · 1999
Earlier work this paper cites.
B-Tree Indexes and CPU Caches. In
Goetz Graefe and Per-Åke Larson. 2001 · 2001
Earlier work this paper cites.
An Online Algorithm for Segmenting Time Series. In
Eamonn Keogh et al · 2001
Earlier work this paper cites.
Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets. In
Michael E. Houle and Jun Sakuma. 2005 · 2005
Earlier work this paper cites.
Compressing Bitmap Indices by Data Reorganization. In
Ali Pinar et al · 2005
Cited alongside, same era.
B-tree Indexes, Interpolation Search, and Skew. In
Goetz Graefe. 2006 · 2006
Cited alongside, same era.
Optimizing Bitmap Indices with Efficient Compression
Kesheng Wu et al · 2006
Cited alongside, same era.
Super-Scalar RAM-CPU Cache Compression. In
Marcin Zukowski et al · 2006
Cited alongside, same era.
STX B+ Tree
2019 · 2007
Cited alongside, same era.
Database Cracking. In
Stratos Idreos et al · 2007
Cited alongside, same era.
Novel Online Methods for Time Series Segmentation
Xiaoyan Liu, Zhenjiang Lin, and Huaiqing Wang. 2008 · 2008
An Adaptive Algorithm for Online Time Series Segmentation with Error Bound Guarantee. In
Zhenghua Xu et al · 2012
Later among the works it cites.
The Adaptive Radix Tree: ARTful Indexing for Main-memory Databases. In
Viktor Leis et al · 2013
Later among the works it cites.
BF-tree: Approximate Tree Indexing. In
Manos Athanassoulis and Anastasia Ailamaki. 2014 · 2014
Later among the works it cites.
A Time-series Compression Technique and Its Application to the Smart Grid
Frank Eichinger et al · 2015
Later among the works it cites.
UpBit: Scalable In-Memory Updatable Bitmap Indexing. In
Manos Athanassoulis et al · 2016
Later among the works it cites.
Design Tradeoffs of Data Access Methods. In
Manos Athanassoulis and Stratos Idreos. 2016 · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Smooth Interpolating Histograms with Error Guarantees. In
Thomas Neumann and Michel Sebastian. 2008 · 2008
Cited alongside, same era.
RDF-3X: A RISC-style Engine for RDF. In
Thomas Neumann and Gerhard Weikum. 2008 · 2008
Cited alongside, same era.
Online Piece-wise Linear Approximation of Numerical Streams with Precision Guarantees
Hazem Elmeleegy et al · 2009
Cited alongside, same era.
Correlation Maps: A Compressed Access Method for Exploiting Soft Functional Dependencies
Hideaki Kimura et al · 2009
Cited alongside, same era.
RLH: Bitmap Compression Technique Based on Run-length and Huffman Encoding
Michał Stabno and Robert Wrembel. 2009 · 2009
Cited alongside, same era.
The Case for Interactive Data Exploration Accelerators (IDEAs). In
Andrew Crotty et al · 2016
Later among the works it cites.
Two Birds, One Stone: A Fast, Yet Lightweight, Indexing Scheme for Modern Database Systems. In
Jia Yu and Mohamed Sarwat. 2016 · 2016
Later among the works it cites.
Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes. In
Huanchen Zhang et al · 2016
Later among the works it cites.
Efficient Metric Indexing for Similarity Search and Similarity Joins. In
Lu Chen et al · 2017
Later among the works it cites.
Monkey: Optimal Navigable Key-Value Store. In
Niv Dayan, Manos Athanassoulis, and Stratos Idreos. 2017 · 2017
Later among the works it cites.
Revisiting Reuse for Approximate Query Processing. In
Alex Galakatos et al · 2017
Later among the works it cites.
The Case for Learned Index Structures. In
Tim Kraska et al · 2018
Closest in time.
A Benchmark for Machine-generated Data Management
2019 · 2019
Closest in time.
NYC Taxi & Limousine Commission Trip Record Data
2019 · 2019
Closest in time.
OpenStreetMap database
2019 · 2019
Closest in time.