Results 1 - 10
of
46
Bookmark-driven query routing in peer-to-peer web search
- Proceedings of the SIGIR Workshop on Peer-to-Peer Information Retrieval. (2004) 46–57
, 2004
"... Abstract: We consider the problem of collaborative Web search and query routing strategies in a peer-to-peer (P2P) environment. In our architecture every peer has a full-fledged search engine with a (thematically focused) crawler and a local index whose contents may be tailored to the user’s specifi ..."
Abstract
-
Cited by 22 (12 self)
- Add to MetaCart
Abstract: We consider the problem of collaborative Web search and query routing strategies in a peer-to-peer (P2P) environment. In our architecture every peer has a full-fledged search engine with a (thematically focused) crawler and a local index whose contents may be tailored to the user’s specific interest profile. Peers are autonomous and post meta-information about their bookmarks and index lists to a global directory, which is efficiently implemented in a decentralized manner using Chordstyle distributed hash tables. A query posed by one peer is first evaluated locally; if the result is unsatisfactory the query is forwarded to selected peers. These peers are chosen based on a benefit/cost measure where benefit reflects the thematic similarity of peers ’ interest profiles, derived from bookmarks, and cost captures estimated peer load and response time. The meta-information that is needed for making these query routing decisions is efficiently looked up in the global directory; it can also be cached and proactively disseminated for higher availability and reduced network load. 1
User modeling for full-text federated search in peer-to-peer networks
- In Proceedings of the 29 th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
, 2006
"... User modeling for information retrieval has mostly been studied to improve the effectiveness of information access in centralized repositories. In this paper we explore user modeling in the context of full-text federated search in peer-to-peer networks. Our approach models a user’s persistent, long- ..."
Abstract
-
Cited by 21 (2 self)
- Add to MetaCart
(Show Context)
User modeling for information retrieval has mostly been studied to improve the effectiveness of information access in centralized repositories. In this paper we explore user modeling in the context of full-text federated search in peer-to-peer networks. Our approach models a user’s persistent, long-term interests based on past queries, and uses the model to improve search efficiency for future queries that represent interests similar to past queries. Our approach also enables queries representing a user’s transient, ad-hoc interests to be automatically recognized so that search for these queries can rely on a relatively large search radius to avoid sacrificing effectiveness for efficiency. Experimental results demonstrate that our approach can significantly improve the efficiency of full-text federated search without degrading its accuracy. Furthermore, the proposed approach does not require a large amount of training data, and is robust to a range of parameter values.
Runtime Semantic Interoperability for Gathering Ontology-based Network Context
- In Proc. 10 th IFIP/IEEE Network Operations and Management Symposium (NOMS’2006
, 2006
"... Abstract—The trends for pushing more operational intelligence towards network elements to achieve more context-aware and self-managing behavior often requires elements to gather network knowledge without necessarily binding explicitly to all of the potential sources of that knowledge. Though event-b ..."
Abstract
-
Cited by 18 (10 self)
- Add to MetaCart
(Show Context)
Abstract—The trends for pushing more operational intelligence towards network elements to achieve more context-aware and self-managing behavior often requires elements to gather network knowledge without necessarily binding explicitly to all of the potential sources of that knowledge. Though event-based publish-subscribe models allow efficient distribution of knowledge where the event types are known globally, dynamic service chains, ad hoc networks and pervasive computing application all introduce a more fluid and heterogeneous range of context knowledge. This requires some runtime translation of knowledge between sources and sinks of network context. This paper builds on existing mapping techniques that use ontological forms of existing management information models to examine the extent to which these can be employed for runtime semantic interoperability for network knowledge. It presents results in developing a management knowledge delivery framework based on existing models and platforms, but which offers a more decentralized knowledge exchange mechanism.
The MINERVA project: Database selection in the context of P2P search
- IN: BTW 2005
, 2005
"... This paper presents the MINERVA project that protoypes a distributed search engine based on P2P techniques. MINERVA is layered on top of a Chord-style overlay network and uses a powerful crawling, indexing, and search engine on every autonomous peer. We formalize our system model and identify the pr ..."
Abstract
-
Cited by 17 (11 self)
- Add to MetaCart
This paper presents the MINERVA project that protoypes a distributed search engine based on P2P techniques. MINERVA is layered on top of a Chord-style overlay network and uses a powerful crawling, indexing, and search engine on every autonomous peer. We formalize our system model and identify the problem of efficiently selecting promising peers for a query as a pivotal issue. We revisit existing ap-proaches to the database selection problem and adapt them to our system environment. Measurements are performed to compare different selection strategies using real-world data. The experiments show significant performance differences between the strategies and prove the importance of a judicious peer selection strategy. The experiments also present first evidence that a small number of carefully selected peers already provide the vast majority of all relevant results.
Towards a Managed Extensible Control Plane for Knowledge-Based Networking
- Department of Computer Science, Trinity College Dublin
, 2006
"... Abstract — This paper proposes an open, extensible control plane for a global event service, based on semantically rich messages. This is based on the novel application of control plane separation and semantic-based matching to Content-Based Networks. Here we evaluate the performance issues involved ..."
Abstract
-
Cited by 15 (10 self)
- Add to MetaCart
(Show Context)
Abstract — This paper proposes an open, extensible control plane for a global event service, based on semantically rich messages. This is based on the novel application of control plane separation and semantic-based matching to Content-Based Networks. Here we evaluate the performance issues involved in attempting to perform ontology-based reasoning for content-based routing. This provides us with the motivation to explore peer-clustering techniques to achieve efficient aggregation of semantic queries. The clustering of super-peers using decentralized policy engineering will deliver the incremental deployment of new peer-clustering strategies. 1.
On using histograms as routing indexes in peer-to-peer systems
- DBISP2P, volume 3367 of LNCS
, 2004
"... Abstract. Peer-to-peer systems offer an efficient means for sharing data among autonomous nodes. A central issue is locating the nodes with data matching a user query. A decentralized solution to this problem is based on using routing indexes which are data structures that describe the content of ne ..."
Abstract
-
Cited by 15 (1 self)
- Add to MetaCart
(Show Context)
Abstract. Peer-to-peer systems offer an efficient means for sharing data among autonomous nodes. A central issue is locating the nodes with data matching a user query. A decentralized solution to this problem is based on using routing indexes which are data structures that describe the content of neighboring nodes. Each node uses its routing index to route a query towards those of its neighbors that provide the largest number of results. We consider using histograms as routing indexes. We describe a decentralized procedure for clustering similar nodes based on histograms. Similarity between nodes is defined based on the set of queries they match and related with the distance between their histograms. Our experimental results show that using histograms to cluster similar nodes and to route queries increases the number of results returned for a given number of nodes visited. 1
Two-level semantic caching scheme for super-peer networks
- In IEEE Tenth International Workshop on Web Content Caching and Distribution, Sophia Antipolis
, 2005
"... Abstract. Some recent measurement studies of file-sharing peer-to-peer networks have demonstrated the presence of semantic proximity between peers and between shared files. This observation may be used for improving the performance of searching by introducing semantic caches. One type of such caches ..."
Abstract
-
Cited by 14 (4 self)
- Add to MetaCart
(Show Context)
Abstract. Some recent measurement studies of file-sharing peer-to-peer networks have demonstrated the presence of semantic proximity between peers and between shared files. This observation may be used for improving the performance of searching by introducing semantic caches. One type of such caches links peers that are interested in similar files. The query routing mechanism uses this information by forwarding queries first to peers which are semantically close. The second type of semantic caches groups similar content instead of similar nodes. In this paper we show how to combine both methods by introducing a two-level caching infrastructure based on super-peers. The super-peers in our system cache pointers to files recently requested by their client peers. The client peers, on the other hand, constantly look for the super-peers that are most suitable for them. We propose a simple, yet powerful cache management policy that guarantees high cache hit ratios also for the less popular files. Further, we discuss the design choices and optimizations of the presented model. Finally, we evaluate our system versus the symmetric network that uses only one level of semantic caches. 1
Benchmarking Knowledge-based Context Delivery Systems", to appear
- in Proceedings of the International Conference on Autonomic and Autonomous Systems (ICAS 06), Silicon
, 2006
"... As context-aware systems become more widespread and mobile there is an increasing need for a common distributed event platform for gathering context information and delivering to context-aware applications. The likely heterogeneity across the body of context information can be addressed using runtim ..."
Abstract
-
Cited by 10 (9 self)
- Add to MetaCart
(Show Context)
As context-aware systems become more widespread and mobile there is an increasing need for a common distributed event platform for gathering context information and delivering to context-aware applications. The likely heterogeneity across the body of context information can be addressed using runtime reasoning over ontology-based context models. However, existing knowledge-based reasoning is not typically optimised for real-time operation so its inclusion in any context delivery platform needs to be carefully evaluated from a performance perspective. In this paper we propose a benchmark for knowledgebased context delivery platforms and in particular examine suitable knowledge benchmarks for assessing the ability of platforms to deal with semantic interoperability. 1.
Extending Siena to support more expressive and flexible subscriptions
- in The 2nd International Conference on Distributed Event-Based Systems (DEBS 2008
, 2008
"... This paper defines and discusses the implementation of two novel extensions to the Siena Content-based Network (CBN) to extend it to become a Knowledge-based Network (KBN) thereby increasing the expressiveness and flexibility of its publications and subscription. One extension provides ontological c ..."
Abstract
-
Cited by 8 (4 self)
- Add to MetaCart
(Show Context)
This paper defines and discusses the implementation of two novel extensions to the Siena Content-based Network (CBN) to extend it to become a Knowledge-based Network (KBN) thereby increasing the expressiveness and flexibility of its publications and subscription. One extension provides ontological concepts as an additional message attribute type, onto which subsumption relationships, equivalence, type queries and arbitrary ontological subscription filters can be applied. The second extension provides for a bag type to be used that allows bag equivalence, sub-bag and super-bag relationships to be used in subscription filters, possibly composed with any of the Siena subscription operators or the ontological operators previously mentioned. The performance of this KBN implementation has also been explored. However, to maintain scalability and performance it is important that these extensions do not break Siena’s subscription aggregation algorithm. We also introduce the necessary covering relationships for the new types and operators and examine the subscription matching overhead resulting from these new types and operators.
Efficient data store discovery in a scientific P2P network
- PROC. OF THE WS ON SEMANTIC WEB TECHNOLOGIES FOR SEARCHING AND RETRIEVING SCIENTIFIC DATA, CEUR WS 83
, 2003
"... In this paper we propose to use schema-based peer-to-peer systems for the exchange of scienitific documents. Compared with recent file sharing networks highly domain-oriented scientific documents are shared in relatively small research communities with tight internal and only a few external connecti ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
In this paper we propose to use schema-based peer-to-peer systems for the exchange of scienitific documents. Compared with recent file sharing networks highly domain-oriented scientific documents are shared in relatively small research communities with tight internal and only a few external connections. The documents are annotated with small a but well-defined sets of metadata using standard taxonomies and are stored in many distributed, autonomous, heterogenous data repositories. As a recent development super-peer networks emerge improving the network performance by clustering peers at super-peers. By using Semantic Overlay Clusters (SOC) for clustering the super-peer networks we enable the creation of context-specific, logical views over the physical P2P network topology according to the research communities demands. SOCs define peer clusters according to the metadata description of peers and their contents. The respective clustering policy expresses the demand on the peers for a particular research context. In this paper we show how SOCs can be defined based on policies. We detail the definition of conditions that we use for our ECA-rule like policiy definition approach.
