Sciweavers

31 search results - page 6 / 7
» Compiling object-oriented data intensive applications
Sort
View
CCGRID
2001
IEEE
13 years 9 months ago
Parallel I/O Support for HPF on Clusters
Clusters of workstations are a popular alternative to integrated parallel systems designed and built by a vendor. Besides their huge cumulative processing power, they also provide...
Peter Brezany, Viera Sipková
DBPL
1991
Springer
66views Database» more  DBPL 1991»
13 years 8 months ago
Rationale and Design of BULK
BULK is a very-high-level persistent programming language and environment for prototyping and implementing database applications. BULK provides sets and sequences as primitive typ...
Steve Rozen, Dennis Shasha
EUROPAR
2001
Springer
13 years 9 months ago
An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
Sandra de F. Mendes Sampaio, Jim Smith, Norman W. ...
CORR
2012
Springer
281views Education» more  CORR 2012»
12 years 1 months ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
14 years 6 months ago
Put a Tree Pattern in Your Algebra
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
George A. Mihaila, Jérôme Simé...