Sciweavers

308 search results - page 57 / 62
» Sharing aggregate computation for distributed queries
Sort
View
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
15 years 6 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
ISPA
2004
Springer
15 years 2 months ago
A Congestion-Aware Search Protocol for Unstructured Peer-to-Peer Networks
Peer-to-Peer (P2P) file sharing is the hottest, fastest growing application on the Internet. When designing Gnutella-like applications, the most important consideration is the sca...
Kin Wah Kwong, Danny H. K. Tsang
CIDR
2011
274views Algorithms» more  CIDR 2011»
14 years 29 days ago
Cloud Resource Orchestration: A Data-Centric Approach
Cloud computing provides users near instant access to seemingly unlimited resources, and provides service providers the opportunity to deploy complex information technology infras...
Yun Mao, Changbin Liu, Jacobus E. van der Merwe, M...
IADIS
2003
14 years 10 months ago
Developing Seamless Discovery of Scholarly and Trade Journal Resources via OAI and RSS
The usefulness of online information such as e-publishing and timely notification on the latest scientific or professional news has been widely accepted. However, access to such v...
Santiago Chumbe, Roddy MacLeod
PVLDB
2008
116views more  PVLDB 2008»
14 years 9 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan