CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents

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 t...

Full description

Bibliographic Details
Main Authors: Dhanalekshmi Gopinathan, Krishna Asawa
Format: Article
Language:English
Published: University of Zagreb Faculty of Electrical Engineering and Computing 2018-01-01
Series:Journal of Computing and Information Technology
Online Access:http://hrcak.srce.hr/file/304240
id doaj-9e8be684c64a4682ac49482d41af9eae
record_format Article
spelling doaj-9e8be684c64a4682ac49482d41af9eae2020-11-24T23:42:45ZengUniversity of Zagreb Faculty of Electrical Engineering and ComputingJournal of Computing and Information Technology1330-11361846-39082018-01-012629911410.20532/cit.2018.1003955207048CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documentsDhanalekshmi Gopinathan0Krishna Asawa1Jaypee Institute of Information Technology Noida, Uttar PradeshJaypee Institute of Information Technology Noida, Uttar PradeshThe 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.http://hrcak.srce.hr/file/304240
collection DOAJ
language English
format Article
sources DOAJ
author Dhanalekshmi Gopinathan
Krishna Asawa
spellingShingle Dhanalekshmi Gopinathan
Krishna Asawa
CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents
Journal of Computing and Information Technology
author_facet Dhanalekshmi Gopinathan
Krishna Asawa
author_sort Dhanalekshmi Gopinathan
title CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents
title_short CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents
title_full CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents
title_fullStr CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents
title_full_unstemmed CBSL - A Compressed Binary String Labeling Scheme for Dynamic Update of XML documents
title_sort cbsl - a compressed binary string labeling scheme for dynamic update of xml documents
publisher University of Zagreb Faculty of Electrical Engineering and Computing
series Journal of Computing and Information Technology
issn 1330-1136
1846-3908
publishDate 2018-01-01
description 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.
url http://hrcak.srce.hr/file/304240
work_keys_str_mv AT dhanalekshmigopinathan cbslacompressedbinarystringlabelingschemefordynamicupdateofxmldocuments
AT krishnaasawa cbslacompressedbinarystringlabelingschemefordynamicupdateofxmldocuments
_version_ 1725503155314098176