The emergence of the Web has increased significant interests in querying XML data. In path queries, the primitive XML structural relationships are parent-child (P-C) and ancestor-descendant (A-D). Thus, finding all occurrences of these relationships is crucial for query processing. In this paper, we propose a novel hybrid query optimization technique, INLAB, comprising two main algorithms, createINLAB to create INLAB encoding and PathINLAB to process and optimize the query evaluation. Experimental results with several benchmarked datasets indicate that INLAB can process XML queries by up to an order of magnitude faster than conventional top-down approaches and several percent better than the current state-of-the-art approaches.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.