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

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. Howev...

Full description

Saved in:
Bibliographic Details
Published inJournal of information science Vol. 42; no. 4; pp. 568 - 578
Main Authors Kung, Yi-Wei, Chang, Hsu-Kuang, Lee, Chung-Nan
Format Journal Article
LanguageEnglish
Published London, England SAGE Publications 01.08.2016
Bowker-Saur Ltd
Subjects
Algorithms
Ambiguity
Diversification
Extensible Markup Language
Lists
Queries
AL list
query diversification
QTP
XML
extended TJSwift
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0165-5515
1741-6485
DOI:10.1177/0165551515601004