Structural Twig Hash Indexing Scheme for XML Twig Query

Abstract

Since XML (eXtensible Markup) is the popular language for the data over the Internet, querying XML data is interested topic in research area. In order to efficiently process the XML query, indexing schemes are vital role in XML query processing systems. Structural path summary indexing scheme is efficiently support for path queries and achieve precise answer. It is also capable for solving the twig queries but additional join processing steps are needed to achieve precise answer. In this paper, the extendible hash table is proposed as twig indexing table. It is combined with existing 1-index (backward bisimilarity) structural path indexing scheme for processing twig queries that can be achieved precise answer. As a result, precise answers for twig query can be achieved without additional join processing steps. We have conducted on a series of experiments on the DBLP XML datasets to evaluate the performance of the proposed system.