Sciweavers

291 search results - page 15 / 59
» Dynamic Memory Allocation for Large Query Execution
Sort
View
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 3 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...
DEBU
2000
118views more  DEBU 2000»
14 years 11 months ago
A Dynamic Query Processing Architecture for Data Integration Systems
Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the mem...
Luc Bouganim, Françoise Fabret, C. Mohan, P...
CSMR
2010
IEEE
14 years 6 months ago
Utilizing Debug Information to Compact Loops in Large Program Traces
In recent years, dynamic program execution traces have been utilized in an attempt to better understand the runtime behavior of various software systems. The unfortunate reality of...
Del Myers, Margaret-Anne D. Storey, Martin Salois
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 12 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
MICRO
1998
IEEE
144views Hardware» more  MICRO 1998»
15 years 4 months ago
Analyzing the Working Set Characteristics of Branch Execution
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
Sangwook P. Kim, Gary S. Tyson