1007 search results - page 6 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
NETWORKING
2008
14 years 11 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
90
Voted
PPAM
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. 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 algorit...
77
Voted
ML
2002
ACM
14 years 9 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
ICDT
1999
ACM
15 years 1 months ago
1999
ACM
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...
121
click to vote
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...