Sciweavers

5481 search results - page 29 / 1097
» Application Analysis for Parallel Processing
Sort
View
FUIN
2006
139views more  FUIN 2006»
14 years 9 months ago
Efficient Parallel Query Processing by Graph Ranking
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...
Dariusz Dereniowski, Marek Kubale
IDEAS
2000
IEEE
90views Database» more  IDEAS 2000»
15 years 2 months ago
StreamJoin: A Generic Database Approach to Support the Class of Stream-Oriented Applications
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...
Clara Nippl, Ralf Rantzau, Bernhard Mitschang
81
Voted
GCC
2005
Springer
15 years 3 months ago
A Hybrid Workflow Paradigm for Integrating Self-managing Domain-Specific Applications
Abstract. A hybrid workflow system could be treated as a domain-across infrastructure by incorporating different workflow systems and WfMSs engaged in the complex business processi...
Wan-Chun Dou, Shing-Chi Cheung, Guihai Chen, Jie W...
ICDM
2006
IEEE
147views Data Mining» more  ICDM 2006»
15 years 3 months ago
Adaptive Parallel Graph Mining for CMP Architectures
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...
Gregory Buehrer, Srinivasan Parthasarathy, Yen-Kua...
83
Voted
SIGMOD
2004
ACM
151views Database» more  SIGMOD 2004»
15 years 9 months ago
Highly-Available, Fault-Tolerant, Parallel Dataflows
We present a technique that masks failures in a cluster to provide high availability and fault-tolerance for long-running, parallelized dataflows. We can use these dataflows to im...
Mehul A. Shah, Joseph M. Hellerstein, Eric A. Brew...