1033 search results - page 153 / 207 » The Relative History Heuristic |
STOC
2005
ACM
16 years 5 days ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
189
click to vote
SIGMOD
2006
ACM
16 years 16 hour ago
2006
ACM
Self-tuning is a cost-effective and elegant solution to the important problem of configuring a database to the characteristics of the query load. Existing techniques operate in an...
100
click to vote
SIGMOD
2005
ACM
16 years 16 hour ago
2005
ACM
Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. The need for exploratory IP traffic data analysis naturally leads ...
100
click to vote
PODS
2001
ACM
16 years 3 hour ago
2001
ACM
Database systems frequently have to execute a set of related queries, which share several common subexpressions. Multi-query optimization exploits this, by finding evaluation plan...
102
click to vote
EDBT
2006
ACM
16 years 20 min ago
2006
ACM
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...