80 search results - page 7 / 16 » Map-reduce-merge: simplified relational data processing on l... |
103
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
BMCBI
2005
14 years 11 months ago
2005
Background: The most common method of identifying groups of functionally related genes in microarray data is to apply a clustering algorithm. However, it is impossible to determin...
107
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: The extended use of microarray technologies has enabled the generation and accumulation of gene expression datasets that contain expression levels of thousands of gene...
185
click to vote
ICDE
2002
IEEE
16 years 29 days ago
2002
IEEE
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
188
click to vote
SIGMOD
2005
ACM
15 years 11 months ago
2005
ACM
Peer-to-peer (p2p) systems are attracting increasing attention as an efficient means of sharing data among large, diverse and dynamic sets of users. The widespread use of XML as a...