FDewey Encoding: an Approach Based on Dewey for Storing an XML Document into Database
Irvanizam Irvanizam · 2014
Abstract. A technique of labeling node in a tree is necessarily implemented to perform queries in an XML data structure. This technique can be used because an XML document is able to be transformed into an XML tree. Dewey is one of old techniques for labeling node that re-labels some sibling nodes when a new node is inserted into the XML tree. In this paper, we propose an extended dewey approach, namely FDewey Encoding, to minimalize relabeling node when a new node in the tree is added. For a new node located in between two consecutive nodes,this encoding calculates the mean of those two nodes, and then uses it as a newlabel postfix. Relabeling node simply occurs when the mean value is smaller than a given epsilon value. Keywords: Dewey, FDewey, Insert, XML.