Sciweavers

87 search results - page 8 / 18
» Maintenance of Transitive Closures and Transitive Reductions...
Sort
View
DBA
2004
93views Database» more  DBA 2004»
13 years 9 months ago
A Query Language Solution for Fastest Flight Connections
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
J. A. Bakker, J. H. ter Bekke
CSR
2008
Springer
13 years 9 months ago
Synchronization of Grammars
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
Didier Caucal, Stéphane Hassen
IPL
2008
110views more  IPL 2008»
13 years 7 months ago
Reduction of stochastic parity to stochastic mean-payoff games
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
Krishnendu Chatterjee, Thomas A. Henzinger
CAV
2008
Springer
96views Hardware» more  CAV 2008»
13 years 9 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
CIKM
2010
Springer
13 years 6 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil