819 search results - page 66 / 164 » Parallelization with Tree Skeletons |
PPAM
2005
Springer
15 years 3 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...
ICALP
1995
Springer
15 years 1 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
VLDB
1995
ACM
15 years 1 months ago
1995
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
ICCCN
2008
IEEE
15 years 4 months ago
2008
IEEE
—Detecting anomalies during the operation of a network is an important aspect of network management and security. Recent development of high-performance embedded processing syste...
PADS
1999
ACM
15 years 2 months ago
1999
ACM
This paper introduces the Critical Channel Traversing (CCTJ algorithm, a new scheduling algorithm for both sequential and parallel discrete event simulation. CCT is a general cons...