On the public citation graph

FITing-Tree: A Data-aware Index Structure

0 signed · 91 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4757-6190-0openalex-snapshot
Piecewise Linear Modeling and Analysis
inferredcites →https://doi.org/10.1007/978-3-540-70504-8_12openalex-snapshot
Smooth Interpolating Histograms with Error Guarantees
inferredcites →https://doi.org/10.1007/bf01436085openalex-snapshot
Chebyshev approximation by spline functions with free knots
inferredcites →https://doi.org/10.1007/s002360050048openalex-snapshot
The log-structured merge-tree (LSM-tree)
inferredcites →https://doi.org/10.1007/s00778-014-0368-8openalex-snapshot
A time-series compression technique and its application to the smart grid
inferredcites →https://doi.org/10.1016/0021-9045(69)90033-1openalex-snapshot
Computational methods for best spline function approximation
inferredcites →https://doi.org/10.1016/j.ipm.2010.11.011openalex-snapshot
Use of permutation prefixes for efficient and scalable approximate similarity search
inferredcites →https://doi.org/10.1016/j.is.2008.11.002openalex-snapshot
RLH: Bitmap compression technique based on run-length and Huffman encoding
inferredcites →https://doi.org/10.1109/icde.1996.492204openalex-snapshot
Approximate queries and representations for large data sequences
inferredcites →https://doi.org/10.1109/icde.1998.655800openalex-snapshot
Compressing relations and indexes
inferredcites →https://doi.org/10.1109/icde.2001.914847openalex-snapshot
B-tree indexes and CPU caches
inferredcites →https://doi.org/10.1109/icde.2005.35openalex-snapshot
Compressing Bitmap Indices by Data Reorganization
inferredcites →https://doi.org/10.1109/icde.2005.66openalex-snapshot
Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets
inferredcites →https://doi.org/10.1109/icde.2006.150openalex-snapshot
Super-Scalar RAM-CPU Cache Compression
inferredcites →https://doi.org/10.1109/icde.2013.6544812openalex-snapshot
The adaptive radix tree: ARTful indexing for main-memory databases
inferredcites →https://doi.org/10.1109/icdm.2001.989531openalex-snapshot
An online algorithm for segmenting time series
inferredcites →https://doi.org/10.1109/t-c.1974.224041openalex-snapshot
Segmentation of Plane Curves
inferredcites →https://doi.org/10.1109/tkde.2008.29openalex-snapshot
Novel Online Methods for Time Series Segmentation
inferredcites →https://doi.org/10.1109/tkde.2015.2506556openalex-snapshot
Efficient Metric Indexing for Similarity Search and Similarity Joins
inferredcites →https://doi.org/10.1145/1132863.1132864openalex-snapshot
Optimizing bitmap indices with efficient compression
inferredcites →https://doi.org/10.1145/1140402.1140409openalex-snapshot
B-tree indexes, interpolation search, and skew
inferredcites →https://doi.org/10.1145/16856.16888openalex-snapshot
The design of POSTGRES
inferredcites →https://doi.org/10.1145/16894.16888openalex-snapshot
The design of POSTGRES
inferredcites →https://doi.org/10.1145/1807167.1807206openalex-snapshot
FAST
inferredcites →https://doi.org/10.1145/2247596.2247620openalex-snapshot
An adaptive algorithm for online time series segmentation with error bound guarantee
inferredcites →https://doi.org/10.1145/276304.276320openalex-snapshot
Dimensionality reduction for similarity searching in dynamic databases
inferredcites →https://doi.org/10.1145/276304.276336openalex-snapshot
Bitmap index design and evaluation
inferredcites →https://doi.org/10.1145/276305.276336openalex-snapshot
Bitmap index design and evaluation
inferredcites →https://doi.org/10.1145/2882903.2912569openalex-snapshot
Design Tradeoffs of Data Access Methods
inferredcites →https://doi.org/10.1145/2882903.2915222openalex-snapshot
Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes
inferredcites →https://doi.org/10.1145/2882903.2915964openalex-snapshot
UpBit
inferredcites →https://doi.org/10.1145/2939502.2939513openalex-snapshot
The case for interactive data exploration accelerators (IDEAs)
inferredcites →https://doi.org/10.1145/3035918.3064054openalex-snapshot
Monkey
inferredcites →https://doi.org/10.1145/3183713.3196909openalex-snapshot
The Case for Learned Index Structures
inferredcites →https://doi.org/10.1145/320521.320530openalex-snapshot
Prefix B -trees
inferredcites →https://doi.org/10.1145/74120.74121openalex-snapshot
The case for partial indexes
inferredcites →https://doi.org/10.14778/1453856.1453927openalex-snapshot
RDF-3X
inferredcites →https://doi.org/10.14778/1687627.1687645openalex-snapshot
Online piece-wise linear approximation of numerical streams with precision guarantees
inferredcites →https://doi.org/10.14778/1687627.1687765openalex-snapshot
Correlation maps
inferredcites →https://doi.org/10.14778/2002974.2002975openalex-snapshot
Efficient parallel lists intersection and index compression algorithms using graphics processing units
inferredcites →https://doi.org/10.14778/2733085.2733094openalex-snapshot
BF-tree
inferredcites →https://doi.org/10.14778/3025111.3025120openalex-snapshot
Two birds, one stone
inferredcites →https://doi.org/10.14778/3115404.3115418openalex-snapshot
Revisiting reuse for approximate query processing

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-39469-1_6openalex-snapshot
Function Interpolation for Learned Index Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-43883-8_2openalex-snapshot
Learned Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-47956-5_15openalex-snapshot
ExtraPeak: Advanced Automatic Performance Modeling for HPC Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-85899-5_11openalex-snapshot
A Distribution-Aware Training Scheme for Learned Indexes
inferred← citeshttps://doi.org/10.1007/978-3-030-85899-5_34openalex-snapshot
ALMSS: Automatic Learned Index Model Selection System
inferred← citeshttps://doi.org/10.1007/s11390-021-1348-2openalex-snapshot
COLIN: A Cache-Conscious Dynamic Learned Index with High Read/Write Performance
inferred← citeshttps://doi.org/10.1007/s11633-020-1236-1openalex-snapshot
Bounded Evaluation: Querying Big Data with Bounded Resources
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.015openalex-snapshot
On the performance of learned data structures
inferred← citeshttps://doi.org/10.1038/s43588-022-00201-8openalex-snapshot
Accelerating minimap2 for long-read sequencing applications on modern CPUs
inferred← citeshttps://doi.org/10.1101/2020.12.22.423964openalex-snapshot
LISA: A Case For Learned Index based Acceleration of Biological Sequence Analysis
inferred← citeshttps://doi.org/10.1101/2021.07.21.453294openalex-snapshot
Accelerating long-read analysis on modern CPUs
inferred← citeshttps://doi.org/10.1109/cloud53861.2021.00083openalex-snapshot
DLB: Deep Learning Based Load Balancing
inferred← citeshttps://doi.org/10.1109/compsac48688.2020.00-32openalex-snapshot
Advanced, Privacy-Preserving and Approximate Big Data Management and Analytics in Distributed Environments: What is Now and What is Next
inferred← citeshttps://doi.org/10.1109/dsaa53316.2021.9564218openalex-snapshot
DaskDB: Scalable Data Science with Unified Data Analytics and In Situ Query Processing
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00058openalex-snapshot
DBA bandits: Self-driving index tuning under ad-hoc, analytical workloads with safety guarantees
inferred← citeshttps://doi.org/10.1145/3318464.3389752openalex-snapshot
The Case for a Learned Sorting Algorithm
inferred← citeshttps://doi.org/10.1145/3332466.3374547openalex-snapshot
XIndex
inferred← citeshttps://doi.org/10.1145/3397536.3426358openalex-snapshot
A Tutorial on Learned Multi-dimensional Indexes
inferred← citeshttps://doi.org/10.1145/3401071.3401659openalex-snapshot
RadixSpline
inferred← citeshttps://doi.org/10.1145/3409963.3410496openalex-snapshot
SIndex
inferred← citeshttps://doi.org/10.1145/3447548.3470827openalex-snapshot
AutoML
inferred← citeshttps://doi.org/10.1145/3448016.3457270openalex-snapshot
Instance-Optimized Data Layouts for Cloud Analytics Workloads
inferred← citeshttps://doi.org/10.1145/3464509.3464886openalex-snapshot
RUSLI: Real-time Updatable Spline Learned Index
inferred← citeshttps://doi.org/10.1145/3468520openalex-snapshot
XStore : Fast RDMA-Based Ordered Key-Value Store Using Remote Learned Cache
inferred← citeshttps://doi.org/10.1145/3469830.3470892openalex-snapshot
SPRIG: A Learned Spatial Index for Range and kNN Queries
inferred← citeshttps://doi.org/10.1145/3514221.3517867openalex-snapshot
The Price of Tailoring the Index to Your Data: Poisoning Attacks on Learned Index Structures
inferred← citeshttps://doi.org/10.1145/3533702.3534917openalex-snapshot
Micro-architectural analysis of a learned index
inferred← citeshttps://doi.org/10.14778/3407790.3407829openalex-snapshot
Effectively learning spatial indices
inferred← citeshttps://doi.org/10.14778/3421424.3421425openalex-snapshot
Benchmarking learned indexes
inferred← citeshttps://doi.org/10.14778/3425879.3425880openalex-snapshot
Tsunami
inferred← citeshttps://doi.org/10.14778/3476249.3476263openalex-snapshot
LES 3
inferred← citeshttps://doi.org/10.14778/3476311.3476392openalex-snapshot
Towards instance-optimized data systems
inferred← citeshttps://doi.org/10.14778/3510397.3510405openalex-snapshot
A critical analysis of recursive model indexes
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2025.7openalex-snapshot
FL-RMQ: A Learned Approach to Range Minimum Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1911.04706openalex-snapshot
FLAML: A Fast and Lightweight AutoML Library
inferred← citeshttps://doi.org/10.48550/arxiv.2003.08031openalex-snapshot
PolyFit: Polynomial-based Indexing Approach for Fast Approximate Range Aggregate Queries
inferred← citeshttps://doi.org/10.48550/arxiv.2004.14541openalex-snapshot
RadixSpline: A Single-Pass Learned Index
inferred← citeshttps://doi.org/10.48550/arxiv.2005.14213openalex-snapshot
From WiscKey to Bourbon: A Learned Index for Log-Structured Merge Trees
inferred← citeshttps://doi.org/10.48550/arxiv.2006.16393openalex-snapshot
COAX: Correlation-Aware Indexing on Multidimensional Data with Soft Functional Dependencies
inferred← citeshttps://doi.org/10.48550/arxiv.2007.10237openalex-snapshot
Learning from Data to Speed-up Sorted Table Search Procedures: Methodology and Practical Guidelines
inferred← citeshttps://doi.org/10.48550/arxiv.2012.12501openalex-snapshot
Learned Indexes for a Google-scale Disk-based Database
inferred← citeshttps://doi.org/10.48550/arxiv.2101.00808openalex-snapshot
A Pluggable Learned Index Method via Sampling and Gap Insertion
inferred← citeshttps://doi.org/10.48550/arxiv.2101.10457openalex-snapshot
Shift-Table: A Low-latency Learned Index for Range Queries using Model Correction
inferred← citeshttps://doi.org/10.48550/arxiv.2102.06789openalex-snapshot
Spatial Interpolation-based Learned Index for Range and kNN Queries
inferred← citeshttps://doi.org/10.48550/arxiv.2102.08081openalex-snapshot
A Lazy Approach for Efficient Index Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2102.09295openalex-snapshot
A Unified System for Data Analytics and In Situ Query Processing
inferred← citeshttps://doi.org/10.48550/arxiv.2103.00858openalex-snapshot
CARMI: A Cache-Aware Learned Index with a Cost-based Construction Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.2105.00642openalex-snapshot
One Model to Rule them All: Towards Zero-Shot Learning for Databases
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.