Converting Probabilistic Relational Data to Probabilistic XML Data Tree

2010 ◽  
Vol 9 (8) ◽  
pp. 1706-1712
Author(s):  
Jianwei Wang ◽  
Zhongxiao Hao
2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Yue Zhao ◽  
Ye Yuan ◽  
Guoren Wang

This paper describes a keyword search measure on probabilistic XML data based on ELM (extreme learning machine). We use this method to carry out keyword search on probabilistic XML data. A probabilistic XML document differs from a traditional XML document to realize keyword search in the consideration of possible world semantics. A probabilistic XML document can be seen as a set of nodes consisting of ordinary nodes and distributional nodes. ELM has good performance in text classification applications. As the typical semistructured data; the label of XML data possesses the function of definition itself. Label and context of the node can be seen as the text data of this node. ELM offers significant advantages such as fast learning speed, ease of implementation, and effective node classification. Set intersection can compute SLCA quickly in the node sets which is classified by using ELM. In this paper, we adopt ELM to classify nodes and compute probability. We propose two algorithms that are based on ELM and probability threshold to improve the overall performance. The experimental results verify the benefits of our methods according to various evaluation metrics.


Author(s):  
Qin Ding

With the growing usage of XML data for data storage and exchange, there is an imminent need to develop efficient algorithms to perform data mining on semistructured XML data. Mining on XML data is much more difficult than mining on relational data because of the complexity of structure in XML data. A naïve approach to mining on XML data is to first convert XML data into relational format. However the structure information may be lost during the conversion. It is desired to develop efficient and effective data mining algorithms that can be directly applied on XML data.


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.


Author(s):  
Chenjing Zhang ◽  
Le Chang ◽  
Chaofeng Sha ◽  
Xiaoling Wang ◽  
Aoying Zhou
Keyword(s):  
Xml Data ◽  

2007 ◽  
Vol 63 (3) ◽  
pp. 972-996 ◽  
Author(s):  
Z.M. Ma ◽  
Li Yan

2014 ◽  
Vol 644-650 ◽  
pp. 1875-1878
Author(s):  
Su Yu Huang ◽  
Ping Fang Hu

XML has become the standard form of data exchange, more and more data in this form for storage, implying a lot of knowledge in these data information, the need for data mining processing. For XML data mining method at present, most of the need is to pass the XML data into relational data pretreatment process, using the traditional method for processing, data mining process is complex and the effect is not ideal. Therefore, there is an urgent need some effective methods for XML data mining directly.


2007 ◽  
Vol 3 (4) ◽  
pp. 212-217 ◽  
Author(s):  
Jinhyung Kim ◽  
Dongwon Jeong ◽  
Doo-Kwon Baik

Sign in / Sign up

Export Citation Format

Share Document