Sciweavers

146 search results - page 7 / 30
» On efficient top-k query processing in highly distributed en...
Sort
View
NPC
2004
Springer
14 years 1 months ago
Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...
HPDC
1998
IEEE
13 years 12 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
14 years 9 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...
GRID
2006
Springer
13 years 7 months ago
Snapshot Processing in Streaming Environments
Monitoring and correlation of streaming data from multiple sources is becoming increasingly important in many application areas. Example applications include automated commodities...
Daniel M. Zimmerman, K. Mani Chandy
CCGRID
2009
IEEE
13 years 11 months ago
Hierarchical Caches for Grid Workflows
From personal software to advanced systems, caching mechanisms have steadfastly been a ubiquitous means for reducing workloads. It is no surprise, then, that under the grid and clu...
David Chiu, Gagan Agrawal