Sciweavers

62 search results - page 2 / 13
» Memory-Adaptive External Sorting
Sort
View
VLDB
1997
ACM
126views Database» more  VLDB 1997»
13 years 9 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
PVLDB
2010
112views more  PVLDB 2010»
13 years 3 months ago
Two-way Replacement Selection
The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacemen...
Xavier Martinez-Palau, David Dominguez-Sal, Josep-...
BNCOD
2003
104views Database» more  BNCOD 2003»
13 years 6 months ago
External Sorting with On-the-Fly Compression
Evaluating a query can involve manipulation of large volumes of temporary data. When the volume of data becomes too great, activities such as joins and sorting must use disk, and ...
John Yiannis, Justin Zobel
DMSN
2009
ACM
13 years 11 months ago
FSort: external sorting on flash-based sensor devices
In long-term deployments of Wireless Sensor Networks, it is often more efficient to store sensor readings locally at each device and transmit those readings to the user only when ...
Panayiotis Andreou, Orestis Spanos, Demetrios Zein...
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