Sciweavers

1405 search results - page 259 / 281
» Popularity at Minimum Cost
Sort
View
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 10 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
SIGMOD
2002
ACM
108views Database» more  SIGMOD 2002»
14 years 10 months ago
An adaptive peer-to-peer network for distributed caching of OLAP results
Peer-to-Peer (P2P) systems are becoming increasingly popular as they enable users to exchange digital information by participating in complex networks. Such systems are inexpensiv...
Panos Kalnis, Wee Siong Ng, Beng Chin Ooi, Dimitri...
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 10 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
ICWS
2009
IEEE
14 years 7 months ago
MACE: A Dynamic Caching Framework for Mashups
—The recent surge of popularity has established Mashups as an important category of Web 2.0 applications. Mashups are essentially Web services that are often created by end-users...
Osama Al-Haj Hassan, Lakshmish Ramaswamy, John A. ...
EUROSYS
2008
ACM
14 years 6 months ago
Modeling viral economies for digital media
Financial efficiency is the premier performance measure for most systems. Existing economic ecosystems for distribution of multimedia leave a lot to be desired: client-server plat...
Shan He, Renan G. Cattelan, Darko Kirovski