An XML parser of efficient updates for a binary string: A case study

Abstract

In many emerging applications, such as XML publishing systems, electronic commerce and intelligent Web searching, ordered XML data are available in query processing. An XML query processing based on labeling schemes has been thoroughly studied in the past several years. However, all these techniques have high update cost, cannot completely avoid re-labeling in XML updates and increase the label size. This paper experiments a labeling scheme, called IBSL (Improved Binary String Labeling), which supports order sensitive updates without relabeling or recalculation. By using IBSL, University Web search has been considered as a separate case study using conventional Google search and applying IBSL algorithm along with the search. This paper reports that the IBSL algorithm is time efficient. © 2013 Springer.