Sciweavers

703 search results - page 55 / 141
» Using Cases Utility for Heuristic Planning Improvement
Sort
View
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
12 years 11 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
PLDI
2005
ACM
14 years 1 months ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve
ICPP
2009
IEEE
14 years 2 months ago
Improving Resource Availability by Relaxing Network Allocation Constraints on Blue Gene/P
— High-end computing (HEC) systems have passed the petaflop barrier and continue to move toward the next frontier of exascale computing. As companies and research institutes con...
Narayan Desai, Darius Buntinas, Daniel Buettner, P...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 2 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
ALGORITHMICA
2000
80views more  ALGORITHMICA 2000»
13 years 7 months ago
Geometric Eccentricity and the Complexity of Manipulation Plans
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
A. Frank van der Stappen, Kenneth Y. Goldberg