A Dynamic Labeling Scheme Based on Logical Operators: A Support for Order-Sensitive XML Updates

Ghaleb, Taher Ahmed; Mohammed, Salahadin

doi:10.1016/j.procs.2015.07.416

Cited by 10 publications

(8 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A region-based labeling scheme utilize the tree traversal navigation to assign label on the nodes to preserve the ordering while ensuring the structural relationships are preserved. A prefix-based labeling schemes [3,12,13] is usually the most simple scheme as it directly encode a node's parent label as the prefix of its label. On the other hand, multiplicative labeling scheme usually assign label based on some arithmetic computation to identify the structural relationships among nodes.…”

Section: Literature Review 21 Review On Existing Labeling Schemesmentioning

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

Section: Literature Review 21 Review On Existing Labeling Schemesmentioning

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

show abstract

“…Inability to detect all the structural relationships is another weakness of the range based labeling schemes. • Prefix-based labeling schemes: In the schemes in this category [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25], each node label involves the label of its ancestor besides its own. The structural relationships are determined by looking at 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

“…However, space overhead and label size are not efficient. In Dynamic XDAS [10], the labels are generated based on masking technique; the authors use modified approach form [9] to incorporate dynamic updating of XML data.…”

Section: Related Workmentioning

confidence: 99%

CBSL − A Compressed Binary String Labeling Scheme for Dynamic Update of XML Documents

Gopinathan

Asawa²

2018

CIT

View full text Add to dashboard Cite

The growing volume of XML documents over the Web has increased the need for an efficient mechanism to facilitate query processing. Many labeling schemes have been introduced to optimize data retrieval and query processing on XML database documents. As it is known, labels hold information about XML tree nodes such as their position, their relationship with other nodes and their order, which helps in query processing. Most of the existing labeling schemes support query processing over static XML documents. However, they need to re-label during dynamic update. In this paper a compressed binary string labeling scheme is proposed which supports dynamic update of XML documents without re-labeling existing nodes. Analytical results show that the proposed labeling scheme takes less label size in comparison with other labeling schemes. Also, an experiment has been conducted to evaluate the label generation time as well as update processing. ACM CCS (2012) Classification: Information systems → World Wide Web → Web data description languages → Markup languages → Extensible Markup Language (XML) Information systems → Data management systems → Query languages → XML query languages

show abstract

A Dynamic Labeling Scheme Based on Logical Operators: A Support for Order-Sensitive XML Updates

Cited by 10 publications

References 5 publications

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

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

A new effective method for labeling dynamic XML data

CBSL − A Compressed Binary String Labeling Scheme for Dynamic Update of XML Documents

Contact Info

Product

Resources

About