Write it recursively: a generic framework for optimal path queries

Authors:
Akimasa Morihata;Kiminori Matsuzaki;Masato Takeichi
Affiliations:
University of Tokyo, Bunkyo-ku, Tokyo, Japan;University of Tokyo, Bunkyo-ku, Tokyo, Japan;University of Tokyo, Bunkyo-ku, Tokyo, Japan
Venue:
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Year:
2008

Citing 14
Cited 1

Shortest path under rational constraint

Information Processing Letters
Finding Regular Simple Paths in Graph Databases

SIAM Journal on Computing
Finding the k Shortest Paths

SIAM Journal on Computing
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Formal-Language-Constrained Path Problems

SIAM Journal on Computing
Universal Regular Path Queries

Higher-Order and Symbolic Computation
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Dynamic Programming

Dynamic Programming
Iterative-free program analysis

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Parametric regular path queries

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
The approach-dependent, time-dependent, label-constrained shortest path problem

Networks
Weighted path queries on semistructured databases

Information and Computation
A fast unified optimal route query evaluation algorithm

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management

A Short Cut to Optimal Sequences

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

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.