A refined twig-join swift query algorithm for diversification issues of XML

Abstract

Compiling documents in extensible markup language (XML) plays an important role in accessing data services. An efficient query service should be based on a skillful representation that can support query diversification and solve ambiguity in order to improve high-precision search capabilities. However, to the best of our knowledge, research on query diversification, target hierarchical level and the problem of ambiguity is insufficient. In this study we aimed to solve these problems so that the results are able not only to satisfy query diversification, but also to offer better precision compared with the existing twig join algorithms. An extended twig join Swift (TJSwift) associated with adjacent linked lists for the provision of efficient XML query services is also proposed, whereby queries can be versatile in terms of predicates. It can completely preserve hierarchical information; in addition, the new index generated from XML is used to save semantic information.