291 search results - page 22 / 59 » Dynamic Memory Allocation for Large Query Execution |
103
click to vote
ICCS
2003
Springer
15 years 5 months ago
2003
Springer
Memory traces record the addresses touched by a program during its execution, enabling many useful investigations for understanding and predicting program performance. But complete...
96
Voted
SPAA
2009
ACM
16 years 8 days ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
106
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
174
click to vote
VLDB
2005
ACM
15 years 12 months ago
2005
ACM
Efficient querying of XML streams will be one of the fundamental features of next-generation information systems. In this paper we propose the TurboXPath path processor, which acce...
ADC
2007
Springer
15 years 6 months ago
2007
Springer
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...