Sciweavers

2313 search results - page 112 / 463
» On Heuristic Time Hierarchies
Sort
View
IS
2010
15 years 4 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
CLUSTER
2000
IEEE
15 years 6 months ago
Block-cyclic redistribution over heterogeneous networks
Clusters of workstations and networked parallel computing systems are emerging as promising computational platforms for HPC applications. The processors in such systems are typica...
Prashanth B. Bhat, Viktor K. Prasanna, Cauligi S. ...
EMSOFT
2010
Springer
15 years 4 months ago
Optimal WCET-aware code selection for scratchpad memory
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
Hui Wu, Jingling Xue, Sridevan Parameswaran
DOLAP
2003
ACM
15 years 11 months ago
Hierarchical dwarfs for the rollup cube
The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compress...
Yannis Sismanis, Antonios Deligiannakis, Yannis Ko...
USENIX
1993
15 years 7 months ago
HighLight: Using a Log-structured File System for Tertiary Storage Management
Robotic storage devices offer huge storage capacity at a low cost per byte, but with large access times. Integrating these devices into the storage hierarchy presents a challenge ...
John T. Kohl, Carl Staelin, Michael Stonebraker