CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents
Dhanalekshmi Gopinathan
; Jaypee Institute of Information Technology Noida, Uttar Pradesh
Krishna Asawa
; Jaypee Institute of Information Technology Noida, Uttar Pradesh
APA 6th Edition Gopinathan, D. i Asawa, K. (2018). CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents. Journal of computing and information technology, 26 (2), 99-114. https://doi.org/10.20532/cit.2018.1003955
MLA 8th Edition Gopinathan, Dhanalekshmi i Krishna Asawa. "CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents." Journal of computing and information technology, vol. 26, br. 2, 2018, str. 99-114. https://doi.org/10.20532/cit.2018.1003955. Citirano 01.03.2021.
Chicago 17th Edition Gopinathan, Dhanalekshmi i Krishna Asawa. "CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents." Journal of computing and information technology 26, br. 2 (2018): 99-114. https://doi.org/10.20532/cit.2018.1003955
Harvard Gopinathan, D., i Asawa, K. (2018). 'CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents', Journal of computing and information technology, 26(2), str. 99-114. https://doi.org/10.20532/cit.2018.1003955
Vancouver Gopinathan D, Asawa K. CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents. Journal of computing and information technology [Internet]. 2018 [pristupljeno 01.03.2021.];26(2):99-114. https://doi.org/10.20532/cit.2018.1003955
IEEE D. Gopinathan i K. Asawa, "CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents", Journal of computing and information technology, vol.26, br. 2, str. 99-114, 2018. [Online]. https://doi.org/10.20532/cit.2018.1003955
Sažetak 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.