Database selection for processing k nearest neighbors queries in distributed environments
Proceedings of the 1st ACM/IEEE-CS joint conference on Digital libraries
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed top-N query processing with possibly uncooperative local systems
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Locating data sources in large distributed systems
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Hi-index | 0.00 |
This paper proposes a query routing infrastructure that aims at the Web text information retrieval. The routing information is distributed in each query routing node, and needs no central infrastructure, so it can be used in large distributed system to determine which node need to be queried to achieve the function of query routing in semantic network. At the same time, this paper proposes the concept of preference circle, which organizes Web text data sources efficiently , so querying the information for routing become simpler and easier for maintenance, which improves the efficiency of query routing. In addition, we demonstrate the advantages of our system in work load balancing and the completeness of result of query etc.