Sciweavers

6004 search results - page 437 / 1201
» Parallelizing query optimization
Sort
View
CLUSTER
2005
IEEE
16 years 26 days ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
ECCC
2010
122views more  ECCC 2010»
15 years 5 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
199
Voted
IPPS
2009
IEEE
16 years 1 months ago
Flexible pipelining design for recursive variable expansion
Many image and signal processing kernels can be optimized for performance consuming a reasonable area by doing loops parallelization with extensive use of pipelining. This paper p...
Zubair Nawaz, Thomas Marconi, Koen Bertels, Todor ...
CCGRID
2006
IEEE
16 years 1 months ago
Analysis of Query Matching Criteria and Resource Monitoring Models for Grid Application Scheduling
Making effective use of computational Grids requires scheduling Grid applications onto resources that best match them. Resource-related state (e.g., load, availability, and locati...
Ronak Desai, Sameer Tilak, Bhavin Gandhi, Michael ...
ICDE
2008
IEEE
167views Database» more  ICDE 2008»
16 years 8 months ago
Towards Declarative Queries on Adaptive Data Structures
In this work we look at combining emerging technologies in programming languages with traditional query processing techniques to provide support for efficient execution of declarat...
Nicolas Bruno, Pablo Castro