Graph queries through datalog optimizations

13 years 9 months ago

Download www.cs.sunysb.edu

This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efﬁcient implementations of the queries. The language supports graph path expressions that allow convenient use of both vertices and edges of arbitrary kinds as well as additional global and local parameters in graph paths. Our implementation method combines transformation to Datalog, recursion conversion, demand transformation, and specialization, and ﬁnally generates efﬁcient analysis programs with precise complexity guarantees. This combination improves an O(V E) time complexity factor using previous methods to O(E), where V and E are the numbers of graph vertices and edges, respectively. We also describe implementations and experiments that conﬁrm the analyzed complexities. Categories and Subject Descriptors D.3.2 [Programming Languages]: Language Classiﬁcations—Constraint and logic languages, Very high level languages; D.3.3 [...

K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L

Real-time Traffic