Sciweavers

1007 search results - page 72 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
IPPS
2009
IEEE
15 years 9 months ago
Parallel solvers for dense linear systems for heterogeneous computational clusters
This paper describes the design and the implementation of parallel routines in the Heterogeneous ScaLAPACK library that solve a dense system of linear equations. This library is w...
Ravi Reddy Manumachu, Alexey L. Lastovetsky, Pedro...
PODS
2008
ACM
221views Database» more  PODS 2008»
16 years 3 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
CORR
2004
Springer
82views Education» more  CORR 2004»
15 years 2 months ago
Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams
We introduce an extension of the XQuery language, FluX, that supports event-based query processing and the conscious handling of main memory buffers. Purely event-based queries of...
Christoph Koch, Stefanie Scherzinger, Nicole Schwe...
ISPAN
1997
IEEE
15 years 7 months ago
A method for estimating optimal unrolling times for nested loops
Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not...
Akira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa
FOIKS
2004
Springer
15 years 8 months ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo