Imagen de Portada

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Song, Siwoo, Shin, Wonseok, Park, Kunsoo, Italiano, Giuseppe F., Yang, Zhengyi, Zhang, Wenjie
Formato:	Preprint
Publicado:	2025
Materias:	Databases 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

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
por: Jang, Jihoon, et al.
Publicado: (2025)

Efficient Computation of Hyper-triangles on Hypergraphs
por: Yin, Haozhe, et al.
Publicado: (2025)

Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach
por: Shin, Wonseok, et al.
Publicado: (2023)

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

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
por: Liang, Anqi, 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)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
por: Im, Sungjin, et al.
Publicado: (2025)

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
por: Lee, Changyeol, et al.
Publicado: (2025)

Blocked Bloom Filters with Choices
por: Schmitz, Johanna Elena, et al.
Publicado: (2025)

Smaller and More Flexible Cuckoo Filters
por: Schmitz, Johanna Elena, et al.
Publicado: (2025)

Aleph Filter: To Infinity in Constant Time
por: Dayan, Niv, et al.
Publicado: (2024)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
por: Yang, Huihui, et al.
Publicado: (2025)

Grafite: Taming Adversarial Queries with Optimal Range Filters
por: Costa, Marco, et al.
Publicado: (2023)

Contextual Pattern Mining and Counting
por: Li, Ling, et al.
Publicado: (2025)

Scalable Order-Preserving Pattern Mining
por: Li, Ling, et al.
Publicado: (2024)

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

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

Text Indexing for Long Patterns using Locally Consistent Anchors
por: Ayad, Lorraine A. K., et al.
Publicado: (2024)

Graph Traversal via Connected Mobile Agents
por: Jana, Saswata, et al.
Publicado: (2025)

Approximate Butterfly Counting in Sublinear Time
por: Luo, Chi, et al.
Publicado: (2026)

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

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
por: Fan, Xiaoyu, et al.
Publicado: (2024)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
por: Fan, Zhuochen, et al.
Publicado: (2024)

Space-Efficient Indexes for Uncertain Strings
por: Gabory, Esteban, et al.
Publicado: (2024)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
por: Bringmann, Karl, et al.
Publicado: (2026)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
por: Qi, Yiyan, et al.
Publicado: (2024)

Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
por: Wang, Kaixin, et al.
Publicado: (2023)

U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics
por: Wang, Huayi, et al.
Publicado: (2026)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
por: Li, Xuan, et al.
Publicado: (2024)

Daisy Bloom Filters
por: Bercea, Ioana O., et al.
Publicado: (2022)

ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
por: Ertl, Otmar
Publicado: (2024)

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
por: Bucić, Matija, et al.
Publicado: (2025)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
por: Hamada, Kou, et al.
Publicado: (2024)

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

Pattern Matching with Mismatches and Wildcards
por: Bathie, Gabriel, et al.
Publicado: (2024)

Approximate Circular Pattern Matching
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2022)

Dynamic Pattern Matching with Wildcards
por: Naeini, Arshia Ataee, et al.
Publicado: (2026)

Enhanced Graph Pattern Matching
por: Cotumaccio, Nicola
Publicado: (2024)

Pattern Masking for Dictionary Matching
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2020)

Quantum Pattern Matching with Wildcards
por: Seddighin, Masoud, et al.
Publicado: (2025)