3368 search results - page 13 / 674 » The Complexity of Query Reliability |
SIGCOMM
1998
ACM
13 years 11 months ago
1998
ACM
Recently, a parametric State Reward Markov Model SRMM p has been developed for the reliability and availability analysis of self-healing SONET mesh networks 2 . In this paper, w...
DLOG
2006
13 years 9 months ago
2006
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
SAT
2004
Springer
14 years 25 days ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting...