Sciweavers

62 search results - page 6 / 13
» Memory-Adaptive External Sorting
Sort
View
DEBU
2010
128views more  DEBU 2010»
13 years 7 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
FOCS
2004
IEEE
14 years 1 months ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 10 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
DOLAP
2007
ACM
14 years 1 months ago
Optimal chunking of large multidimensional arrays for data warehousing
ss domain. Using this more abstract approach means that more data sources of varying types can be incorporated with less effort, and such heterogeneous data sources might be very r...
Ekow J. Otoo, Doron Rotem, Sridhar Seshadri
EDBT
2010
ACM
122views Database» more  EDBT 2010»
14 years 4 months ago
Self-selecting, self-tuning, incrementally optimized indexes
: © Self-selecting, self-tuning, incrementally optimized indexes Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-24 database index, adaptive, autonomic, query execution In a re...
Goetz Graefe, Harumi A. Kuno