Cover Image

Approximating Queries on Probabilistic Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Amarilli, Antoine, van Bremen, Timothy, Gaspard, Octave, Meel, Kuldeep S.
Format:	Preprint
Published:	2023
Subjects:	Databases Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Ranked Enumeration for MSO on Trees via Knowledge Compilation
by: Amarilli, Antoine, et al.
Published: (2023)

Survey of Results on the ModPath and ModCycle Problems
by: Amarilli, Antoine
Published: (2024)

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

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
by: Ning, Baoling, et al.
Published: (2024)

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

Algorithms for Optimizing Acyclic Queries
by: Luo, Zheng, et al.
Published: (2025)

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
by: Meel, Kuldeep S., et al.
Published: (2025)

#CFG and #DNNF admit FPRAS
by: Meel, Kuldeep S., et al.
Published: (2024)

An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
by: Meel, Kuldeep S., et al.
Published: (2024)

Range (Rényi) Entropy Queries and Partitioning
by: Esmailpour, Aryan, et al.
Published: (2023)

Enumeration Algorithms for Conjunctive Queries with Projection
by: Deep, Shaleen, et al.
Published: (2021)

Computing Data Distribution from Query Selectivities
by: Agarwal, Pankaj K., et al.
Published: (2024)

Querying in Constant Expected Time with Learned Indexes
by: Croquevielle, Luis, et al.
Published: (2024)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
by: Arroyuelo, Diego, et al.
Published: (2023)

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

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
by: Carmeli, Nofar, et al.
Published: (2025)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
by: Arenas, Marcelo, et al.
Published: (2024)

Socio-Spatial Group Queries for Impromptu Activity Planning
by: Shen, Chih-Ya, et al.
Published: (2015)

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

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
by: Bringmann, Karl, et al.
Published: (2022)

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
by: Koehler, Henning, et al.
Published: (2025)

Improved Approximation Algorithms for Relational Clustering
by: Esmailpour, Aryan, et al.
Published: (2024)

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

Engineering an Efficient Approximate DNF-Counter
by: Soos, Mate, et al.
Published: (2024)

Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
by: Farhan, Muhammad, et al.
Published: (2025)

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

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

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
by: Zhong, Ming, et al.
Published: (2023)

Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization
by: Ali, Dildar, et al.
Published: (2026)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
by: Liang, Anqi, et al.
Published: (2024)

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata
by: Amarilli, Antoine, et al.
Published: (2024)

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

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
by: Yin, Ziqi, et al.
Published: (2026)

Edge-Minimum Walk of Modular Length in Polynomial Time
by: Amarilli, Antoine, et al.
Published: (2024)

The S-Hamiltonian Cycle Problem
by: Amarilli, Antoine, et al.
Published: (2026)

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

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

Distance Estimation for High-Dimensional Discrete Distributions
by: Kumar, Gunjan, et al.
Published: (2023)

New Compressed Indices for Multijoins on Graph Databases
by: Arroyuelo, Diego, et al.
Published: (2024)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)