Sciweavers

559 search results - page 9 / 112
» Algorithms and Data Structures for External Memory
Sort
View
WEA
2010
Springer
208views Algorithms» more  WEA 2010»
14 years 7 months ago
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries
Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuse...
DEBU
2010
128views more  DEBU 2010»
14 years 6 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...
70
Voted
DMSN
2009
ACM
15 years 4 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...
SIGCSE
1999
ACM
93views Education» more  SIGCSE 1999»
15 years 1 months ago
Patterns for decoupling data structures and algorithms
In order to build a data structure that is extensible and reusable, it is necessary to decouple the intrinsic and primitive behavior of the structure from the application specific...
Dung Zung Nguyen, Stephen B. Wong
IPPS
1999
IEEE
15 years 1 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...