One Seed, Two Birds: A Unified Learned Structure for Exact and Approximate Counting
Abstract
Supplemental Material
- Download
- 40.00 MB
- Download
- 37.89 MB
References
Index Terms
- One Seed, Two Birds: A Unified Learned Structure for Exact and Approximate Counting
Recommendations
The Case for Learned Index Structures
SIGMOD '18: Proceedings of the 2018 International Conference on Management of DataIndexes are models: a \btree-Index can be seen as a model to map a key to the position of a record within a sorted array, a Hash-Index as a model to map a key to a position of a record within an unsorted array, and a BitMap-Index as a model to indicate ...
Two birds, one stone: a fast, yet lightweight, indexing scheme for modern database systems
Classic database indexes (e.g., B+-Tree), though speed up queries, suffer from two main drawbacks: (1) An index usually yields 5% to 15% additional storage overhead which results in non-ignorable dollar cost in big data scenarios especially when ...
A learned index for approximate kNN queries in high-dimensional spaces
AbstractApproximate k-Nearest Neighbor (kNN) search in high-dimensional spaces is a fundamental problem in computer systems and applications. However, traditional indexes for kNN search do not scale gracefully to massive high-dimensional datasets. As the ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Author Tags
Qualifiers
- Research-article
Funding Sources
- NSFC
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 190Total Downloads
- Downloads (Last 12 months)190
- Downloads (Last 6 weeks)26
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in