Efficient XML query and update processing using a novel prime-based middle fraction labeling scheme

Qin, Z. H.; Tang, Yong; Tang, Feiyi; Xiao, Jing; Huang, Changqin; Xu, Hongyan

doi:10.1109/cc.2017.7897330

Cited by 7 publications

(9 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [26], the deleted labels are reused for encoding newly inserted nodes, which could effectively lower the label size. • Multiplication based labeling schemes: These schemes [5,[27][28][29][30][31][32][33][34][35] use prime numbers with multiplication and division operations to determine the relationships among the nodes. Prime numbers are exploited in order to support the uniqueness of the labels.…”

Section: Related Workmentioning

confidence: 99%

A new effective method for labeling dynamic XML data

Khanjari

Gaeini

2018

J Big Data

View full text Add to dashboard Cite

IntroductionXML is a semi-structural and standard document format to exchange data. Elements in XML documents are regular and there are structural relationships between them [1]. In fact, processing queries in XML should recognize these structural relationships. They also should determine the order of elements in a document. Node labeling in XML data is one way to increase the efficiency of query processing. Labeling means allocating a unique identifier to each node in XML documents [2]. A labeling scheme encompasses traversal or browsing the document, analyzing the elements, and assessing available relationships between elements. So, it should generate small enough labels in order to be processed efficiently both in initial label assigning as well as when queries are issued.A challenging problem of the existing labeling schemes is the need for relabeling nearly all the existing nodes after inserting new nodes in XML documents. While update in XML data is a usual operation in many real-world applications, e.g. stream data, relabeling will influence the query performance, especially when large-size labels are assigned Abstract Query processing based on labeling dynamic XML documents has gained more attention in the past several years. An efficient labeling scheme should provide small size labels keeping the simplicity of the exploited algorithm in order to avoid complex computations as well as retaining the readability of structural relationships between nodes. Moreover, for dynamic XML data, relabeling the nodes in XML updates should be avoided. However, the existing schemes lack the capability of supporting all of these requirements. In this paper, we propose a new labeling scheme which assigns variable-length labels to nodes in dynamic XML documents. Our method employs the FibLSS encoding scheme that exploits the properties of the Fibonacci sequence to provide variable-length node labels of appropriate size. In XML updating process, we add a new section only in the new node's label without relabeling the existing nodes while keeping the order of nodes as well as preserving the structural relationships. Our labeling method is scalable as it is not subject to overflow, and as the number of nodes to be labeled increases exponentially, the size of labels grows linearly, which makes it suitable for big datasets. It also has the best performance in computational processing costs compared to existing approaches. The results of the experiments confirm the advantages of our proposed method in comparison to state-of-the-art techniques.

show abstract

Section: Related Workmentioning

confidence: 99%

A new effective method for labeling dynamic XML data

Khanjari

Gaeini

2018

J Big Data

View full text Add to dashboard Cite

show abstract

“…When a labeling scheme is used, an XML query is similar to a relational database (RDB) query, which also depends on the indexing of nodes [1,27,28]. In addition, an ordered XML tree and structural relationships are encoded into lowest size of labels by labeling schemes [1,29]. However, when compared to alternative XML query approaches, an effective XML labeling system requires less storage space and offers more flexibility [30][31][32][33].…”

Section: Introductionmentioning

confidence: 99%

“…To address this issue, many labeling schemes have been developed. However, these schemes still have drawbacks in terms of their poor ability to efficiently support the dynamic updating of XML documents [1,3,29].…”

Section: Introductionmentioning

confidence: 99%

“…Existing labeling schemes can be classified into four main groups [1,3,30,51]: interval-based labeling schemes (also known as range-based labeling schemes) [11,23,42,[52][53][54][55][56], prefix-based labeling schemes [1,11,13,20,30,34,46,57], multiplicative-based labeling schemes [48,53,[58][59][60][61][62][63][64], and hybrid-based labeling schemes [11,29,30,65,66].…”

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

“…In this paper, we analyze some recent labeling schemes, with focus on the support during dynamic updates (insertion operation). The main types of insertion happen: (i) left-most insertion, (ii) right-most insertion, and (iii) in-between insertion [7,8,10]. Nevertheless, most of the current approaches still exhibit the needs of re-labeling when the reserved label has been used up.…”

Section: Introductionmentioning

confidence: 99%

ORD-GAP: a hybrid-based labeling schemes to support XML dynamic updates

Amin

Haw

Subramaniam

2020

IJEECS

View full text Add to dashboard Cite

<span>eXtensible Markup Language (XML) has been widely used as the standard for data exchange standard over the Internet. With the fast growing rate of data, especially with high updates, it is crucial to ensure that the XML is able to cope with frequent changes with very least effect on the existing structure. Therefore, in this paper, we investigate on the existing labeling schemes and mapping approaches to gauge a better understanding in terms of the robustness of the labeling schemes and the importance of the mapping schemes. Next, we propose ORD-GAP labeling schemes to identify the structural relationship among XML nodes and yet, it is persistent to re-labeling when new nodes are inserted. Subsequently, a mapping scheme is proposed to transform XML into Relational Database (RDB). Preliminary experimental evaluation demonstrated that the proposed approach achieve 66% better as compared to ORDPATH, and 56% better as compared to ME labeling in terms of data loading time. </span>

show abstract

Efficient XML query and update processing using a novel prime-based middle fraction labeling scheme

Cited by 7 publications

References 0 publications

A new effective method for labeling dynamic XML data

A new effective method for labeling dynamic XML data

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

ORD-GAP: a hybrid-based labeling schemes to support XML dynamic updates

Contact Info

Product

Resources

About