1007 search results - page 5 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
93
Voted
SIGMETRICS
2002
ACM
14 years 9 months ago
2002
ACM
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
ICDCS
2008
IEEE
15 years 3 months ago
2008
IEEE
This paper considers a multi-query optimization issue for distributed similarity query processing, which attempts to exploit the dependencies in the derivation of a query evaluati...
175
click to vote
ICDE
2003
IEEE
15 years 10 months ago
2003
IEEE
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
75
Voted
FUIN
2006
14 years 9 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
ASPDAC
2007
ACM
15 years 1 months ago
2007
ACM
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...