An efficient path query processing support for parent-child relationship in native XML databases

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.