332 search results - page 8 / 67 » Space Complexity vs. Query Complexity |
VLDB
1997
ACM
14 years 1 months ago
1997
ACM
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
SAC
2008
ACM
13 years 8 months ago
2008
ACM
One reasonable categorization of coordination models is into data sharing or message passing, based on whether the information necessary to coordination is persistently stored and...
CEC
2010
IEEE
13 years 11 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
IFIP
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
ICDE
1996
IEEE
14 years 11 months ago
1996
IEEE
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...