Sciweavers

1007 search results - page 48 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
DOLAP
2005
ACM
15 years 4 months ago
Parallel querying of ROLAP cubes in the presence of hierarchies
Online Analytical Processing is a powerful framework for the analysis of organizational data. OLAP is often supported by a logical structure known as a data cube, a multidimension...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl...
ICDE
2009
IEEE
143views Database» more  ICDE 2009»
15 years 9 months ago
Supporting Generic Cost Models for Wide-Area Stream Processing
— Existing stream processing systems are optimized for a specific metric, which may limit their applicability to diverse applications and environments. This paper presents XFlow...
Olga Papaemmanouil, Ugur Çetintemel, John J...
152
Voted
HPDC
2007
IEEE
15 years 8 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
157
Voted
IPPS
1997
IEEE
15 years 6 months ago
Optimizing Parallel Bitonic Sort
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorti...
Mihai F. Ionescu
DATESO
2008
131views Database» more  DATESO 2008»
15 years 3 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca