Using a mapping knowledge base in a system for (semi-)automatic loading of XML data into relational databases

Author(s):  
Boubaker Kahloula ◽  
Karim Bouamrane
Author(s):  
Heiko Paulheim ◽  
Christian Bizer

Linked Data on the Web is either created from structured data sources (such as relational databases), from semi-structured sources (such as Wikipedia), or from unstructured sources (such as text). In the latter two cases, the generated Linked Data will likely be noisy and incomplete. In this paper, we present two algorithms that exploit statistical distributions of properties and types for enhancing the quality of incomplete and noisy Linked Data sets: SDType adds missing type statements, and SDValidate identifies faulty statements. Neither of the algorithms uses external knowledge, i.e., they operate only on the data itself. We evaluate the algorithms on the DBpedia and NELL knowledge bases, showing that they are both accurate as well as scalable. Both algorithms have been used for building the DBpedia 3.9 release: With SDType, 3.4 million missing type statements have been added, while using SDValidate, 13,000 erroneous RDF statements have been removed from the knowledge base.


2011 ◽  
pp. 972-985
Author(s):  
Ákos Hajnal ◽  
Tamás Kifor ◽  
Gergely Lukácsy ◽  
László Z. Varga

More and more systems provide data through web service interfaces and these data have to be integrated with the legacy relational databases of the enterprise. The integration is usually done with enterprise information integration systems which provide a uniform query language to all information sources, therefore the XML data sources of Web services having a procedural access interface have to be matched with relational data sources having a database interface. In this chapter the authors provide a solution to this problem by describing the Web service wrapper component of the SINTAGMA Enterprise Information Integration system. They demonstrate Web services as XML data sources in enterprise information integration by showing how the web service wrapper component integrates XML data of Web services in the application domain of digital libraries.


2018 ◽  
Vol 15 (3) ◽  
pp. 821-843
Author(s):  
Jovana Vidakovic ◽  
Sonja Ristic ◽  
Slavica Kordic ◽  
Ivan Lukovic

A database management system (DBMS) is based on a data model whose concepts are used to express a database schema. Each data model has a specific set of integrity constraint types. There are integrity constraint types, such as key constraint, unique constraint and foreign key constraint that are supported by most DBMSs. Other, more complex constraint types are difficult to express and enforce and are mostly completely disregarded by actual DBMSs. The users have to manage those using custom procedures or triggers. eXtended Markup Language (XML) has become the universal format for representing and exchanging data. Very often XML data are generated from relational databases and exported to a target application or another database. In this context, integrity constraints play the essential role in preserving the original semantics of data. Integrity constraints have been extensively studied in the relational data model. Mechanisms provided by XML schema languages rely on a simple form of constraints that is sufficient neither for expressing semantic constraints commonly found in databases nor for expressing more complex constraints induced by the business rules of the system under study. In this paper we present a classification of constraint types in relational data model, discuss possible declarative mechanisms for their specification and enforcement in the XML data model, and illustrate our approach to the definition and enforcement of complex constraint types in the XML data model on the example of extended tuple constraint type.


2013 ◽  
Vol 39 (2) ◽  
pp. 386-396 ◽  
Author(s):  
Jian Liu ◽  
Z. M. Ma ◽  
Xue Feng

Author(s):  
Mohammed Adam Ibrahim Fakharaldien ◽  
Jasni Mohamed Zain ◽  
Norrozila Sulaiman ◽  
Tutut Herawan

Storing XML documents in a relational database is a promising solution because relational databases are mature and scale very well. They have the advantages that in a relational database XML data and structured data can coexist making it possible to build application that involve both kinds of data with little extra effort. This paper proposes an alternative method named Xrecursive for mapping XML (eXtensible Markup Language) documents to RDB (Relational Databases). The Xrecursive method does not need a DTD (Document Text Definition) or XML schema. Further, it can be applied as a general solution for any XML data. The steps and algorithm of Xrecursive are given in details to describe how to use the storing structure to storage and query XML documents in relational database. The authors report their experimental results on a real database, showing that the performance of their Xrecursive algorithm achieves better results in terms of storage size, insertion time, mapping time, and reconstruction time as compared with that SUCXENT and XParent methods. In overall, Xrecursive performs better in term of query performances as compared to the both methods.


2011 ◽  
Vol 1 (4) ◽  
pp. 53-65 ◽  
Author(s):  
Mohammed Adam Ibrahim Fakharaldien ◽  
Jasni Mohamed Zain ◽  
Norrozila Sulaiman ◽  
Tutut Herawan

Storing XML documents in a relational database is a promising solution because relational databases are mature and scale very well. They have the advantages that in a relational database XML data and structured data can coexist making it possible to build application that involve both kinds of data with little extra effort. This paper proposes an alternative method named Xrecursive for mapping XML (eXtensible Markup Language) documents to RDB (Relational Databases). The Xrecursive method does not need a DTD (Document Text Definition) or XML schema. Further, it can be applied as a general solution for any XML data. The steps and algorithm of Xrecursive are given in details to describe how to use the storing structure to storage and query XML documents in relational database. The authors report their experimental results on a real database, showing that the performance of their Xrecursive algorithm achieves better results in terms of storage size, insertion time, mapping time, and reconstruction time as compared with that SUCXENT and XParent methods. In overall, Xrecursive performs better in term of query performances as compared to the both methods.


Sign in / Sign up

Export Citation Format

Share Document