%0 Journal Article %1 Qin2008QueryRewritingPeerOntologies %A Qin, Biao %A Wang, Shan %A Du, Xiaoyong %A Chen, Qiming %A Wang, Qiuyue %D 2008 %J Information Sciences %K ontology %N 18 %P 3525--3542 %R DOI: 10.1016/j.ins.2008.05.026 %T Graph-based Query Rewriting for Knowledge Sharing between Peer Ontologies %U http://www.sciencedirect.com/science/article/B6V0C-4SMNXXX-2/2/dce936cbdd0799040ec18c297f3dec25 %V 178 %X Peer knowledge management systems (PKMS) offer a flexible architecture for decentralized knowledge sharing. In PKMSs, the knowledge sharing and evolution processes are based on peer ontologies. Finding an effective and efficient query rewriting algorithm for regular expression queries is vital for knowledge sharing between peers in PKMSs; and for this our solution is characterized by graph-based query rewriting. Based on the graphs for both axioms and mappings, we design a novel algorithm, regular expression rewriting algorithm, to rewrite regular expression queries along semantic paths. The simulation results show that the performance of our algorithm is better than Mork’s reformulation algorithms P. Mork, Peer architectures for knowledge sharing, PhD thesis, University of Washington, 2005. <http://www.mitre.org/staffpages/pmork/>, and our algorithm is more effective than the naive rewriting algorithm.

@article{Qin2008QueryRewritingPeerOntologies, abstract = {Peer knowledge management systems (PKMS) offer a flexible architecture for decentralized knowledge sharing. In PKMSs, the knowledge sharing and evolution processes are based on peer ontologies. Finding an effective and efficient query rewriting algorithm for regular expression queries is vital for knowledge sharing between peers in PKMSs; and for this our solution is characterized by graph-based query rewriting. Based on the graphs for both axioms and mappings, we design a novel algorithm, regular expression rewriting algorithm, to rewrite regular expression queries along semantic paths. The simulation results show that the performance of our algorithm is better than Mork’s reformulation algorithms [P. Mork, Peer architectures for knowledge sharing, PhD thesis, University of Washington, 2005. <http://www.mitre.org/staffpages/pmork/>], and our algorithm is more effective than the naive rewriting algorithm.}, added-at = {2011-12-12T19:00:59.000+0100}, author = {Qin, Biao and Wang, Shan and Du, Xiaoyong and Chen, Qiming and Wang, Qiuyue}, biburl = {https://www.bibsonomy.org/bibtex/213c67b99c819c90227d0aff82aaba1db/gergie}, doi = {DOI: 10.1016/j.ins.2008.05.026}, file = {:Qin2008QueryRewritingPeerOntologies.pdf:PDF}, groups = {public}, interhash = {f1c9f810ba533e14e11d345b3176339d}, intrahash = {13c67b99c819c90227d0aff82aaba1db}, issn = {0020-0255}, journal = {Information Sciences}, keywords = {ontology}, month = {September}, number = 18, pages = {3525--3542}, timestamp = {2011-12-13T10:38:02.000+0100}, title = {{Graph-based Query Rewriting for Knowledge Sharing between Peer Ontologies}}, url = {http://www.sciencedirect.com/science/article/B6V0C-4SMNXXX-2/2/dce936cbdd0799040ec18c297f3dec25}, username = {gergie}, volume = 178, year = 2008 }