PolyFit: Polynomial-based Indexing Approach for Fast Approximate Range Aggregate Queries

by   Zhe Li, et al.

Range aggregate queries find frequent application in data analytics. In some use cases, approximate results are preferred over accurate results if they can be computed rapidly and satisfy approximation guarantees. Inspired by a recent indexing approach, we provide means of representing a discrete point data set by continuous functions that can then serve as compact index structures. More specifically, we develop a polynomial-based indexing approach, called PolyFit, for processing approximate range aggregate queries. PolyFit is capable of supporting multiple types of range aggregate queries, including COUNT, SUM, MIN and MAX aggregates, with guaranteed absolute and relative error bounds. Experiment results show that PolyFit is faster and more accurate and compact than existing learned index structures.


page 1

page 2

page 3

page 4


Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases

Commercial off-the-shelf DataBase Management Systems (DBMSes) are highly...

A Learned Index for Exact Similarity Search in Metric Spaces

Indexing is an effective way to support efficient query processing in la...

Indexing Graph Search Trees and Applications

We consider the problem of compactly representing the Depth First Search...

Unconventional application of k-means for distributed approximate similarity search

Similarity search based on a distance function in metric spaces is a fun...

Robust and Scalable Content-and-Structure Indexing (Extended Version)

Frequent queries on semi-structured hierarchical data are Content-and-St...

Similarity Driven Approximation for Text Analytics

Text analytics has become an important part of business intelligence as ...

Spelunking the Deep: Guaranteed Queries on General Neural Implicit Surfaces via Range Analysis

Neural implicit representations, which encode a surface as the level set...