1390 search results - page 86 / 278 » Self-Sizing of Clustered Databases |
CIKM
2006
Springer
14 years 27 days ago
2006
Springer
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Large, dynamic, and ad-hoc organizations must frequently initiate data integration and sharing efforts with insufficient awareness of how organizational data sources are related. ...
EDBT
2012
ACM
11 years 11 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Clustering ensembles combine different clustering solutions into a single robust and stable one. Most of existing methods become highly time-consuming when the data size turns to ...
CCGRID
2003
IEEE
14 years 2 months ago
2003
IEEE
Clusters are now composed of non-uniform nodes with different CPUs, disks or network cards so that customers can adapt the cluster configuration to the changing technologies and t...