Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
Mohammad Matin Najafi, Xianju Zhu, Chrysanthi Kosyfaki +2
Subgraph counting the task of determining the number of instances of a query pattern within a large graph lies at the heart of many critical applications, from analyzing financial…
cs.DS2025
On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
Carrie Wang, Sihem Amer-Yahia, Laks V. S. Lakshmanan +1
We study Aggregation Queries over Nearest Neighbors (AQNN), which compute aggregates over the learned representations of the neighborhood of a designated query object. For example,…