Sciweavers

56 search results - page 7 / 12
» On Bulk Loading TPR-Tree
Sort
View
BTW
2003
Springer
76views Database» more  BTW 2003»
14 years 1 months ago
Partitioned B-trees - a user's guide
: A recent article introduced partitioned B-trees, in which partitions are defined not in the catalogs but by distinct values in an artificial leading key column. As there usually ...
Goetz Graefe
ISCC
2003
IEEE
101views Communications» more  ISCC 2003»
14 years 1 months ago
Aggregate Based Resource Allocation With Rerouting
This paper studies the effect of rerouting for augmenting aggregate based resource allocation in the trade-off between overhead and utilization. Aggregation is a common approach t...
Coskun Cetinkaya, Mun Choon Chan, Yow-Jian Lin
PPAM
2005
Springer
14 years 1 months ago
A Web Computing Environment for Parallel Algorithms in Java
We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed ove...
Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer ...
JNW
2008
81views more  JNW 2008»
13 years 7 months ago
Using Rerouting to Improve Aggregate Based Resource Allocation
This paper studies the effect of rerouting for augmenting aggregate based resource allocation in the trade-off between overhead and utilization. Aggregation is a common approach us...
Ali E. Helvaci, Coskun Cetinkaya, Mehmet Bayram Yi...
IS
2008
13 years 7 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth