Sciweavers

37 search results - page 5 / 8
» Sorting hierarchical data in external memory for archiving
Sort
View
IPPS
1999
IEEE
14 years 2 days 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...
DEBU
2010
128views more  DEBU 2010»
13 years 5 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...
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 8 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
KDD
1997
ACM
92views Data Mining» more  KDD 1997»
13 years 12 months ago
Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation
This paper describes how to increase the efficiency of inductive data mining algorithms by replacing the central matching operation with a marker propagation technique. Breadth-fi...
John M. Aronis, Foster J. Provost
VISUALIZATION
2003
IEEE
14 years 1 months ago
Hierarchical Splatting of Scattered Data
Numerical particle simulations and astronomical observations create huge data sets containing uncorrelated 3D points of varying size. These data sets cannot be visualized interact...
Matthias Hopf, Thomas Ertl