Optimal Algorithms for Multiway Search on Partial Orders
Summary: Defines POMS—querying sets of ≤k vertices for reachability to an unknown target in a DAG—and gives an optimal algorithm using O(log_{1+k} n + d k log_{1+d} n) probes with a matching lower bound. Introduces an EM variant: an O(n/B)-space structure achieving optimal O(log_B n + d B log_{1+d} n) I/Os and a black-box conversion to I/O-efficient pointer-machine structures. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shangqi Lu
- 2. Wim Martens
- 3. Matthias Niewerth
- 4. Yufei Tao
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,662 | Interactive Graph Search for Multiple Targets on DAGs | 2025 | VLDB | 5.2956801e-05 |
| 10,528 | Interactive Graph Search Made Simple | 2025 | SIGMOD | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,195 | Interactive Graph Search | 2019 | SIGMOD | 5.7333061e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,323 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS | 5.1725247e-05 |
| 4,409 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.7817775e-05 |
| 1,495 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS | 0.00010659736 |
| 3,243 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 7.6761871e-05 |
| 1,594 | Speedup Graph Processing by Graph Ordering | 2016 | SIGMOD | 0.00010341016 |
| 11,772 | Write-Optimized Skip Lists | 2017 | PODS | 5.1725247e-05 |
| 3,623 | On the Complexity of Approximate Query Optimization | 2002 | PODS | 7.3173278e-05 |
| 12,049 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 5.1725247e-05 |
| 11,833 | Efficient Top-k Indexing via General Reductions | 2016 | PODS | 5.1725247e-05 |
| 6,644 | Optimal Indexing Using Near-Minimal Space [Extended Abstract] | 2003 | PODS | 5.873163e-05 |