146 search results - page 11 / 30 » On efficient top-k query processing in highly distributed en... |
194
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
108
click to vote
PARLE
1993
15 years 3 months ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
102
click to vote
SIGMOD
2002
ACM
15 years 11 months ago
2002
ACM
The widespread distribution and availability of smallscale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such examp...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on qu...
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...