@article {73,
	title = {An efficient path query processing support for parent-child relationship in native XML databases},
	journal = {Journal of Digital Information Management},
	volume = {5},
	year = {2007},
	note = {Cited By (since 1996):4Export Date: 10 July 2014},
	month = {2007},
	pages = {82 - 87},
	abstract = {Due to its flexibility and efficiency in transmission of data, XML has become the emerging standard for data transfer and exchange across the Internet. In native XML database, XML documents are usually modeled as trees, and XML queries are typically specified in path expression. The primitive structural relationships are parent-child and ancestor-descendant in the path expression. Thus, finding all occurrences of these relationships is crucial. We adopt the decomposition-matching-merging approach and propose INLAB a novel hybrid query processing merging both indexing and labeling technologies, Experimental results show that INLAB can process XML path queries by up to an order of magnitude faster than conventional top-down approach.},
	keywords = {Matching, Path expression, Path query, Query evaluation, Query pattern, Query processing, XML},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-36048941577\&partnerID=40\&md5=7e045de46c15618285abdf54053caa5f},
	author = {Haw, S.-C. and Rao, G.S.V.R.K.}
}
@article {83,
	title = {Stack-based pattern matching algorithm for XML query processing},
	journal = {Journal of Digital Information Management},
	volume = {5},
	year = {2007},
	note = {Cited By (since 1996):4Export Date: 10 July 2014},
	month = {2007},
	pages = {167 - 174},
	abstract = {With the popularity of XML as data exchange over the Web, querying XML data has become an important issue to be addressed. Since the logical structure of XML is a tree, establishing a parent-child (P-C), ancestor-descendant (A-D) or sibling relationship between nodes is essential for structural query processing. Thus, we propose using a < self-level: parent> labeling scheme to encode each element in the XML database by its positional information. Based on this labeling scheme, we further propose our TwigINLAB algorithm to optimize the query processing. Experimental results indicate that TwigINLAB can process both path queries and twig queries better than the TwigStack algorithm on an average of 27\% and 14\% respectively in terms of execution time using the XMARK benchmark dataset.},
	keywords = {Labeling, Pattern matching, Query processing, Structural query, Twig query, XML},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-63149191050\&partnerID=40\&md5=a28a66080f0d1b4d84de686811194d9f},
	author = {Haw, S.-C. and Lee, C.-S.}
}
