Image de couverture de livre

SplineSketch: Even More Accurate Quantiles with Error Guarantees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Łukasiewicz, Aleksander, Tětek, Jakub, Veselý, Pavel
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Databases Computation
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Relative Error Streaming Quantiles with Seamless Mergeability via Adaptive Compactors
par: Domes, Tomáš, et autres
Publié: (2025)

Sampling Methods for Inner Product Sketching
par: Daliri, Majid, et autres
Publié: (2023)

Listing Even Cycles Faster than the Submodular-Width Barrier
par: Nakos, Vasileios, et autres
Publié: (2026)

Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch
par: Lebeda, Christian Janos, et autres
Publié: (2023)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
par: De Man, Quinten, et autres
Publié: (2026)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
par: Qi, Yiyan, et autres
Publié: (2024)

Approaching 100% Confidence in Stream Summary through ReliableSketch
par: Wu, Yuhan, et autres
Publié: (2024)

A Tight Lower Bound for Comparison-Based Quantile Summaries
par: Cormode, Graham, et autres
Publié: (2019)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
par: Bessa, Aline, et autres
Publié: (2023)

Smaller and More Flexible Cuckoo Filters
par: Schmitz, Johanna Elena, et autres
Publié: (2025)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
par: Hladík, Richard, et autres
Publié: (2024)

Harmonic Decomposition in Data Sketches
par: Wang, Dingyu
Publié: (2024)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
par: Wang, Kaixin, et autres
Publié: (2026)

Noisy (Binary) Searching: Simple, Fast and Correct
par: Dereniowski, Dariusz, et autres
Publié: (2021)

Sampling Space-Saving Set Sketches
par: Lee, Homin K., et autres
Publié: (2024)

Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
par: Lebeda, Christian Janos, et autres
Publié: (2024)

Matrix Product Sketching via Coordinated Sampling
par: Daliri, Majid, et autres
Publié: (2025)

Optimal Matrix Sketching over Sliding Windows
par: Yin, Hanyan, et autres
Publié: (2024)

Correlation Sketches for Approximate Join-Correlation Queries
par: Santos, Aécio, et autres
Publié: (2021)

UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
par: Ertl, Otmar
Publié: (2023)

Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation
par: Narayanan, Shyam, et autres
Publié: (2024)

Dynamic Data Layout Optimization with Worst-case Guarantees
par: Rong, Kexin, et autres
Publié: (2024)

MagnifierSketch: Quantile Estimation Centered at One Point
par: Guo, Jiarui, et autres
Publié: (2025)

Practical and Accurate Local Edge Differentially Private Graph Algorithms
par: Mundra, Pranay, et autres
Publié: (2025)

Streaming Diameter of High-Dimensional Points
par: Halldórsson, Magnús M., et autres
Publié: (2025)

Towards Scalable and Practical Batch-Dynamic Connectivity
par: De Man, Quinten, et autres
Publié: (2024)

Explaining Rankings with Hidden Group Bonuses
par: Yan, Alvin Hong Yao, et autres
Publié: (2026)

Differentially Private Quantiles with Smaller Error
par: Imola, Jacob, et autres
Publié: (2025)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
par: Carmeli, Nofar, et autres
Publié: (2025)

Algorithms for Optimizing Acyclic Queries
par: Luo, Zheng, et autres
Publié: (2025)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
par: Song, Siwoo, et autres
Publié: (2025)

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
par: Koehler, Henning, et autres
Publié: (2025)

Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
par: Farhan, Muhammad, et autres
Publié: (2025)

Efficient Computation of Hyper-triangles on Hypergraphs
par: Yin, Haozhe, et autres
Publié: (2025)

Indexing Strings with Utilities
par: Bernardini, Giulia, et autres
Publié: (2025)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
par: Im, Sungjin, et autres
Publié: (2025)

Clustering with Set Outliers and Applications in Relational Clustering
par: Surianarayanan, Vaishali, et autres
Publié: (2025)

Towards Lazy B-Trees
par: Rysgaard, Casper Moldrup, et autres
Publié: (2025)

Hilbert Forest in the SISAP 2025 Indexing Challenge
par: Imamura, Yasunobu, et autres
Publié: (2025)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
par: Li, Zheng, et autres
Publié: (2025)