1007 search results - page 75 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
149
click to vote
SIGMETRICS
2010
ACM
15 years 1 months ago
2010
ACM
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
124
click to vote
ADBIS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...
148
click to vote
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
122
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
130
click to vote
VLDB
1999
ACM
15 years 7 months ago
1999
ACM
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...