Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Searching distributed collections with inference networks
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Min-wise independent permutations (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Combining fuzzy information from multiple systems
Journal of Computer and System Sciences
A decision-theoretic approach to database selection in networked IR
ACM Transactions on Information Systems (TOIS)
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Min-wise independent permutations
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
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
IEEE/ACM Transactions on Networking (TON)
Improving Data Access in P2P Systems
IEEE Internet Computing
UCFS-A Novel User-Space, High Performance, Customized File System for Web Proxy Servers
IEEE Transactions on Computers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
On the Resemblance and Containment of Documents
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Evaluating different methods of estimating retrieval quality for resource selection
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
SETS: search enhanced by topic segmentation
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Content-based retrieval in hybrid peer-to-peer networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
Proceedings of the 13th international conference on World Wide Web
Semantic Small World: An Overlay Network for Peer-to-Peer Search
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Informed content delivery across adaptive overlay networks
IEEE/ACM Transactions on Networking (TON)
Improving collection selection with overlap awareness in P2P search engines
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
MINERVA: collaborative P2P search
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Database selection and result merging in P2P web search
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
IQN routing: integrating quality and novelty in P2P querying and ranking
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
P2P authority analysis for social communities
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Semantic peer, here are the neighbors you want!
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Building a PDMS infrastructure for XML data sharing with SUNRISE
DataX '08 Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web
Information Retrieval and Filtering over Self-organising Digital Libraries
ECDL '08 Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries
A measure for cluster cohesion in semantic overlay networks
Proceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
Context information exchange and sharing in a peer-to-peer community: a video annotation scenario
Proceedings of the 27th ACM international conference on Design of communication
Rewiring strategies for semantic overlay networks
Distributed and Parallel Databases
iCluster: a self-organizing overlay network for P2P information retrieval
ECIR'08 Proceedings of the IR research, 30th European conference on Advances in information retrieval
Affinity P2P: A self-organizing content-based locality-aware collaborative peer-to-peer network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Decentralized and autonomous content overlay networking (DACON) with WiFi access points
Proceedings of the 5th International Conference on Future Internet Technologies
A peer-to-peer recommender system for self-emerging user communities based on gossip overlays
Journal of Computer and System Sciences
The cloud is not 'there', we are the cloud!
International Journal of Web and Grid Services
Hi-index | 0.00 |
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independently crawling the Web. A challenging task in such systems is to efficiently route user queries to peers that can deliver high quality results and be able to rank these returned results, thus satisfying the users' information need. However, the problem inherent with this scenario is selecting a few promising peers out of an a priori unlimited number of peers. In recent research a rather strict notion of semantic overlay networks has been established. In most approaches, peers are connected to other peers based on a rigid semantic profile by clustering them based on their contents. In contrast, our strategy follows the spirit of peer autonomy and creates semantic overlay networks based on the notion of ''peer-to-peer dating''. Peers are free to decide which connections they create and which they want to avoid based on various usefulness estimators. The proposed techniques can be easily integrated into existing systems as they require only small additional bandwidth consumption as most messages can be piggybacked onto established communication. We show how we can greatly benefit from these additional semantic relations during query routing in search engines, such as Minerva, and in the JXP algorithm, which computes the PageRank authority measure in a completely decentralized manner.