Rajesh Jayaram
Abstract
Given a list of comparable items A = {a1, . . . , an sorted so that a1 < a2 < . . . < an, a canonical problem is locating a target item q within A if it exists. The canonical algorithm for this problem, of course, is binary search, which locates q using at most O(log n) comparisons between q and elements of A. Binary search is an indispensable tool for totally ordered datasets. However, many naturally occurring datasets are only partially ordered (posets), meaning that not all pairs of elements are comparable. Every such poset can be expressed as a directed acyclic graph (DAG), with edges (x,y) representing the relation x < y.
- D. Dereniowski and M. Kubale. Efficient parallel query processing by graph ranking. Fundamenta Informaticae, 69(3):273--285, 2006.Google Scholar
Digital Library
- E. Emamjomeh-Zadeh, D. Kempe, and V. Singhal. Deterministic and probabilistic binary search in graphs. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, pages 519--532, 2016.Google ScholarDigital Library
- S. Lu, W. Martens, M. Niewerth, and Y. Tao. Optimal algorithms for multiway search on partial orders. In Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 175--187, 2022.Google ScholarDigital Library
- Y. Tao, Y. Li, and G. Li. Interactive graph search. In Proceedings of the 2019 International Conference on Management of Data, pages 1393--1410, 2019.Google ScholarDigital Library
Recommendations
An Optimal Algorithm for Partial Order Multiway Search
Partial order multiway search (POMS) is an important problem that finds use in crowdsourcing, distributed file systems, software testing, etc. In this problem, a game is played between an algorithm A and an oracle, based on a directed acyclic graph G ...
Optimal Algorithms for Multiway Search on Partial Orders
PODS '22: Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsWe study partial order multiway search (POMS), which is a game between an algorithm A and an oracle, played on a directed acyclic graph G known to both parties. First, the oracle picks a vertex t in G called the target. Then, A needs to figure out which ...
Partial Order Multiway Search
Partial order multiway search (POMS) is a fundamental problem that finds applications in crowdsourcing, distributed file systems, software testing, and more. This problem involves an interaction between an algorithm đť’ś and an oracle, conducted on a ...
Comments