1007 search results - page 44 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
126
Voted
CEC
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
115
click to vote
SBBD
2003
15 years 3 months ago
2003
A common requirement of many scientific applications is the ability to process queries involving expensive predicates corresponding to user programs. Optimizing such queries is ha...
125
click to vote
VLDB
1991
ACM
15 years 5 months ago
1991
ACM
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
143
click to vote
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over t...
134
Voted
ICDCS
2002
IEEE
15 years 7 months ago
2002
IEEE
Recent technology advances have enabled mediated query processing with Internet accessible WebSources. A characteristic of WebSources is that their access costs exhibit transient ...