Authors: G. Dhanalekshmi; Asawa Krishna
Addresses: Department of Computer Science, Jaypeee Institute of Information Technology, Noida, Uttar Pradesh, India ' Department of Computer Science, Jaypeee Institute of Information Technology, Noida, Uttar Pradesh, India
Abstract: The increasing number of XML documents over the internet motivated us to develop indexing techniques to retrieve the XML data efficiently. Assigning unique labels to each node and determining the structural relationships is a critical problem in XML query processing. Labelling schemes designed for static XML documents will not support dynamic updates on XML documents. Some dynamic labelling schemes provide dynamic updates but, with a high cost and complexity. In this paper we propose a labelling scheme which supports the dynamic update without relabelling the existing nodes. It also determines the structural relationships efficiently by looking at the labels. A set of performance tests is carried to compute the time required to generate unique labels.
Keywords: XML query processing; dynamic updates; persistent labelling scheme; ancestor-descendant relationship; parent-child relationship; sibling relation; tree traversal; lexicographic order; XPath; labelling time; label size; XML documents; document updating; information retrieval.
International Journal of Web Science, 2014 Vol.2 No.4, pp.237 - 257
Available online: 15 Jul 2015 *Full-text access for editors Access for subscribers Purchase this article Comment on this article