6274 search results - page 173 / 1255 » From query complexity to computational complexity |
167
click to vote
ICDE
2011
IEEE
14 years 8 months ago
2011
IEEE
—When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth...
199
click to vote
AAAI
2011
14 years 4 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
167
click to vote
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
160
click to vote
TKDE
2010
14 years 11 months ago
2010
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
149
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...