@article{1261,
  author = {Taher Ahmed Ghaleb, Salahadin Mohammed},
  title = {Novel Scheme for Labeling XML Trees based on Bits-masking and Logical Matching},
  journal = {Journal of Information Technology Review},
  year = {2013},
  volume = {4},
  number = {3},
  doi = {},
  url = {http://www.dline.info/jitr/fulltext/v4n3/3.pdf},
  abstract = {The eXtensible Mark-up Language rapidly has become a very powerful standard for the data exchange. Labeling schemes have been introduced to optimize data retrieval and query processing on XML database documents. This is done by providing labels that hold information about XML tree nodes. In this paper we introduce a novel labeling scheme XDAS whose labeling technique is inspired by IP addressing and subnetting technique used in computer networks. This technique is used when dividing a network into several sub-networks. Each sub-network is assigned a subnet mask that helps in identifying the parent network. So, this labeling scheme treats XML documents as a network with sub-networks and assigns labels for XML tree nodes using the masking technique. Experimental results show that XDAS, when compared to Dewey and Range labeling schemes, provides an efficient label size, disk space required to store labels and matching time required to identify relationships between nodes.},
}