This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Querying Distributed Data through Distributed Ontologies: A Simple but Scalable Approach
September/October 2003 (vol. 18 no. 5)
pp. 60-65
Fran?ois Goasdou?, Universit? Paris-Sud
Marie-Christine Rousset, Universit? Paris-Sud

This article presents a simple but scalable framework for peer-to-peer data-sharing systems, in which the problem of answering queries over a network of semantically related peers is always decidable. The authors' approach is characterized by a simple class-based language for defining peer schemas as hierarchies of atomic classes, and mappings as inclusions of logical combinations of atomic classes. They provide an anytime and incremental method for computing all the answers to a query posed to a given peer such that the answers are ordered from ones involving peers close to the queried peer to those involving more distant peers.

Index Terms:
general systems theory, information theory, knowledge representation, languages, information integration, Semantic Web
Citation:
Fran?ois Goasdou?, Marie-Christine Rousset, "Querying Distributed Data through Distributed Ontologies: A Simple but Scalable Approach," IEEE Intelligent Systems, vol. 18, no. 5, pp. 60-65, Sept.-Oct. 2003, doi:10.1109/MIS.2003.1234771
Usage of this product signifies your acceptance of the Terms of Use.