850 search results - page 155 / 170 » heuristics 2006 |
POPL
2006
ACM
14 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
VLDB
2006
ACM
14 years 9 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
SIGMOD
2006
ACM
14 years 9 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
SIGMOD
2006
ACM
14 years 9 months ago
2006
ACM
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
EUROSYS
2006
ACM
14 years 6 months ago
2006
ACM
The database tier of dynamic content servers at large Internet sites is typically hosted on centralized and expensive hardware. Recently, research prototypes have proposed using d...