Sciweavers

168 search results - page 21 / 34
» Anytime Exploratory Data Analysis for Massive Data Sets
Sort
View
JCB
2000
137views more  JCB 2000»
15 years 5 months ago
NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees
Large scale gene duplication is a major force driving the evolution of genetic functional innovation. Whole genome duplications are widely believed to have played an important rol...
Kevin Chen, Dannie Durand, Martin Farach-Colton
TC
2008
15 years 5 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
VLDB
2004
ACM
111views Database» more  VLDB 2004»
15 years 11 months ago
Technology Challenges in a Data Warehouse
This presentation will discuss several database technology challenges that are faced when building a data warehouse. It will touch on the challenges posed by high capacity drives ...
Ramesh Bhashyam
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
15 years 11 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
PPOPP
2010
ACM
16 years 3 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...