Results 1 - 10 of 1,736

Semantic Query Routing Experiences in a PDMS

by Federica M, Riccardo Martoglia, Wilma Penzo, Simona Sassatelli
"... Abstract — Querying a PDMS means either flooding the network with messages to all peers or taking advantage of a routing mechanism to reformulate a query only on the best peers selected according to some given criteria. As reformulations may lead to semantic approximations, we deem that such approxi ..."
Abstract - Add to MetaCart
that such approximations can be exploited for locating the semantically best directions to forward a query to. In this paper, we present our experiences in devising and testing a mechanism for effective query routing in a PDMS. In particular, we describe a distributed index mechanism where each peer is provided with a

A Scalable Location Service for Geographic Ad Hoc Routing,”

by Jinyang Li , John Jannotti , Douglas S J De Couto , David R Karger , Robert Morris , Jinyang Li , John Jannotti , Alfred P Sloane , Foundation Fellowship , Lucille Packard , Foundations Fellowship , Jinyang 46 , John Li , Jannotti - Proceedings of ACM/IEEE MobiCom , 2000
"... Abstract. GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work. GLS is decentralized and runs on the mobile node ..."
Abstract - Cited by 769 (17 self) - Add to MetaCart
of node identifiers and a predefined geographic hierarchy. Queries for a mobile node's location also use the predefined identifier ordering and spatial hierarchy to find a location server for that node. Experiments using the ns simulator for up to 600 mobile nodes show that the storage and bandwidth

Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility

by Antony Rowstron, Peter Druschel , 2001
"... This paper presents and evaluates the storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility. PAST is based on a self-organizing, Internetbased overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache a ..."
Abstract - Cited by 803 (23 self) - Add to MetaCart
This paper presents and evaluates the storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility. PAST is based on a self-organizing, Internetbased overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache

Understanding Normal and Impaired Word Reading: Computational Principles in Quasi-Regular Domains

by David C. Plaut , James L. McClelland, Mark S. Seidenberg, Karalyn Patterson - PSYCHOLOGICAL REVIEW , 1996
"... We develop a connectionist approach to processing in quasi-regular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic and phono ..."
Abstract - Cited by 613 (94 self) - Add to MetaCart
division-of-labor between semantic and phonological processes. Such a view is consistent with the more general Seidenberg and McClelland framework and has some similarities with---but also important differences from---the standard dual-route account.

Enhanced hypertext categorization using hyperlinks

by Soumen Chakrabarti, Byron Dom, Piotr Indyk , 1998
"... A major challenge in indexing unstructured hypertext databases is to automatically extract meta-data that enables structured search using topic taxonomies, circumvents keyword ambiguity, and improves the quality of search and profile-based routing and filtering. Therefore, an accurate classifier is ..."
Abstract - Cited by 453 (8 self) - Add to MetaCart
A major challenge in indexing unstructured hypertext databases is to automatically extract meta-data that enables structured search using topic taxonomies, circumvents keyword ambiguity, and improves the quality of search and profile-based routing and filtering. Therefore, an accurate classifier

SRI: Exploiting Semantic Information for Effective Query Routing in a PDMS

by Federica Mandreoli , Riccardo Martoglia, Simona Sassatelli, Wilma Penzo , 2006
"... The huge amount of data available from Internet information sources has focused much attention on the sharing of distributed information through Peer Data Management Systems (PDMSs). In a PDMS, peers have a schema on their local data, and they are related each other through semantic mappings that ca ..."
Abstract - Cited by 11 (8 self) - Add to MetaCart
that can be defined between their own schemas. Querying a PDMS means either flooding the network with messages to all peers or take advantage of a routing mechanism to reformulate a query only on the best peers selected according to some given criteria. As reformulations may lead to semantic approximations

Mercury: Supporting scalable multi-attribute range queries

by Ashwin R. Bharambe, Mukesh Agrawal, Srinivasan Seshan - In SIGCOMM , 2004
"... This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute rangebased searches. Mercury differs from previous range-based query systems in that it supports multiple attributes as well as performs explicit load balancing. Efficient routing and load balancing are imp ..."
Abstract - Cited by 339 (6 self) - Add to MetaCart
This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute rangebased searches. Mercury differs from previous range-based query systems in that it supports multiple attributes as well as performs explicit load balancing. Efficient routing and load balancing

Using Semantic Mappings for Query Routing in a PDMS Environment (Extended Abstract) ⋆

by Federica M, Riccardo Martoglia, Wilma Penzo, Simona Sassatelli, Paolo Tiberio
"... Abstract. In this paper we present the current achievement of our research activity in the WISDOM project, whose aim is the definition of intelligent techniques enabling effective and efficient information search in a distributed and decentralized PDMS scenario. We focus on the query routing problem ..."
Abstract - Add to MetaCart
Abstract. In this paper we present the current achievement of our research activity in the WISDOM project, whose aim is the definition of intelligent techniques enabling effective and efficient information search in a distributed and decentralized PDMS scenario. We focus on the query routing

SUNRISE: Exploring PDMS Networks with Semantic Routing Indexes

by Federica Mandreoli, Riccardo Martoglia, Wilma Penzo, Simona Sassatelli, Giorgio Villani , 2007
"... We demonstrate SUNRISE 1, a complete infrastructure supporting the construction of a PDMS semantic layer and providing a series of techniques that can be used for an effective and efficient exploration of a semantic network, for instance in a query answering setting. ..."
Abstract - Add to MetaCart
We demonstrate SUNRISE 1, a complete infrastructure supporting the construction of a PDMS semantic layer and providing a series of techniques that can be used for an effective and efficient exploration of a semantic network, for instance in a query answering setting.

Enriching Query Routing Processes in PDMS with Semantic Information and Information Quality

by Crishane Freire, Damires Souza, Bernadette F. Lóscio, Ana Carolina Salgado
"... Abstract. Query answering has been addressed as a key issue in dynamic distributed environments such as Peer Data Management Systems (PDMS). An important step in this process regards query routing, i.e., how to find peers (data sources) that are most likely to provide matching results according to t ..."
Abstract - Add to MetaCart
Abstract. Query answering has been addressed as a key issue in dynamic distributed environments such as Peer Data Management Systems (PDMS). An important step in this process regards query routing, i.e., how to find peers (data sources) that are most likely to provide matching results according
Results 1 - 10 of 1,736