Filters








215 Hits in 3.3 sec

Semantic measures as information quality criteria for query routing processes

Crishane Freire, Bruno F.F. Souza, Ana Carolina Salgado, Damires Souza, Maria C.M. Batista
2013 International Journal of Business Intelligence and Data Mining  
Query answering has been addressed as a key issue in distributed environments such as peer data management systems (PDMS).  ...  Moreover, it combines semantic information and IQ, by presenting a model, which is instantiated to illustrate how this proposal produces the semantic measures and enhances query routing processes.  ...  Furthermore, we propose a model, which combines semantic information and IQ as a means to produce semantic knowledge to be used in PDMS query routing processes.  ... 
doi:10.1504/ijbidm.2013.057745 fatcat:xkhmpk6otfbcnbg5dtw5pkqb4u

Towards an information quality approach to enhance query routing processes

Crishane Freire, Bruno F. F. Souza, Damires Souza, Maria C. M. Batista, Ana Carolina Salgado
2012 Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services - IIWAS '12  
In this work, we propose a model which combines semantic information concepts with IQ ones as a way to produce semantic knowledge to be used in query routing processes.  ...  Query answering has been addressed as a key issue in distributed environments such as Peer Data Management Systems (PDMS).  ...  In the next section, we present a model to represent IQ in a query routing scenario in the light of PDMS A MODEL TO REPRESENT QUERY ROUTING SCENARIO In order to allow IQ usage, it is crucial to define  ... 
doi:10.1145/2428736.2428791 dblp:conf/iiwas/FreireSSBS12 fatcat:pouynz7xmzdxbhztdpzjarnkze

A research agenda for query processing in large-scale peer data management systems

Katja Hose, Armin Roth, André Zeitz, Kai-Uwe Sattler, Felix Naumann
2008 Information Systems  
In this article we first survey the state of the art on peer data management: We classify PDMS by characteristics concerning their system model, their semantics, their query planning schemes, and their  ...  Peer Data Management Systems (PDMS) are a novel, useful, but challenging paradigm for distributed data management and query processing.  ...  However, such experience should be collected preferably in a decentralized manner. Updating routing indexes.  ... 
doi:10.1016/j.is.2008.01.012 fatcat:4snavtujrvhnlmhg2r3jxgabzm

SRI

Federica Mandreoli, Riccardo Martoglia, Simona Sassatelli, Wilma Penzo
2006 Proceedings of the eighth ACM international workshop on Web information and data management - WIDM '06  
In this paper, we propose a distributed index mechanism where each peer is provided with a Semantic Routing Index (SRI) for routing queries effectively.  ...  In a PDMS, peers have a schema on their local data, and they are related each other through semantic mappings that can be defined between their own schemas.  ...  query routing in a PDMS, and it appears to be the first having this purpose.  ... 
doi:10.1145/1183550.1183556 dblp:conf/widm/MandreoliMSP06 fatcat:iq66zwfh3zdfbnav7tgaaxcnta

Semantic-Based Query Routing and Heterogeneous Data Integration in Peer-to-Peer Semantic Link Networks [chapter]

Hai Zhuge, Jie Liu, Liang Feng, Chao He
2004 Lecture Notes in Computer Science  
The proposed approach includes a tool for constructing and maintaining P2P semantic link networks, a semantic-based peer similarity measurement approach for efficient query routing, and peer schema mapping  ...  A semantic link P2P network specifies and manages semantic relationships between peers' data schemas.  ...  algorithms for XML-based peers [5, 7, 8] , and the approach for optimizing query reformulation in a PDMS [18] .  ... 
doi:10.1007/978-3-540-30145-5_6 fatcat:n75cw3pe2vemladmic3qn6j5ra

Efficient Data Sharing over Large-Scale Distributed Communities [chapter]

Juan Li, Samee Ullah Khan, Qingrui Li, Nasir Ghani, Nasro Min-Allah, Pascal Bouvry, Weiyi Zhang
2011 Studies in Computational Intelligence  
Moreover, we propose a comprehensive query routing and optimization scheme to enable scalable and efficient query evaluation.  ...  In particular, we add a semantic layer to the PDMSs, which alleviates the semantic heterogeneity and assists the system to adjust its topology so that semantically related data sources can be connected  ...  In this section, we propose a comprehensive query routing and optimization scheme to address the challenges of semantic query evaluation.  ... 
doi:10.1007/978-3-642-21271-0_7 fatcat:nhtvoz6w65e6vbucg2kuhpmpxu

A semantic-based P2P resource organization model R-Chord

Jie Liu, Hai Zhuge
2006 Journal of Systems and Software  
Experiments show that, compared to the Chord approach, the R-Chord approach is more flexible to support semantic-based queries and can significantly decrease the average visiting number of and visiting  ...  It incorporates the classification semantics and the relational semantics to provide users and applications with a uniform view on distributed resources.  ...  P2P model Classification semantics RSM Relational semantics P2PSLN Semantic-based query routing Axis-and coordinate-based routing RSM Semantic-link-based routing P2PSLN Complex query in  ... 
doi:10.1016/j.jss.2006.03.001 fatcat:mghajvtqkballeizkhsf5pdcpy

Semantic peer, here are the neighbors you want!

Wilma Penzo, Stefano Lodi, Federica Mandreoli, Riccardo Martoglia, Simona Sassatelli
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
a network of mappings in a PDMS.  ...  Querying a PDMS may lead to very poor results, because of the semantic degradation due to the approximations given by the traversal of the semantic mappings, thus leading to the problem of how to boost  ...  In a PDMS, queries are answered globally on a network of semantically related peers: The key issue is that peer mappings are specified locally and answering a query posed at a peer may require piecing  ... 
doi:10.1145/1353343.1353351 dblp:conf/edbt/PenzoLMMS08 fatcat:v7kllfsj4nbmdle5ruj4kbeaji

Semantic peer, here are the neighbors you want!

Wilma Penzo, Stefano Lodi, Federica Mandreoli, Riccardo Martoglia, Simona Sassatelli
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
a network of mappings in a PDMS.  ...  Querying a PDMS may lead to very poor results, because of the semantic degradation due to the approximations given by the traversal of the semantic mappings, thus leading to the problem of how to boost  ...  In a PDMS, queries are answered globally on a network of semantically related peers: The key issue is that peer mappings are specified locally and answering a query posed at a peer may require piecing  ... 
doi:10.1145/1352431.1352439 fatcat:3d5koovosraijjwcd3ghaub57y

Queries Routing In Super-Peer-Based System: Simulation and Evaluation

Anis Ismal, Mohamed Quafafou, Gilles Nachouki, Mohammad Hajjar
2011 Journal of Emerging Technologies in Web Intelligence  
The set of KSP improves the robustness in queries routing mechanism and scalability in P2P Network.  ...  In this paper, we propose an architecture based on (super-)peers, and we focus on query routing.  ...  The advantage of our technique is the robustness in Queries routing. We experiment our technique using a Java implementation.  ... 
doi:10.4304/jetwi.3.3.206-216 fatcat:o7xroo4apvfola524nmhu5mcdq

Probabilistic Message Passing in Peer Data Management Systems

P. Cudre-Mauroux, K. Aberer, A. Feher
2006 22nd International Conference on Data Engineering (ICDE'06)  
Peer Data Management Systems (PDMS) provide an answer to this problem by eliminating the central semantic component and considering instead compositions of local, pair-wise mappings to propagate queries  ...  In this work, we propose a totally decentralized, efficient message passing scheme to automatically detect erroneous mappings in PDMS.  ...  trace of routed queries in the network.  ... 
doi:10.1109/icde.2006.118 dblp:conf/icde/Cudre-MaurouxAF06 fatcat:sbj4nzcbbrghfej3qlactfzvam

Data Management in the APPA System

Reza Akbarinia, Vidal Martins
2007 Journal of Grid Computing  
Most of the research on P2P systems has focused on dealing with the dynamic behavior of nodes (also called peers) and improving the performance of query routing in the unstructured systems which rely on  ...  In this paper, we present our solution in APPA (Atlas Peer-to-Peer Architecture), a data management system for large-scale P2P and Grid applications.  ...  Query Processing Phases Given a user query on a node schema, the objective is to find the minimum set of relevant nodes (query matching), route the query to these nodes (query routing), collect the answers  ... 
doi:10.1007/s10723-007-9070-z fatcat:4rz65bugzvcwxj6fyfrfjxokii

QUERY ROUTING IN A PEER-TO-PEER SEMANTIC LINK NETWORK

Hai Zhuge, Jie Liu, Liang Feng, Xiaoping Sun, Chao He
2005 Computational intelligence  
Routing a query accurately and efficiently from the originating peer to relevant other peers to reduce network flooding.  ...  reformulation in a PDMS (Tatarinov and Halevy 2004) , and the ontology-based P2P system for exchanging bibliographic data among computer science researchers (Broekstra et al. 2004) .  ...  Experiments show that this approach outperforms the classical Bloom filters in routing path queries.  ... 
doi:10.1111/j.0824-7935.2005.00271.x fatcat:6gxyidqwobge5d3ma6hzpsktki

An Efficient Architecture for Information Retrieval in P2P Context Using Hypergraph [article]

Anis Ismail, Mohamed Quafafou, Nicolas Durand, Mohammad Hajjar
2011 arXiv   pre-print
The set of clusters improves the robustness in queries routing mechanism and scalability in P2P Network.  ...  We use an algorithm MTMINER to extract all minimal transversals of a hypergraph (clusters) for query routing.  ...  The routing of Query in these networks is therefore very problematic. Semantic Routing is a method of routing which focuses on the nature of the query to be routed than the network topology.  ... 
arXiv:1108.1378v1 fatcat:gazef72yzzfyfj65i3bnex2hwe

Indexing views to route queries in a PDMS

Lefteris Sidirourgos, George Kokkinidis, Theodore Dalamagas, Vassilis Christophides, Timos Sellis
2008 Distributed and parallel databases  
In this paper, we are interested in routing graph queries in a very large PDMS, where peers advertise their local bases using fragments of community RDF/S schemas (i.e., views).  ...  We introduce an original encoding for these fragments, in order to efficiently check whether a peer view is subsumed by a query.  ...  In this paper, we are interested in routing graph queries addressed to an RDF/S based PDMS.  ... 
doi:10.1007/s10619-007-7021-0 fatcat:ivixvsgksrhgnjctseweust2du
« Previous Showing results 1 — 15 out of 215 results