Prefix Labeling Schemes - Term Paper Example

As a solution to the overhead caused by there, prefix labeling schemes have been developed. In prefix labeling schemes, the introduction of a node on consecutive siblings does not trigger are. In range-based labeling schemes, the introduction cannot be computed from the existing solutions, and thus re is automatically triggered (Wu et al pp 1).To develop an efficient labeling scheme that can efficiently handle an ordered tree-structured data model, various scholars have focused much attention on labeling schemes with the aim of developing a scheme that is efficient and effective in handling ordered tree-structured data models.

This paper provides a review of different literature available on common labeling schemes.Web-based applications and information have in recent times increased in usage and acceptance. Significant development and research work have been put in to develop systems that are efficient and robust in managing the large pool of information that is available on the internet. As a result, the XML has become the most recognized standard of sharing the heterogeneous data that is available on the internet (Chang, 2012 pp235; Luo, 2009 pp132).

To accommodate the complex nature of the data, significant research has been done with the aim of developing an efficient search mechanism for the data. The focus of the research on many occasions is the efficiency of the searches by simplification of the query process. Since XML has been accepted as a standard of exchanging data on the internet, the improvement of its efficiency through the development of robust schemes has been identified as a potential method of reducing the cost of data searching.

Several schemes have been proposed and developed, for instance, Bruno et al (2002, pp115), which develops a method consisting of connected stacks.