Sciweavers

589 search results - page 45 / 118
» Optimized Query Evaluation Using Cooperative Sorts
Sort
View
MST
1998
91views more  MST 1998»
14 years 9 months ago
An Experimental Analysis of Parallel
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
Guy E. Blelloch, Charles E. Leiserson
PVM
2005
Springer
15 years 3 months ago
Cooperative Write-Behind Data Buffering for MPI I/O
Many large-scale production parallel programs often run for a very long time and require data checkpoint periodically to save the state of the computation for program restart and/o...
Wei-keng Liao, Kenin Coloma, Alok N. Choudhary, Le...
ICDE
2008
IEEE
215views Database» more  ICDE 2008»
15 years 11 months ago
Fast and Simple Relational Processing of Uncertain Data
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
Lyublena Antova, Thomas Jansen, Christoph Koch, Da...
VLDB
2005
ACM
125views Database» more  VLDB 2005»
15 years 3 months ago
Rewriting XPath Queries Using Materialized Views
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
Wanhong Xu, Z. Meral Özsoyoglu
ICDT
2005
ACM
102views Database» more  ICDT 2005»
15 years 3 months ago
Selecting and Using Views to Compute Aggregate Queries (Extended Abstract)
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
Foto N. Afrati, Rada Chirkova