Menu

Related Work on XML Labelling Schemes

0 Comment

Native XML storage and query support have been the focus of much research due to the growing significance of managing XML data. This task is made more by the ordered tree-structured model of the data, which offers extensive semantic content. To query XML data, there is a need to adopt an effective and efficient labeling scheme. XML tree order and structural information, such as parent/child or ancestor/descendant are encoded into highly compact labels by labeling schemes. the result of significant research in the recent past. It is important to note that the metrics for a labeling scheme are the compactness of the encoded labels and the speed of the algorithm for both the creation and use of the labels. To develop an efficient labeling scheme that can handle an ordered tree-structured data model, various scholars have focused on the aim of developing a labeling scheme that is efficient and effective in handling both static and dynamic XML documents and these approaches are discussed below.

The first theme is different from the second because, in the first, only the overall approach to the functionality of the schemes is presented but in the second, there will be more detail into the schemes by reviewing the strengths, weaknesses, and limitations with these other labeling schemes. By so doing, it exposes the research challenges. Lastly, the literature review will identify the weaknesses and limitations of other labeling schemes to propose alternative ideas for a new scheme which helps to address the identified weaknesses and limitations.

Section 3.2 of the chapter provides an overview of the labeling schemes, while Section 3.3 presents common labeling schemes used to XML data along with their strengths and weaknesses, such as prefix-based schemes (Section 3.3.1), interval-based schemes (Section 3.3.2), multiplication-based schemes (Section 3.3.3) and vector-based schemes (Section 3.3.4).