An XML query rewriting mechanism with multiple ontologies integration based on complex semantic mapping

Semantic integration, which can be divided into three parts including ontology mapping, mapping representation, and reasoning and query rewriting with mappings, plays a key role in information integration systems. This paper develops an XML query rewriting and ontology integration mechanism, which acts as a global-as-view (GAV) approach to represent and query semantic information in mediator based information integration environment. It proposes the patterns and properties of ontology mappings, discusses the procedure and algorithm of ontology integration firstly, and then proposes the ontology based XML query mechanism, especially the XML query rewriting mechanism. Finally, a mediator-based implementation of the mechanism in OBSA system is introduced.     

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

A semantic link peer-to-peer (P2P) network specifies and manages semantic relationships between peers' data schemas and can be used as the semantic layer of a scalable Knowledge Grid. The proposed approach consists of an automatic semantic link discovery method, a tool for building and maintaining P2P semantic link networks (P2PSLNs), a semantic-based peer similarity measurement for efficient query routing, and the schema mapping algorithms for query reformulation and heterogeneous data integration. The proposed approach has three important aspects. First, it uses semantic links to enrich the relationships between peers' data schemas. Second, it considers not only nodes but also the XML structure in measuring the similarity between schemas to efficiently and accurately forward queries to relevant peers. Third, it copes with semantic and structural heterogeneity and data inconsistency so that peers can exchange and translate heterogeneous information within a uniform view.     

On Capturing Semantics in Ontology Mapping

Semantic interoperability between disparate systems in open, distributed environments has become the quest of many practitioners in a variety of fields. One way to achieve such a goal is through ontology mapping. The perspective users of such technology, however, are faced with a number of challenges including ambiguity of the meaning of mappings, difficulties of capturing semantics, choice of the right ontology mapping tools, verification and validation of results and operationalisation in the beneficiary semantic web application. In this paper we present a formalisation of ontologies and a triangle model for the ontology mapping problems. This formalisation of ontology mapping reflects the engineering steps needed to materialise a versatile mapping system in order to faithfully re-capture the semantics embodied in ontologies which is the fundamental requirements posed by the semantic web environment. We further accommodate this formalisation with a series of specialist algorithms targeting at particular aspects of semantic capturing. Finally, we evaluated the proposed algorithms by way of ontology mapping benchmark tests.     

An intelligent query processing for distributed ontologies

In this paper, we propose an intelligent distributed query processing method considering the characteristics of a distributed ontology environment. We suggest more general models of the distributed ontology query and the semantic mapping among distributed ontologies compared with the previous works. Our approach rewrites a distributed ontology query into multiple distributed ontology queries using the semantic mapping, and we can obtain the integrated answer through the execution of these queries. Furthermore, we propose a distributed ontology query processing algorithm with several query optimization techniques: pruning rules to remove unnecessary queries, a cost model considering site load balancing and caching, and a heuristic strategy for scheduling plans to be executed at a local site. Finally, experimental results show that our optimization techniques are effective to reduce the response time.     

语义集成中的不确定性本体映射模型

语义Web的高速发展使其具有动态性和异构性特征,解决语义信息的异构性问题成为实现信息集成的关键。本体作为一种语义Web的知识表示形式,增强了Web的语义信息。因此,为了解决语义异构性,实现数据间的互操作,必须建立异构本体间的映射关系。然而,为庞大的异构本体建立完全精确的本体映射是不现实的,本体映射中存在一定的不确定性。提出了一种新型的本体映射框架——语义集成中的不确定性本体映射。从不同方面研究本体特征,集合了多种映射策略,并引入了各映射策略中不确定性匹配的解决方案。实验证明,该方法具有可靠的实验性能,并且具有很好的通用性和可扩展性。     

Detection and resolution of semantic inconsistency and redundancy in an automatic ontology merging system

In recent years, researchers have been developing algorithms for the automatic mapping and merging of ontologies to meet the demands of interoperability between heterogeneous and distributed information systems. But, still state-of-the-art ontology mapping and merging systems is semi-automatic that reduces the burden of manual creation and maintenance of mappings, and need human intervention for their validation. The contribution presented in this paper makes human intervention one step more down by automatically identifying semantic inconsistencies in the early stages of ontology merging. We are detecting semantic heterogeneities that occur due to conflicts among the set of Generalized Concept Inclusions, Property Subsumption Criteria, and Constraint Satisfaction Mechanism in local heterogeneous ontologies, which become obstacles for the generation of semantically consistent global merged ontology. We present several algorithms to detect such semantic inconsistencies based on subsumption analysis of concepts and properties in local ontologies from the list of initial mappings. We provide ontological patterns for resolving these inconsistencies automatically. This results global merged ontology free from ??circulatory error in class/property hierarchy??, ??common class between disjoint classes/properties??, ??redundancy of subclass/subproperty of relations?? and other types of ??semantic inconsistency?? errors. Experiments on the real ontologies show that our algorithms save time and cost of traversing local ontologies, improve system??s performance by producing only consistent accurate mappings, and reduce the users?? dependability for ensuring the satisfiability of merged ontology.     

基于本体概念关联度的信息匹配模型及算法

当今信息查询系统可以借助语义网中的本体在结点之间的信息查询中引入必要的语义,但这种方法在分布式网络中并不完全适用。因此论文主要提出了在分布式网络中借助本体的框架通过使用近义词和概念关联度的概念进行信息查询的新方法,从而在分布式网络中只通过对方和本身结点的有效信息就能进行相对较为有效的信息查询。     

分布式信息系统集成的语义架构SP4IDIS

为了解决分布式信息系统之间信息无法共享的问题,提出一种基于形式语义的系统集成支撑技术,构建了分布式信息系统的可共享语义平台.该方法保持了源信息系统的自治性,通过构造融合本体为分布式信息系统提供信息解释公用模版.与已有的方法相比,该系统采全形式化语义支撑,奠定了分布式信息系统自动化集成的基础.     

基于领域学习的本体映射方法

在语义数据集成中本体映射是关键,手工设置映射关系不仅消耗时间而且不准确,需要使用本体映射工具自动发现这种映射关系.在现有本体映射方法的基础上提出了基于领域学习的映射发现策略,可以从领域知识中发现复杂映射的规则,增加映射时的实例数据,从而提高映射发现的查全率和准确率;同时利用本体中丰富的语义知识去筛选候选数据,从而降低映射方法的算法复杂度.实验证明该方法是有效的.     

A visual tool for ontology alignment to enable geospatial interoperability

In distributed geospatial applications with heterogeneous databases, an ontology-driven approach to data integration relies on the alignment of the concepts of a global ontology that describe the domain, with the concepts of the ontologies that describe the data in the distributed databases. Once the alignment between the global ontology and each distributed ontology is established, agreements that encode a variety of mappings between concepts are derived. In this way, users can potentially query hundreds of geospatial databases using a single query. Using our approach, querying can be easily extended to new data sources and, therefore, to new regions. In this paper, we describe the AgreementMaker, a tool that displays the ontologies, supports several mapping layers visually, presents automatically generated mappings, and finally produces the agreements.     

A semantic interoperability approach to health‐care data: Resolving data‐level conflicts

The integration of data from various electronic health record (EHR) systems presents a critical conflict in the sharing and exchanging of patient information across a diverse group of health‐oriented organizations. Patient health records in each system are annotated with ontologies utilizing different health‐care standards, creating ontology conflicts both at the schema and data levels. In this study, we introduce the concept of semantic ontology mapping for the facilitation and interoperability of heterogeneous EHR systems. This approach proposes a means of detecting and resolving the data‐level conflicts that generally exist in the ontology mapping process. We have extended the semantic bridge ontology in support of ontology mapping at the data level and generated the required mapping rules to reconcile data from different ontological sources into a canonical format. As a result, linked‐patient data are generated and made available in a semantic query engine to facilitate user queries of patient data across heterogeneous EHR systems.     

语义P2P系统上的知识分享研究*

由于语义P2P系统的知识分散部署于各个peer节点上,而每个peer节点都拥有其自身异构的知识模式和本体表示,这就给语义P2P节点间的知识分享带来了困难。对语义P2P系统进行了深入分析,着重对P2P节点之间的知识分享问题进行了论述,并进一步提出自己的设计思路来解决这一问题。     

Performance evaluation of semantic registries: OWLJessKB and instanceStore

Service discovery is a critical task in distributed computing architectures for finding a particular service instance. Semantic annotations of services help to enrich the service discovery process. Semantic registries are an important component for the discovery of services and they allow for semantic interoperability through ontology-based query formulation and dynamic mapping of terminologies between system domains. This paper evaluates two semantic registries—OWLJessKB implementation and instanceStore—to determine the suitability of these with regards to the query response time and the overall scalability for use in mathematical services. Mathematical ontologies from the MONET project are used to undertake comparison. The results demonstrate that the performance of registries may be compared across two axes: (1) time to initialize (i.e. time to load an initial ontology into memory); (2) time to query (i.e. time to reason with an ontology loaded into memory).     

一种基于Ontology的数据集成系统

针对异构数据源中实现基于语义的数据集成的需求,采用分层思想,在用户层与实际数据层之间增加一个中间层来屏蔽底层数据的异构,用本体作为公共语义描述工具,建立本体到各数据源的映射规则,设计实现了将基于本体的全局查询转化为基于各数据源的局部查询系统,解决了数据源之间的语义异构问题,其中用OWL表示本体和映射,并研究了系统中的关键技术。     

基于XQuery扩展的异构语义Web服务发现

语义Web服务发现作为分布式计算的前提和关键,备受研究者关注。多种语义Web服务描述语言的存在给异构语义Web服务的发现带来了挑战。本文提出了一种支持异构语义Web服务描述语言的发现框架i XQuery。该框架从两个方面扩展XQuery,使其支持异构语义Web服务的结构化查询与逻辑推理、模糊匹配的联合查询。一方面i XQuery利用XQuery的外部函数机制,建立了多种类型的相似度比较函数;另一方面i XQuery制定了一个统一的语义Web服务抽象描述本体,并建立了语义Web服务语言SAWSDL与OWLS与该本体之间的映射,并利用XQuery的用户自定义函数机制,建立了一系列用于抽取异构语义Web服务中信息的抽象描述操作子。最后,介绍了基于i XQuery框架的异构语义Web服务匹配器H-i Matcher。     

基于蒙古语新闻领域本体的分布式检索方法

目前蒙古语语义Web方面的研究成果都是基于单机环境的,当语义Web信息检索系统投入实际运行时,单机环境存在存储容量有限和多用户并发查询速度慢等问题.针对此问题,提出了基于蒙古语新闻领域本体的分布式语义Web检索方法.首先依据蒙古语新闻领域的特点,参照七步法和骨架法,构建蒙古语新闻领域本体,研究适合本体的混合语义相似度算...     

OLAP query reformulation in peer-to-peer data warehousing

Inter-business collaborative contexts prefigure a distributed scenario where companies organize and coordinate themselves to develop common and shared opportunities, but traditional business intelligence systems do not provide support to this end. To fill this gap, in this paper we envision a peer-to-peer data warehousing architecture based on a network of heterogeneous peers, each exposing query answering functionalities aimed at sharing business information. To enhance the decision making process, an OLAP query expressed on a peer needs to be properly reformulated on the local multidimensional schemata of the other peers. To this end, we present a language for the definition of mappings between the multidimensional schemata of peers and we introduce a query reformulation framework that relies on the translation of mappings, queries, and multidimensional schemata onto the relational level. Then, we formalize a query reformulation algorithm and prove two properties: correctness and closure, that are essential in a peer-to-peer setting. Finally, we discuss the main implementation issues related to the reformulation setting proposed, with specific reference to the case in which the local multidimensional engines hosted by peers use the standard MDX language.     

AbIx: An Approach to Content-Based Approximate Query Processing in Peer-to-Peer Data Systems

In recent years there has been a significant interest in peer-to-peer （P2P） environments in the community of data management. However, almost all work, so far, is focused on exact query processing in current P2P data systems. The autonomy of peers also is not considered enough. In addition, the system cost is very high because the information publishing method of shared data is based on each document instead of document set. In this paper, abstract indices （AbIx） are presented to implement content-based approximate queries in centralized, distributed and structured P2P data systems. It can be used to search as few peers as possible but get as many returns satisfying users＇ queries as possible on the guarantee of high autonomy of peers. Also, abstract indices have low system cost, can improve the query processing speed, and support very frequent updates and the set information publishing method. In order to verify the effectiveness of abstract indices, a simulator of 10,000 peers, over 3 million documents is made, and several metrics are proposed. The experimental results show that abstract indices work well in various P2P data systems.     

基于本体的语义网检索模型及关键技术研究

为解决传统的基于题,构建了一个基于本体的语义网检索模型.提出了一种领域本体库和应用本体库的构建方法,给出了查询本体的生成以及相似本体匹配推理的方法,实现了以该模型为基础的试验性检索系统.实验结果表明,该模型能够进行本体的语义推理,在一定程度上增强信息检索系统的语义处理能力,检索效率得到了改善.     

纯Peer to Peer环境下有效的Top-k查询

目前大多数的Peer-to-Peer(P2P)系统只支持基于文件标识的搜索,用户不能根据文件的内容进行搜索.Top-k查询被广泛地应用于搜索引擎中,获得了巨大的成功.可是,由于P2P系统是一个动态的、分散的系统,在纯的P2P环境下进行top-k查询是具有挑战性的.提出了一种基于直方图的分层top-k查询算法.首先,采用层次化的方法实现分布式的top-k查询,将结果的合并和排序分散到P2P网络中的各个节点上,充分利用了网络中的资源.其次,根据节点返回的结果为节点构建直方图,利用直方图估计节点可能的分数上限,对节点进行选择,提高了查询效率.实验证明,top-k查询提高了查询效果,而直方图则提高了查询效率.