1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DB2021★ 1 cited
Regular Path Query Evaluation Sharing a Reduced Transitive Closure Based on Graph Reduction
Inju Na, Ilyeop Yi, Kyu-Young Whang +2
Regular path queries (RPQs) find pairs of vertices of paths satisfying given regular expressions on an edge-labeled, directed multigraph. When evaluating an RPQ, the evaluation of…
cs.DB2021
Efficient Exact k-Flexible Aggregate Nearest Neighbor Search in Road Networks Using the M-tree
Moonyoung Chung, Soon J. Hyun, Woong-Kee Loh
This study proposes an efficient exact k-flexible aggregate nearest neighbor (k-FANN) search algorithm in road networks using the M-tree. The state-of-the-art IER-kNN algorithm use…