Optimal Algorithms for Multiway Search on Partial Orders-Reference-Cited by-同舟云学术

Optimal Algorithms for Multiway Search on Partial Orders

Published:2022-06-12 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
language:
Short-container-title:

Author:

Lu Shangqi¹,Martens Wim²,Niewerth Matthias²,Tao Yufei¹

Affiliation:

1. Chinese University of Hong Kong, Hong Kong, China

2. University of Bayreuth, Bayreuth, Germany

Funder

Deutsche Forschungsgemeinschaft

HKRGC

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3517804.3524150

Reference38 articles.

1. Micah Adler and Brent Heeringa . Approximating optimal binary decision trees. Algorithmica, 62(3--4):1112--1121 , 2012 . 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 . 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. point location using persistent B-trees;Arge Lars;ACM Journal of Experimental Algorithmics,2003

4. Decision Trees for Geometric Models

5. Yosi Ben-Asher and Eitan Farchi . The cost of searching in general trees versus complete binary trees. Technical report , 1997 . Yosi Ben-Asher and Eitan Farchi. The cost of searching in general trees versus complete binary trees. Technical report, 1997.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Technical Perspective: Optimal Algorithms for Multiway Search on Partial Orders;ACM SIGMOD Record;2023-06-07

2. Optimal Algorithms for Multiway Search on Partial Orders;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12