Y. A. Liu and F. Yu. Solving regular path queries. In Proceedings of the 6th International Conference on Mathematics of Program Construction, volume 2386 of LNCS, pages 195--208. Springer-Verlag, Berlin, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Incremental Program Analysis via Language Factors - de Moor, Drape, Lacey.. (2002) (1 citation) (Correct)
.... we employed a variant of modal logic [22] Later we explored regular expressions as an alternative, somewhat simpler notation for the same ideas [11] a derivation of the same solving algorithm, with more emphasis on the necessary data structures, but restricted to ground queries, can be found in [28]) Due to space limitations, we shall not address the range of transformations expressible in this framework. However, the reader is directed to [15] which contains many more examples of transformations, in particular in the area of code obfuscation, and [23] shows how the transformations can be ....
Y. A. Liu and F. Yu. Solving regular path queries. In Proceedings of the 6th International Conference on Mathematics of Program Construction (MPC), volume 2386 of Lecture Notes in Computer Science, pages 195{ 208. Springer Verlag, 2002.
Parametric Regular Path Queries - Tom Self-citation (Liu Yu) (Correct)
No context found.
Y. A. Liu and F. Yu. Solving regular path queries. In Proceedings of the 6th International Conference on Mathematics of Program Construction, volume 2386 of LNCS, pages 195--208. Springer-Verlag, Berlin, 2002.
From Datalog Rules to Efficient Programs with Time and Space.. - Liu, Stoller (2003) (2 citations) Self-citation (Liu) (Correct)
No context found.
Y. A. Liu and F. Yu. Solving regular path queries. In Proceedings of the 6th International Conference on Mathematics of Program Construction, volume 2386 of Lecture Notes in Computer Science, pages 195--208. Springer-Verlag, Berlin, 2002.
From Datalog Rules to Optimal Algorithms with Time and Space.. - Liu, Stoller (2003) Self-citation (Liu) (Correct)
....an arbitrary number of weakly based sets but only a constant number of strongly based sets. Essentially, base B provides a kind of indexing to elements of S starting from elements of W . However, often a non constant number of sets must be strongly based for constant time associative access [18, 23], and this is particularly the case here for compiling general forms of rules here. Speci cally, for the cleaned up version of (13) there is associative access in the domain of each component of the (i) result sets RQi s and worksets WQi s for relations Qi s that occur in the conclusions of ....
....algorithm understanding and greatly simpli ed complexity analysis for all of them. We summarize the worst case complexities of our derived algorithms for seven example problems in Table 1: transitive closure (the running example) graph reachability [8] four kinds of regular path queries [23, 14], and simpli cation of regular tree grammar based constraints [18] problem running time output space auxiliary space transitive closure O(#edge #vertex) O(#vertex ) O(#edge) graph reachability O(#source #edge) O(#vertex) O(1) regular path queries (RPQ) O(#edge #state ....
[Article contains additional citation context not shown here]
Y. A. Liu and F. Yu. Solving regular path queries. In Proceedings of the 6th International Conference on Mathematics of Program Construction, volume 2386 of Lecture Notes in Computer Science, pages 195-208. Springer-Verlag, Berlin, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC