Sciweavers

42 search results - page 1 / 9
» Tradeoffs in Scalable Data Routing for Deduplication Cluster...
Sort
View
FAST
2011
12 years 8 months ago
Tradeoffs in Scalable Data Routing for Deduplication Clusters
As data have been growing rapidly in data centers, deduplication storage systems continuously face challenges in providing the corresponding throughputs and capacities necessary t...
Wei Dong, Fred Douglis, Kai Li, R. Hugo Patterson,...
WSDM
2010
ACM
204views Data Mining» more  WSDM 2010»
13 years 11 months ago
Learning URL patterns for webpage de-duplication
Presence of duplicate documents in the World Wide Web adversely affects crawling, indexing and relevance, which are the core building blocks of web search. In this paper, we pres...
Hema Swetha Koppula, Krishna P. Leela, Amit Agarwa...
EDBT
2004
ACM
192views Database» more  EDBT 2004»
14 years 4 months ago
LIMBO: Scalable Clustering of Categorical Data
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...
Periklis Andritsos, Panayiotis Tsaparas, Ren&eacut...
ICMCS
1996
IEEE
104views Multimedia» more  ICMCS 1996»
13 years 8 months ago
Design and Performance Tradeoffs in Clustered Video Servers
In this paper, we investigate the suitability of clustered architectures for designing scalable multimedia servers. Specifically, we evaluate the effects of: (i) architectural des...
Renu Tewari, Rajat Mukherjee, Daniel M. Dias, Harr...
EDBT
2008
ACM
154views Database» more  EDBT 2008»
14 years 4 months ago
Data utility and privacy protection trade-off in k-anonymisation
K-anonymisation is an approach to protecting privacy contained within a dataset. A good k-anonymisation algorithm should anonymise a dataset in such a way that private information...
Grigorios Loukides, Jianhua Shao