ABSTRACT
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of optimal path problem. In this paper, we propose a generic framework for optimal path queries. We offer a domain-specific language to describe optimal path queries, together with an algorithm to find an optimal path specified in our language. One of the most distinct features of our framework is the use of recursive functions to specify queries. Recursive functions reinforce expressiveness of our language so that we can describe many problems including known ones; thus, we need not learn existing results. Moreover, we can derive an efficient querying algorithm from the description of a query written in recursive functions. Our algorithm is a generalization of existing algorithms, and answers a query in O(n log n) time on a graph of O(n) size. We also explain our implementation of an optimal path querying system, and report some experimental results.
Supplemental Material
Available for Download
Supplemental material for: Write it recursively: a generic framework for optimal path queries
- Christopher L. Barrett, Riko Jacob, and Madhav V. Marathe. Formal-language-constrained path problems. SIAM Journal on Computing, 30(3):809--837, 2000. Google Scholar
Digital Library
- Christopher L. Barrett, Keith Bisset, Riko Jacob, Goran Konjevod, and Madhav V. Marathe. Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the TRANSIMS router. In Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, volume 2461 of Lecture Notes in Computer Science, pages 126--138. Springer, 2002. Google Scholar
Digital Library
- Christopher L. Barrett, Keith Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe, and Dorothea Wagner. Label constrained shortest path algorithms: An experimental evaluation using transportation networks. Technical report, Virginia Tech (USA), Arizona State University (USA), and Karlsruhe University (Germany), 2007.Google Scholar
- Richard Bellman. Dynamic Programming. Princeton University Press, 1957. Google Scholar
Digital Library
- Gerth Stølting Brodal and Riko Jacob. Time-dependent networks as models to achieve fast exact time-table queries. Electronic Notes in Theoretical Computer Science, 92:3--15, 2004.Google Scholar
Cross Ref
- Edward P. F. Chan and Jie Zhang. A fast unified optimal route query evaluation algorithm. In Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, CIKM 2007, Lisbon, Portugal, November 6-10, 2007, pages 371--380. ACM, 2007. Google Scholar
Digital Library
- Oege de Moor, David Lacey, and Eric Van Wyk. Universal regular path queries. Higher-Order and Symbolic Computation, 16(1-2):15--35, 2003. Google Scholar
Digital Library
- Martin Desrochers and François Soumis. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR, 26:191--212, 1988.Google Scholar
- David Eppstein. Finding the k shortest paths. SIAM Journal on Computing, 28(2):652--673, 1998. Google Scholar
Digital Library
- Sergio Flesca, Filippo Furfaro, and Sergio Greco. Weighted path queries on semistructured databases. Information and Computation, 204(5):679--696, 2006. Google Scholar
Digital Library
- Toshihide Ibaraki. Solvable classes of discrete dynamic programming. Journal of mathematical analysis and applications, 43(3):642--693, 1973.Google Scholar
- Toshihide Ibaraki. Branch-and-bound procedure and state-space representation of combinatorial optimization problems. Information and Control, 36(1):1--27, 1978.Google Scholar
Cross Ref
- Donald B. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, 24(1):1--13, 1977. Google Scholar
Digital Library
- H. C. Joksch. The shortest route problem with constraints. Journal of Mathematical analysis and applications, 14:191--197, 1966.Google Scholar
- Richard M. Karp and Michael Held. Finite-state processes and dynamic programming. SIAM Journal on Applied Mathematics, 15(3):693--718, 1967.Google Scholar
Digital Library
- Turgay Korkmaz and Marwan Krunz. Multi-constrained optimal path selection. In Proceedings IEEE INFOCOM 2001, The Conference on Computer Communications, Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, pages 834--843, 2001.Google Scholar
Cross Ref
- Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D. Stoller, and Nanjun Hu. Parametric regular path queries. In Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation 2004, Washington, DC, USA, June 9-11, 2004, pages 219--230. ACM, 2004. Google Scholar
Digital Library
- Ernesto Q. Vieira Martins. An algorithm for ranking paths that may contain cycles. European Journal of Operational Research, 18(1):123--130, 1984.Google Scholar
Cross Ref
- Alberto O. Mendelzon and Peter T. Wood. Finding regular simple paths in graph databases. SIAM Jornal on Computing, 24(6):1235--1258, 1995. Google Scholar
Digital Library
- Akimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, and Masato Takeichi. Calculus of minimals: Deriving dynamic-programming algorithms based on preservation of monotonicity. Technical Report METR 2007-61, Department of Mathematical Informatics, University of Tokyo, 2007.Google Scholar
- Mizuhito Ogawa, Zhenjiang Hu, and Isao Sasano. Iterative-free program analysis. In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ICFP'03, Uppsala, Sweden, August 25-29, 2003, pages 111--123. ACM, 2003. Google Scholar
Digital Library
- Abraham P. Punnen. A linear time algorithm for the maximum capacity path problem. European Journal of Operational Research, 53(3):402--404, 1991.Google Scholar
Cross Ref
- Jean-François Romeuf. Shortest path under rational constraint. Information Processing Letters, 28(5):245--248, 1988. Google Scholar
Digital Library
- Isao Sasano, Zhenjiang Hu, Masato Takeichi, and Mizuhito Ogawa. Make it practical: a generic linear-time algorithm for solving maximumweightsum problems. In Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming, ICFP'00, pages 137--149. ACM, 2000. Google Scholar
Digital Library
- Hanif D. Sherali, Chawalit Jeenanunta, and Antoine G. Hobeika. The approach-dependent, time-dependent, label-constrained shortest path problem. Networks, 48(2):57--67, 2006. Google Scholar
Digital Library
- Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine. The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, 2001.Google Scholar
- Daniel Villeneuve and Guy Desaulniers. The shortest path problem with forbidden paths. European Journal of Operational Research, 165(1):97--107, 2005.Google Scholar
Cross Ref
Index Terms
Write it recursively: a generic framework for optimal path queries
Recommendations
Write it recursively: a generic framework for optimal path queries
ICFP '08Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of optimal path problem. In this paper, we propose a generic framework for ...
Numberings Optimal for Learning
Algorithmic Learning TheoryAbstractThis paper extends previous studies on learnability in non-acceptable numberings by considering the question: for which criteria which numberings are optimal, that is, for which numberings it holds that one can learn every learnable class using ...
How to Comprehend Queries Functionally
Special issue on functional approach to intelligent information systemsCompilers and optimizers for declarative query languages use some form of intermediate language to represent user-level queries. The advent of compositional query languages for orthogonal type systems (e.g., OQL) calls for internal query representations ...







Comments