XML-REG: Transforming XML Into Relational Using Hybrid-Based Mapping Approach

Song, Emyliana; Haw, Su-Cheng

doi:10.1109/access.2020.3026006

Cited by 5 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For a long time, XML, or extensible markup language, has become the Web's de facto standard for data exchange and representation [1][2][3]. Indeed, XML has attracted broad acceptance and support from all of the major providers of databases, servers, and software tools [4,5]. XML is a hierarchical, self-describing semi-structured data format that employs an easy-to-write and easy-to-parse syntax to simplify data interchange across a variety of Web-based applications [5][6][7].…”

Section: Introductionmentioning

confidence: 99%

“…Indeed, XML has attracted broad acceptance and support from all of the major providers of databases, servers, and software tools [4,5]. XML is a hierarchical, self-describing semi-structured data format that employs an easy-to-write and easy-to-parse syntax to simplify data interchange across a variety of Web-based applications [5][6][7]. It provides communication across multiple computing systems, which was previously extremely difficult, if not impossible.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient Prefix-Based Labeling Scheme for XML Dynamic Updates Using Hexagonal Pattern

Qtaish¹,

Alshudukhi²

2022

IEEE Access

View full text Add to dashboard Cite

To improve XML query processing, it is necessary to label XML documents efficiently for the indexing process because it allows the structural relationships between the XML nodes to be preserved without having to access the original document. However, XML data on the Web is updated as time passes, which means that the dynamic updating of XML data is an issue that may need to be handled by a XML labeling scheme specifically designed for dynamic updates. Previous XML labeling schemes have limitations when updates take place. For example, a lot of node labels need to be relabeled, a lot of duplicate labels occur during this relabeling process, and the size and time costs of the updated labels are high. Therefore, this paper proposes an efficient prefix-based labeling scheme that uses a hexagonal pattern. The proposed labeling scheme has three main advantages: (i) it avoids the need for node relabeling when XML documents are updated at random locations, (ii) it avoids duplicated labels by creating a new label for every inserted node, and (iii) it reduces the size and time costs of the updated labels. The proposed scheme is evaluated against the three most recent prefix-based labeling schemes in terms of the size and time costs of the updated labels. In addition, the ability of the proposed labeling scheme to handle several updates (such as insertions) in XML documents is also evaluated. The evaluations show that the proposed labeling scheme outperforms previously developed prefix-based labeling schemes in terms of both size and time costs, particularly for large-scale XML datasets, resulting in improved query processing performance. Moreover, the proposed scheme efficiently supports frequent updates at arbitrary positions. The paper concludes with several suggestions for further research.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An Efficient Prefix-Based Labeling Scheme for XML Dynamic Updates Using Hexagonal Pattern

Qtaish¹,

Alshudukhi²

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…1,2 Since the emergence of XML, many approaches to map XML into Relational DataBase (RDB) have existed. 3,4 Dynamic Prefix-based Labeling Scheme (DPLS) 5 extended the Dewey scheme 6,7 and is based on a two stage approach: (i) constructing the initial DPLS labeling and (ii) handling any updates. Alsubai and North 8 proposed a Child Prime Label (CPL) based on the prime number on the XML tree.…”

Section: Introductionmentioning

confidence: 99%

“… 1 , 2 Since the emergence of XML, many approaches to map XML into Relational DataBase (RDB) have existed. 3 , 4 …”

Section: Introductionmentioning

confidence: 99%

Improving the support for XML dynamic updates using a hybridization labeling scheme (ORD-GAP)

et al. 2021

Self Cite

View full text Add to dashboard Cite

Background: As the standard for the exchange of data over the World Wide Web, it is important to ensure that the eXtensible Markup Language (XML) database is capable of supporting not only efficient query processing but also capable of enduring frequent data update operations over the dynamic changes of Web content. Most of the existing XML annotation is based on a labeling scheme to identify each hierarchical position of the XML nodes. This computation is costly as any updates will cause the whole XML tree to be re-labelled. This impact can be observed on large datasets. Therefore, a robust labeling scheme that avoids re-labeling is crucial. Method: Here, we present ORD-GAP (named after Order Gap), a robust and persistent XML labeling scheme that supports dynamic updates. ORD-GAP assigns unique identifiers with gaps in-between XML nodes, which could easily identify the level, Parent-Child (P-C), Ancestor-Descendant (A-D) and sibling relationship. ORD-GAP adopts the OrdPath labeling scheme for any future insertion. Results: We demonstrate that ORD-GAP is robust enough for dynamic updates, and have implemented it in three use cases: (i) left-most, (ii) in-between and (iii) right-most insertion. Experimental evaluations on DBLP dataset demonstrated that ORD-GAP outperformed existing approaches such as ORDPath and ME Labeling concerning database storage size, data loading time and query retrieval. On average, ORD-GAP has the best storing and query retrieval time. Conclusion: The main contributions of this paper are: (i) A robust labeling scheme named ORD-GAP that assigns certain gap between each node to support future insertion, and (ii) An efficient mapping scheme, which built upon ORD-GAP labeling scheme to transform XML into RDB effectively.

show abstract

“…There have been multiple isolated researches comparing single or two data structure types, their usage advantages and disadvantages and specifics for their most compatible data. Typically, relational database and XML (Krishnamurthy et al, 2001;Ma et al, 2020;Shanmugasundaram et al, 2001;Song & Haw, 2020) or XML and JSON (Helland, 2017). But current research lacks a unified systematic approach that allows comparing various pairs of data structure types and their corresponding data, which is the perspective of this article.…”

Section: Introductionmentioning

confidence: 99%

Three Metric-Based Method for Data Compatibility Calculation

Vodňanský¹

2021

AIP

View full text Add to dashboard Cite

This article analyzes ways of calculating characteristics of data and most common data structure types that allow comparison between them or on a time axis. To achieve this, it studies the key aspects of relational databases, XML, JSON and RDF structure types. These data structure types are compared to multiple isolated approaches to data quality and other data characteristics measurements. The goals of the article are the calculation method itself and a storage structure for calculated values. The article presents a method of characterization of data and data structure types based on the calculation of three metrics: the amount of structuredness, the amount of hierarchicallity and the amount of information. This triad of metrics allows comparison between various data sets (objects), for example evaluating the complexity of the transformation of data from one data object to another, as well as with data structure types (as mentioned above). Based on the vector of three metrics, the calculation method of the compatibility between data and data structure type is proposed. This method can help select the most compatible data format for existing data. The calculated values of metrics can also detect non-optimal storage design and classify data transformations. The method was evaluated on an example case study, which showed its usability on an example demonstration data set. It can be used in the process of data modelling to help select optimal data structure type, to design a data transformation process and to optimize existing data storages.

show abstract

XML-REG: Transforming XML Into Relational Using Hybrid-Based Mapping Approach

Cited by 5 publications

References 17 publications

An Efficient Prefix-Based Labeling Scheme for XML Dynamic Updates Using Hexagonal Pattern

An Efficient Prefix-Based Labeling Scheme for XML Dynamic Updates Using Hexagonal Pattern

Improving the support for XML dynamic updates using a hybridization labeling scheme (ORD-GAP)

Three Metric-Based Method for Data Compatibility Calculation

Contact Info

Product

Resources

About