654 search results - page 60 / 131 » Complexity of Answering Queries Using Materialized Views |
125
click to vote
DASFAA
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. To process aggregation queries issued through different sensors as access points in sensor networks, existing algorithms handle queries independently and perform in-netw...
131
click to vote
EKAW
2006
Springer
15 years 7 months ago
2006
Springer
Semantic search promises to produce precise answers to user queries by taking advantage of the availability of explicit semantics of information in the context of the semantic web....
SIGMOD
2002
ACM
16 years 3 months ago
2002
ACM
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
117
click to vote
EDBTW
2004
Springer
15 years 8 months ago
2004
Springer
While there are many proposals for path indexes on XML documents, none of them is perfectly suited for indexing large-scale collections of interlinked XML documents. Existing strat...
123
click to vote
LATINCRYPT
2010
15 years 1 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...