Sciweavers

471 search results - page 9 / 95
» MapReduce: Simplified Data Processing on Large Clusters
Sort
View
ISPASS
2007
IEEE
14 years 1 months ago
Simplifying Active Memory Clusters by Leveraging Directory Protocol Threads
Address re-mapping techniques in so-called active memory systems have been shown to dramatically increase the performance of applications with poor cache and/or communication beha...
Dhiraj D. Kalamkar, Mainak Chaudhuri, Mark Heinric...
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 11 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
13 years 12 months ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
Zhexue Huang
IADIS
2004
13 years 9 months ago
Simplifying the Clickstream Retrieval Using Weblogger Tool
Data Webhouses are used to retain all the information related to web user's behavior within a web site, working as a shared repository of business data. The advent of e-busin...
João Silva, João Bernardino
EUROSYS
2011
ACM
12 years 11 months ago
Scarlett: coping with skewed content popularity in mapreduce clusters
To improve data availability and resilience MapReduce frameworks use file systems that replicate data uniformly. However, analysis of job logs from a large production cluster show...
Ganesh Ananthanarayanan, Sameer Agarwal, Srikanth ...