Imagen de Portada

ε-Cost Sharding: Scaling Hypergraph-Based Static Functions and Filters to Trillions of Keys

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Vigna, Sebastiano
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

It is high time we let go of the Mersenne Twister
por: Vigna, Sebastiano
Publicado: (2019)

Partitioning Trillion Edge Graphs on Edge Devices
por: Chhabra, Adil, et al.
Publicado: (2024)

AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
por: Ramos, David Torres, et al.
Publicado: (2026)

New Prophet Inequalities via Poissonization and Sharding
por: Harb, Elfarouk
Publicado: (2023)

Near-Optimal Minimum Cuts in Hypergraphs at Scale
por: Chhabra, Adil, et al.
Publicado: (2025)

Modern Minimal Perfect Hashing: A Survey
por: Lehmann, Hans-Peter, et al.
Publicado: (2025)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
por: Song, Siwoo, et al.
Publicado: (2025)

Classes Testable with $O(1/ε)$ Queries for Small $ε$ Independent of the Number of Variables
por: Bshouty, Nader H., et al.
Publicado: (2026)

$(1-ε)$-Approximation of Knapsack in Nearly Quadratic Time
por: Mao, Xiao
Publicado: (2023)

A simple $(2+ε)$-approximation for knapsack interdiction
por: Weninger, Noah
Publicado: (2026)

Hyper-distance Oracles in Hypergraphs
por: Preti, Giulia, et al.
Publicado: (2023)

Sketching Cuts in Graphs and Hypergraphs
por: Kogan, Dmitry, et al.
Publicado: (2014)

A $(1+ε)$-Approximation for Ultrametric Embedding in Subquadratic Time
por: Bathie, Gabriel, et al.
Publicado: (2025)

Compressing Hypergraphs using Suffix Sorting
por: Adler, Enno, et al.
Publicado: (2025)

Semi-Streaming Algorithms for Hypergraph Matching
por: Reinstädtler, Henrik, et al.
Publicado: (2025)

Transitivity Preserving Projection in Directed Hypergraphs
por: Parsonage, Eric, et al.
Publicado: (2025)

Fully Dynamic Spectral Sparsification of Hypergraphs
por: Goranci, Gramoz, et al.
Publicado: (2025)

Hypergraph Unreliability in Quasi-Polynomial Time
por: Cen, Ruoxu, et al.
Publicado: (2024)

Engineering Hypergraph $b$-Matching Algorithms
por: Großmann, Ernestine, et al.
Publicado: (2024)

Efficient Parallel Algorithms for Hypergraph Matching
por: Reinstädtler, Henrik, et al.
Publicado: (2026)

Mimicking Networks for Constrained Multicuts in Hypergraphs
por: Cho, Kyungjin, et al.
Publicado: (2024)

Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions
por: Lange, Jane, et al.
Publicado: (2023)

Decremental $(1+ε)$-Approximate Maximum Eigenvector: Dynamic Power Method
por: Adil, Deeksha, et al.
Publicado: (2024)

Sublinear Edge Fault Tolerant Spanners for Hypergraphs
por: He, Jialin, et al.
Publicado: (2025)

Fully Dynamic Spectral Sparsification for Directed Hypergraphs
por: Forster, Sebastian, et al.
Publicado: (2025)

Almost Tight Bounds for Online Hypergraph Matching
por: Tröbst, Thorben, et al.
Publicado: (2024)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
por: Crane, Alex, et al.
Publicado: (2023)

Improved Certificates for Independence Number in Semirandom Hypergraphs
por: Kothari, Pravesh, et al.
Publicado: (2026)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
por: Kenneth, Yotam, et al.
Publicado: (2023)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
por: Bhattacharya, Sayan, et al.
Publicado: (2023)

A $(5/3+ε)$-Approximation for Tricolored Non-crossing Euclidean TSP
por: Baligács, Júlia, et al.
Publicado: (2024)

Solving Hypergraph Laplacian Systems in Almost-Linear Time
por: Yoshida, Yuichi
Publicado: (2026)

Static to Dynamic Correlation Clustering
por: Cao, Nairen, et al.
Publicado: (2025)

Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules
por: Amarilli, Antoine, et al.
Publicado: (2025)

New Graph and Hypergraph Container Lemmas with Applications in Property Testing
por: Blais, Eric, et al.
Publicado: (2024)

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
por: Khanna, Sanjeev, et al.
Publicado: (2024)

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
por: Lanzinger, Matthias, et al.
Publicado: (2023)

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
por: Khanna, Sanjeev, et al.
Publicado: (2024)

Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs
por: Großmann, Ernestine, et al.
Publicado: (2026)

Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
por: Haeupler, Bernhard, et al.
Publicado: (2025)