skip to main content
10.1145/3517804.3524150acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
research-article

Optimal Algorithms for Multiway Search on Partial Orders

Published: 13 June 2022 Publication History

Abstract

We 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 vertex is t by probing reachability. Specifically, in each probe, A selects a set Q of vertices in G whose size is bounded by a (pre-agreed) limit; the oracle reveals, for each vertex q ∈ Q, whether q can reach the target in G. The objective of A is to minimize the number of probes. This problem finds use in crowdsourcing, distributed file systems, software testing, etc.
We describe an algorithm to solve POMS in O(log1+k n + d/k log1+dn) probes, where n is the number of vertices in G, k is the maximum permissible |Q|, and d is the largest out-degree of the vertices in G. We further establish the algorithm's asymptotic optimality by proving a matching lower bound.
We also introduce a variant of POMS in the external memory (EM) computation model, which is the key to a black-box approach for converting a class of pointer-machine structures to their I/O-efficient counterparts. In the EM version of POMS, A is allowed to pre-compute a (disk-based) structure on G and is then required to clear its memory. The oracle (as before) picks a target t. A still needs to find t by issuing probes, except that the set Q in each probe must be read from the disk. The objective of A is now to minimize the number of I/Os. We present a structure that uses O(n/B) space and guarantees discovering the target in O(logB n + d/B log1+dn) I/Os where B is the block size, and n and d are as defined earlier. We establish the structure's asymptotic optimality by proving that any structure demands Ω(log_B n + d/B log1+d n) I/Os to find the target in the worst case regardless of the space consumption.

References

[1]
Micah Adler and Brent Heeringa. Approximating optimal binary decision trees. Algorithmica, 62(3--4):1112--1121, 2012.
[2]
Alok Aggarwal and Jeffrey Scott Vitter. The input/output complexity of sorting and related problems. Communications of the ACM (CACM), 31(9):1116--1127, 1988.
[3]
Lars Arge, Andrew Danner, and Sha-Mayn Teh. I/O-efficient point location using persistent B-trees. ACM Journal of Experimental Algorithmics, 8, 2003.
[4]
Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, and Steven Skiena. Decision trees for geometric models. International Journal of Computational Geometry and Applications, 8(3):343--364, 1998.
[5]
Yosi Ben-Asher and Eitan Farchi. The cost of searching in general trees versus complete binary trees. Technical report, 1997.
[6]
Yosi Ben-Asher, Eitan Farchi, and Ilan Newman. Optimal search in trees. SIAM Journal of Computing, 28(6):2090--2102, 1999.
[7]
Elisa Bertino, Barbara Catania, and Boris Shidlovsky. Towards optimal indexing for segment databases. In Proceedings of Extending Database Technology (EDBT), pages 39--53, 1998.
[8]
Paul B. Callahan, Michael T. Goodrich, and Kumar Ramaiyer. Topology B-trees and their applications. In Algorithms and Data Structures Workshop (WADS), pages 381--392, 1995.
[9]
Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, and Eduardo Sany Laber. Searching in random partially ordered sets. Theoretical Computer Science, 321(1):41--57, 2004.
[10]
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, and Mukesh K. Mohania. Decision trees for entity identification: Approximation algorithms and hardness results. ACM Transactions on Algorithms, 7(2):15:1--15:22, 2011.
[11]
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, and Yogish Sabharwal. Approximating decision trees with multiway branches. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pages 210--221, 2009.
[12]
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, and Marco Molinaro. On greedy algorithms for decision trees. In International Symposium on Algorithms and Computation (ISAAC), pages 206--217, 2010.
[13]
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, and Marco Molinaro. On the complexity of searching in trees and partially ordered structures. Theoretical Computer Science, 412(50):6879--6896, 2011.
[14]
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, and Marco Molinaro. Improved approximation algorithms for the average-case tree searching problem. Algorithmica, 68(4):1045--1074, 2014.
[15]
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, and Caio Dias Valentim. The binary identification problem for weighted trees. Theoretical Computer Science, 459:100--112, 2012.
[16]
Ferdinando Cicalese, Balá zs Keszegh, Bernard Lidický, Dö mö tö r Pá lvö lgyi, and Tomá s Valla. On the tree search problem with non-uniform costs. Theoretical Computer Science, 647:22--32, 2016.
[17]
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. The MIT Press, 2001.
[18]
Pilar de la Torre, Raymond Greenlaw, and Alejandro A. Sch"a ffer. Optimal edge ranking of trees in polynomial time. Algorithmica, 13(6):592--618, 1995.
[19]
Dariusz Dereniowski. Edge ranking of weighted trees. Discrete Applied Mathematics, 154(8):1198--1209, 2006.
[20]
Dariusz Dereniowski. Edge ranking and searching in partial orders. Discrete Applied Mathematics, 156(13):2493--2500, 2008.
[21]
Dariusz Dereniowski and Marek Kubale. Efficient parallel query processing by graph ranking. Fundamenta Informaticae, 69(3):273--285, 2006.
[22]
Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, and Daniel Wolleb-Graf. A framework for searching in graphs in the presence of errors. In Proceedings of Symposium on Simplicity in Algorithms (SOSA), pages 4:1--4:17.
[23]
Ehsan Emamjomeh-Zadeh, David Kempe, and Vikrant Singhal. Deterministic and probabilistic binary search in graphs. In Proceedings of ACM Symposium on Theory of Computing (STOC), pages 519--532, 2016.
[24]
Greg N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM Journal of Computing, 26(2):484--538, 1997.
[25]
Xiaocheng Hu, Cheng Sheng, and Yufei Tao. Building an optimal point-location structure in O(sort(n)) I/Os. Algorithmica, 81(5):1921--1937, 2019.
[26]
Ananth V. Iyer, H. Donald Ratliff, and Gopalakrishnan Vijayan. On an edge ranking problem of trees and graphs. Discrete Applied Mathematics, 30(1):43--52, 1991.
[27]
Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, and Marco Molinaro. On the complexity of searching in trees: Average-case minimization. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pages 527--539, 2010.
[28]
Camille Jordan. Sur les assemblages de lignes. Journal für die reine und angewandte Mathematik, 70:185--190, 1869.
[29]
S. Rao Kosaraju, Teresa M. Przytycka, and Ryan S. Borgstrom. On an optimal split tree problem. In Algorithms and Data Structures Workshop (WADS), pages 157--168, 1999.
[30]
Eduardo Sany Laber and Marco Molinaro. An approximation algorithm for binary searching in trees. Algorithmica, 59(4):601--620, 2011.
[31]
Eduardo Sany Laber and Loana Tito Nogueira. Fast searching in trees. Electronic Notes in Discrete Mathematics, 7:90--93, 2001.
[32]
Tak Wah Lam and Fung Ling Yue. Optimal edge ranking of trees in linear time. Algorithmica, 30(1):12--33, 2001.
[33]
Shay Mozes, Krzysztof Onak, and Oren Weimann. Finding an optimal tree searching strategy in linear time. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1096--1105, 2008.
[34]
Ketan Mulmuley. A fast planar partition algorithm, I. J. Symb. Comput., 10(3/4):253--280, 1990.
[35]
J. Ian Munro and Yakov Nekrich. Dynamic planar point location in external memory. In Proceedings of Symposium on Computational Geometry (SoCG), volume 129, pages 52:1--52:15.
[36]
Krzysztof Onak and Pawel Parys. Generalization of binary search: Searching in trees and forest-like partial orders. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 379--388, 2006.
[37]
Raimund Seidel. Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom., 43(6--7):556--564, 2010.
[38]
Yufei Tao, Yuanbing Li, and Guoliang Li. Interactive graph search. In Proceedings of ACM Management of Data (SIGMOD), pages 1393--1410, 2019.

Cited By

View all
  • (2023)Partial Order Multiway SearchACM Transactions on Database Systems10.1145/3626956Online publication date: 9-Oct-2023
  • (2023)An Optimal Algorithm for Partial Order Multiway SearchACM SIGMOD Record10.1145/3604437.360445652:1(84-92)Online publication date: 8-Jun-2023
  • (2023)Technical Perspective: Optimal Algorithms for Multiway Search on Partial OrdersACM SIGMOD Record10.1145/3604437.360445552:1(83-83)Online publication date: 8-Jun-2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODS '22: Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
June 2022
462 pages
ISBN:9781450392600
DOI:10.1145/3517804
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2022

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. data structures
  2. graph algorithms
  3. lower bounds
  4. partial order

Qualifiers

  • Research-article

Funding Sources

Conference

SIGMOD/PODS '22
Sponsor:

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)31
  • Downloads (Last 6 weeks)1
Reflects downloads up to 27 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Partial Order Multiway SearchACM Transactions on Database Systems10.1145/3626956Online publication date: 9-Oct-2023
  • (2023)An Optimal Algorithm for Partial Order Multiway SearchACM SIGMOD Record10.1145/3604437.360445652:1(84-92)Online publication date: 8-Jun-2023
  • (2023)Technical Perspective: Optimal Algorithms for Multiway Search on Partial OrdersACM SIGMOD Record10.1145/3604437.360445552:1(83-83)Online publication date: 8-Jun-2023

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media