Semantic XML Research Articles

Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying

Many efforts have been deployed by the IR community to extend freetext query processing toward semi-structured XML search. Most methods rely on the concept of Lowest Comment Ancestor (LCA) between two or multiple structural nodes to identify the most specific XML elements containing query keywords posted by the user. Yet, few of the existing approaches consider XML semantics, and the methods that process semantics generally rely on computationally expensive word sense disambiguation (WSD) techniques, or apply semantic analysis in one stage only: performing query relaxation/refinement over the bag of words retrieval model, to reduce processing time. In this paper, we describe a new approach for XML keyword search aiming to solve the limitations mentioned above. Our solution first transforms the XML document collection (offline) and the keyword query (on-the-fly) into meaningful semantic representations using context-based and global disambiguation methods, specially designed to allow almost linear computation efficiency. We use a semantic-aware inverted index to allow semantic-aware search, result selection, and result ranking functionality. The semantically augmented XML data tree is processed for structural node clustering, based on semantic query concepts (i.e., key-concepts), in order to identify and rank candidate answer sub-trees containing related occurrences of query key-concepts. Dedicated weighting functions and various search algorithms have been developed for that purpose and will be presented here. Experimental results highlight the quality and potential of our approach.

A novel semantic representation approach for web documents using deep entity linking and multidocument support

SummaryRepresenting semantic web information in the form of existing formats like extensible mark‐up language (XML), resource description framework (RDF) or web ontology language (OWL) is limited by the inability to maintain intradocument relationships between different semantic entities. Moreover, these standards are built for generic data representation and thus do not have inherent support for the semantic description of the document and, consequently, do not support features like multidocument linkages and context‐sensitivity. In order to remove these drawbacks, a semantic web‐specific document representation approach, namely, deep semantic XML (DS‐XML) using deep linking and machine learning, is presented in this paper. The DS‐XML approach facilitates the use of semantics with the help of a novel document structure that focuses on defining any web document in a semantic form. It includes ontologies and linkage between different vocabularies, which assists in achieving semantic interoperability. In order to make this approach future proof, a novel deep linking approach is integrated at the document level, which allows DS‐XML to understand more about the contents of the document and represent information in an aggregated manner. The deep linking layer is combined with the machine learning‐based classification layer that allows the document information to be represented in an interactive manner. The proposed DS‐XML approach is tested on different document retrieval applications, including a few Internet of Things (IoT) applications, and the representation performance is found to be superior to the existing semantic approach (XML, RDF and OWL).

Elements of XPath-like languages in problems of constructing semantic XML models of natural language texts

The subject of the research is the possibility of using XPath-like micro-languages of programming in the generation systems of programs of the PGEN ++ class for the selection and completion of XML-models describing the plan for solving the original problem, according to which the solver program is generated. It is supposed to build such models according to the description of the problem in natural language, thus, we are talking about elements of artificial intelligence technologies. XPath-like language works in the layer of regular-logical expressions (highlighting elements of the primary XML document), performing primary processing of the data obtained in the layer of grammatical parsing of the source text. In addition, XPath-like elements are used to render the final XML models. The standard natural language parsing libraries are used. Non-standard XPath query language extensions are used. For the first time, the idea of expanding the XPath query language to the level of an algorithmic language by introducing the minimum required number of syntactic elements is proposed. It is also proposed to use syntactic elements with an XPath-like structure as both generating and controlling weak constraints of the process of direct inference of final semantic XML models.

Data Auditing, Cleaning and Quality Assurance Workflows from the Experience of a Scholarly Publisher

Data Auditing, Cleaning and Quality Assurance Workflows from the Experience of a Scholarly Publisher

Encoding of coordination complexes with XML

An in-silico system to encode structure, bonding and properties of coordination complexes is developed. The encoding is achieved through a semantic XML markup frame. Composition of the coordination complexes is captured in terms of central atom and ligands. Structural information of central atom is detailed in terms of electron status of valence electron orbitals. The ligands are encoded with specific reference to the electron environment of ligand centre atoms. Behaviour of ligands to form low or high spin complexes is accomplished by assigning a Ligand Centre Value to every ligand based on the electronic environment of ligand centre atom. Chemical ontologies are used for categorization purpose and to control different hybridization schemes. Complexes formed by the central atoms of transition metal, non-transition elements belonging to s-block, p-block and f-block are encoded with a generic encoding platform. Complexes of homoleptic, heteroleptic and bridged types are also covered by this encoding system. Utility of the encoded system to predict redox electron transfer reaction in the coordination complexes is demonstrated with a simple application.

의미적 제약조건을 고려한 XML 스키마의 변환

XML 데이터를 효율적으로 저장하고 질의하기 위하여 많은 기법들이 제안되었다. 이러한 목표를 위한 한 가지 방법은 XML 데이터를 관계형 형식으로 변환하여 관계형 데이터베이스를 사용하는 것이다. XML 문서의 내용, 구조, 의미 정보인 제약조건 보존은 스키마를 변환하는 과정에서 매우 중요하다. 특히 키 제약조건은 데이터베이스 이론의 중요한 부분을 차지한다. 따라서 제안된 기법은 주키와 외래키를 표현함으로써 XML의 의미를 반영하며, 변환하는 데에 XML 데이터의 키 제약조건뿐만 아니라 데이터의 내용과 구조와 의미도 보존한다. 변환 정보는 문서의 내용, 문서의 구조(부모-자식 관계), 함수적 종속성, XML key와 keyref 제약조건에 의해 포착한 문서의 의미이다. 제안된 기법은 XML 스키마를 변환할 때에 의미적 제약조건들의 보존을 보장함으로써 관계형 데이터베이스에서 데이터 무결성을 보장하기 위한 저장 프로시저나 트리거를 사용할 필요가 없는 이점이 있다. 이러한 변환은 산업체에서 필요한 데이터 관리의 한 부분으로, 이미 웹에 저장되어있는 데이터를 데이터베이스에 저장하여 다른 업무에 활용할 수가 있을 것이다. 본 논문에서는 DTD에서 지원하는 ID/IDREF 키, 상속 관계, 묵시적 참조 무결성은 반영하지 못하였다. Many techniques have been proposed to store and query XML data efficiently. One way achieving this goal is using relational database by transforming XML data into relational format. It is important to transform schema to preserve the content, the structure and the constraints of the semantics information of the XML document. Especially, key constraints are an important part of database theory. Therefore, the proposal technique has considered the semantics of XML as expressed by primary keys and foreign keys. And, the proposal technique can preserve not only XML data constraints but also the content and the structure and the semantics of XML data thru transformation process. Transforming information is the content and the structure of the document(the parent-child relationship), the functional dependencies, semantics of the document as captured by XML key and keyref constraints. Because of XML schema transformation ensures that preserving semantic constraints, the advantages of these transformation techniques do not need to use the stored procedure or trigger which these data ensures data integrity in the relational database. In this paper, there is not chosen the ID/IDREF key which supported in DTD, the inheritance relationship, the implicit referential integrity.

XML 데이터 처리에서 시맨틱

XML은 계층적이고 스스로 기술하는 구조를 가지는 데이터를 표현하기에 좋지만 XML 자체는 시맨틱을 가지고 있지 않다. 하지만 XML이 널리 새로운 응용에서 사용됨에 따라 XML 시맨틱이 필요하게 되었다. 이 논문은 XML 데이터 처리 환경에서 시맨틱을 조사하였다. XML 시맨틱은 사용 용도에 따라 구조적 시맨틱, 관계 시맨틱, 확장 시맨틱과 시맨틱 웹으로 분류할 수 있다. 그리고 질의 처리와 같이 XML 문서 관리에서 활용하기 위해 확장된 관계 시맨틱을 제안한다. XML is good at representing data with hierarchical and self-describing structure. There is no inherent semantics with XML. However, semantics of XML has come up with us as XML is used in wide and advanced applications. This paper surveyed semantics in XML data processing environment. XML semantics can be categorized into four groups according to its usage; structural semantics, relational semantics, extended semantics, and semantic web. Relational database is still a good alternative for storing and managing large volume of XML documents. We propose an extended relational semantics in order to exploit it in managing XML documents such as query processing.

Lightweight XML semantic integration: a global schema independent approach

In recent years XML has established its position as one of the most prevalent technologies for data exchange. However, its widespread but uncontrolled use has generated vast amounts of semantically alike but structurally different XML data sources. This hinders the ability to meaningfully synthesise related information which partially defeats the purpose of XML. Many solutions have been proposed for the integration of XML semantics, most of which rely on the creation of a global mediated schema. In this paper, we present a novel approach for decentralised integration of heterogeneous XML data sources; thus eliminating the need to create and maintain a global schema. Moreover, our solution is portable which enables the XML data sources to be semantically integrated into different systems without additional efforts. We achieved these objectives by introducing two new components namely, XML semantic schema (XMLSS) and XML semantic query language (XMLSQL), and by providing a query translation algorithm to translate XMLSQL to standard XQuery.

XIOTR :A Terse Ranking of XIO for XML Keyword Search

The emergence of the Web has increased interests in XML data because that XML has flexible structure. Keyword search has attracted a great deal of attention for retrieving XML data because it is a user-friendly mechanism. But Keyword search is hard to directly improve search quality because lots of keyword-matched nodes may not contribute to the results. And in many applications, the goal is to find such related results that best match a set of keywords, the keywords occur location may not be consided. XML includes rich semantic information, these semantics are helpful to information retrieval process. The existing approaches of keyword search usually first generate all possible results composed of relevant tuples and then sort them based on their individual ranks. This paper investigates the compelling problem of how to take advantage of XML semantics to improve keyword search quality. We design an XML keyword search approach, that can derive the keyword query and generate a set of effective structured queries by analyzing the given keyword query and the schemas of XML data sources. Furthermore, we provide a terse algorithm to computing the rank score of the structured queries, then we can sort the results easily. We have implemented our method on real datasets and the experimental results show that our approach achieves both high recall and precise when compared with existing proposals.

A Semantic Cache Framework for Secure XML Queries

Secure XML query answering to protect data privacy and semantic cache to speed up XML query answering are two hot spots in current research areas of XML database systems. While both issues are explored respectively in depth, they have not been studied together, that is, the problem of semantic cache for secure XML query answering has not been addressed yet. In this paper, we present an interesting joint of these two aspects and propose an efficient framework of semantic cache for secure XML query answering, which can improve the performance of XML database systems under secure circumstances. Our framework combines access control, user privilege management over XML data and the state of-the-art semantic XML query cache techniques, to ensure that data are presented only to authorized users in an efficient way. To the best of our knowledge, the approach we propose here is among the first beneficial efforts in a novel perspective of combining caching and security for XML database to improve system performance. The efficiency of our framework is verified by comprehensive experiments.

Probabilistic interval XML

Interest in XML databases has been expanding rapidly over the last few years. In this paper, we study the problem of incorporating probabilistic information into XML databases. We propose the Probabilistic Interval XML ( PIXML for short) data model in this paper. Using this data model, users can express probabilistic information within XML markups. In addition, we provide two alternative formal model-theoretic semantics for PIXML data. The first semantics is a “global” semantics which is relatively intuitive, but is not directly amenable to computation. The second semantics is a “local” semantics which supports efficient computation. We prove several correspondence results between the two semantics. To our knowledge, this is the first formal model theoretic semantics for probabilistic interval XML. We then provide an operational semantics that may be used to compute answers to queries and that is correct for a large class of probabilistic instances.

A Model-Theoretic Semantics for XML

The problem that XML formally governs syntax only but not semantics has been recognized as a serious barrier for XML-Based data integration and the extension of current Web to the semantic Web. To address this problem, the XML Semantics Definition Language (XSDL) is proposed to explicitly express the XML author's intended meaning and a model-theoretic semantics for XML. In this way, the XML becomes a sub-language of RDF (resource description framework) in expressivity and the XML data can be semantics-preserving transformed to the RDF data. The semantic validity and entailment problem of XML documents are further provided and they are reduced to the knowledge base unsatisfiability problem in description logic language SHOIN�∆

Optimizing the Execution Time for Checking the Consistency of XML Documents

The problem of checking the consistency of the semantics associated with extensible markup language (XML) documents is considered. We propose a novel technique to add semantics to XML documents by attaching semantic information to the XML element tag attributes. We call this XML semantics. This approach is based on the same concept of attribute grammars (AGs), attaching and checking static semantics of programming languages through their attributes. The goal of this paper is to introduce the notions of copy rules and copy attributes that can be deployed in the XML semantics. Moreover, we will show how it can be represented in the SLXS language. The SLXS language is a description language based on XMLs we have designed it to describe the semantic dependencies of XML documents. In addition, we demonstrate the copy bypass attribute propagation algorithm that can be used to eliminate the evaluation of copy attributes in copy rule chains. It dynamically replaces copy rules with non-local dependencies. Given such elimination, we get a faster attribute evaluator and avoid evaluating unnecessary attributes. Furthermore, more than half of the generated code associated with copy rules is reduced. In this way, we gain an optimization technique to evaluate and check the consistency of XML documents that may contain such attributes. Finally, we evaluate experimentally the performance benefits of our technique using a variety of XML documents.

Supplier Affiliated Extended Supply Chain Backbones

E-commerce has progressed from the preliminary stages of brochure-ware to on-line transaction management, and is entering a phase where great opportunities exist in extended supply-chain over the Internet. Currently, much of the focus is on business-to-business e-commerce, where middleman hubs perform broker functions of search and comparison. Their value is derived from providing time and cost savings to participants. As XML semantics and other information sharing technologies become more standardized, and as behavioral aspects of Internet commerce become better established, we would expect the searching and comparison mechanics to become priced at their marginal costs. Business-to-business hubs, or interorganizational systems that do not add value in another way to the chain will find very little margins. In this paper, we examine issues related to Internet extended supply chain backbones from the supplier’s viewpoint and discuss the information architecture of a third party software backbone and how it can provide value-added services to suppliers and OEMs via internetworking standards.