Image de couverture de livre

Grafite: Taming Adversarial Queries with Optimal Range Filters

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Costa, Marco, Ferragina, Paolo, Vinciguerra, Giorgio
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms Databases
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Range (Rényi) Entropy Queries and Partitioning
par: Esmailpour, Aryan, et autres
Publié: (2023)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
par: Liang, Anqi, et autres
Publié: (2024)

Learned Static Function Data Structures
par: Hermann, Stefan, et autres
Publié: (2025)

Approximating Queries on Probabilistic Graphs
par: Amarilli, Antoine, et autres
Publié: (2023)

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

Enumeration Algorithms for Conjunctive Queries with Projection
par: Deep, Shaleen, et autres
Publié: (2021)

Balanced Learned Sort: a new learned model for fast and balanced item bucketing
par: Ferragina, Paolo, et autres
Publié: (2024)

Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations
par: Ferragina, Paolo, et autres
Publié: (2025)

Blocked Bloom Filters with Choices
par: Schmitz, Johanna Elena, et autres
Publié: (2025)

Computing Data Distribution from Query Selectivities
par: Agarwal, Pankaj K., et autres
Publié: (2024)

Querying in Constant Expected Time with Learned Indexes
par: Croquevielle, Luis, et autres
Publié: (2024)

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

Aleph Filter: To Infinity in Constant Time
par: Dayan, Niv, et autres
Publié: (2024)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
par: Arroyuelo, Diego, et autres
Publié: (2023)

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

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
par: Arenas, Marcelo, et autres
Publié: (2024)

Socio-Spatial Group Queries for Impromptu Activity Planning
par: Shen, Chih-Ya, et autres
Publié: (2015)

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
par: Bringmann, Karl, et autres
Publié: (2022)

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 Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
par: Im, Sungjin, et autres
Publié: (2025)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
par: Yang, Huihui, et autres
Publié: (2025)

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
par: Fan, Xiaoyu, et autres
Publié: (2024)

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

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
par: Zhong, Ming, et autres
Publié: (2023)

Optimal Dynamic Parameterized Subset Sampling
par: Gan, Junhao, et autres
Publié: (2024)

Weighted Fourier Factorizations: Optimal Gaussian Noise for Differentially Private Marginal and Product Queries
par: Lebeda, Christian Janos, et autres
Publié: (2025)

AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
par: Ramos, David Torres, et autres
Publié: (2026)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
par: Jang, Jihoon, et autres
Publié: (2025)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
par: Hamada, Kou, et autres
Publié: (2024)

GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
par: Kreis, Lara, et autres
Publié: (2026)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
par: Xu, Yuexuan, et autres
Publié: (2024)

Daisy Bloom Filters
par: Bercea, Ioana O., et autres
Publié: (2022)

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

Group Trip Planning Query Problem with Multimodal Journey
par: Ali, Dildar, et autres
Publié: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
par: Wang, Carrie, et autres
Publié: (2025)

Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
par: Balasubramanian, Shrinivass Arunachalam
Publié: (2025)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
par: Iff, Patrick, et autres
Publié: (2025)

Direct Access for Answers to Conjunctive Queries with Aggregation
par: Eldar, Idan, et autres
Publié: (2023)

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