Sciweavers

679 search results - page 60 / 136
» Scaling Clustering Algorithms to Large Databases
Sort
View
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 8 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
BMCBI
2010
101views more  BMCBI 2010»
15 years 1 months ago
Enrichment of homologs in insignificant BLAST hits by co-complex network alignment
Background: Homology is a crucial concept in comparative genomics. The algorithm probably most widely used for homology detection in comparative genomics, is BLAST. Usually a stri...
Like Fokkens, Sandra M. C. Botelho, Jos Boekhorst,...
DAGM
1999
Springer
15 years 6 months ago
Knowledge Discovery in Spatial Databases
Both, the number and the size of spatial databases, such as geographic or medical databases, are rapidly growing because of the large amount of data obtained from satellite images,...
Martin Ester, Hans-Peter Kriegel, Jörg Sander
HIPC
2009
Springer
14 years 11 months ago
Fast checkpointing by Write Aggregation with Dynamic Buffer and Interleaving on multicore architecture
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
Xiangyong Ouyang, Karthik Gopalakrishnan, Tejus Ga...
205
Voted
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
16 years 1 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu