BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Najafi, Mohammad Matin, Zhu, Xianju, Kosyfaki, Chrysanthi, Lakshmanan, Laks V. S., Cheng, Reynold
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Artificial Intelligence Databases Social and Information Networks
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
by: Wang, Carrie, et al.
Published: (2025)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
by: Yu, Kaiqiang, et al.
Published: (2025)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
by: Zhou, Yingli, et al.
Published: (2024)

Counting hypertriangles through hypergraph orientations
by: Paul-Pena, Daniel, et al.
Published: (2026)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
by: Pan, Yunjie, et al.
Published: (2024)

An Efficient Streaming Algorithm for Approximating Graphlet Distributions
by: Bressan, Marco, et al.
Published: (2026)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
by: Lin, Wenqing, et al.
Published: (2025)

Effective Individual Fairest Community Search over Heterogeneous Information Networks
by: Zhao, Taige, et al.
Published: (2024)

Triadic First-Order Logic Queries in Temporal Networks
by: Bhalerao, Omkar, et al.
Published: (2025)

Contextual Pattern Mining and Counting
by: Li, Ling, et al.
Published: (2025)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
by: Iff, Patrick, et al.
Published: (2025)

Efficiently Constructing Sparse Navigable Graphs
by: Conway, Alex, et al.
Published: (2025)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)

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

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
by: Li, Hui, et al.
Published: (2025)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
by: Xu, Yuexuan, et al.
Published: (2024)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
by: Shi, Jifan, et al.
Published: (2026)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
by: Lu, Qiheng, et al.
Published: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)

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

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

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
by: Chen, Jingbang, et al.
Published: (2024)

HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property
by: Chen, Zixuan, et al.
Published: (2023)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
by: Al-Jazzazi, Yousef, et al.
Published: (2025)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
by: Azizi, Ilias, et al.
Published: (2025)

COL-Trees: Efficient Hierarchical Object Search in Road Networks
by: Abeywickrama, Tenindra, et al.
Published: (2026)

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

On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
by: Lu, Qiheng, et al.
Published: (2024)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
by: Tabei, Yasuo
Published: (2025)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
by: Coleman, Benjamin, et al.
Published: (2023)

Diversity-Aware $k$-Maximum Inner Product Search Revisited
by: Huang, Qiang, et al.
Published: (2024)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
by: Zhao, Fuheng, et al.
Published: (2023)

Linked Array Tree: A Constant-Time Search Structure for Big Data
by: Liu, Songpeng
Published: (2025)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
by: Dhulipala, Laxman, et al.
Published: (2024)

TIMEST: Temporal Information Motif Estimator Using Sampling Trees
by: Pan, Yunjie, et al.
Published: (2025)

Correlation Sketches for Approximate Join-Correlation Queries
by: Santos, Aécio, et al.
Published: (2021)

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
by: Basu, Sabyasachi, et al.
Published: (2024)

Motiflets -- Simple and Accurate Detection of Motifs in Time Series
by: Schäfer, Patrick, et al.
Published: (2022)

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

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
by: Zhou, Alexander, et al.
Published: (2026)