Sciweavers

20 search results - page 3 / 4
» On Disk Allocation of Intermediate Query Results in Parallel...
Sort
View
NIS
1998
131views more  NIS 1998»
13 years 5 months ago
Dynamic Memory Allocation for Large Query Execution
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
Luc Bouganim, Olga Kapitskaia, Patrick Valduriez
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 7 months ago
Adaptive Segmentation for Scientific Databases
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
Milena Ivanova, Martin L. Kersten, Niels Nes
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 5 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
SIGMOD
1996
ACM
133views Database» more  SIGMOD 1996»
13 years 10 months ago
Multi-dimensional Resource Scheduling for Parallel Queries
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
Minos N. Garofalakis, Yannis E. Ioannidis
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
14 years 6 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...