Sciweavers

80 search results - page 1 / 16
» Map-reduce-merge: simplified relational data processing on l...
Sort
View
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
14 years 4 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
OSDI
2004
ACM
14 years 4 months ago
MapReduce: Simplified Data Processing on Large Clusters
MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to ge...
Jeffrey Dean, Sanjay Ghemawat
PAMI
2010
164views more  PAMI 2010»
13 years 2 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
IADIS
2004
13 years 6 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
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 8 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang