QTwig: A Structural Join Algorithm for Efficient Query Retrieval Based on Region-Based Labeling


Subramaniam, Samini and Haw, Su Cheng and Soon, Lay Ki and Koong, Kok Leong (2017) QTwig: A Structural Join Algorithm for Efficient Query Retrieval Based on Region-Based Labeling. International Journal of Software Engineering and Knowledge Engineering, 27 (02). pp. 321-342. ISSN 1793-6403

[img] Text
Restricted to Repository staff only

Download (1MB)


Dependability on XML has increased tremendously over the years. As such the need for efficient query processing technique is certainly important. Despite the fact that these techniques are able to process queries with various edge combinations, they still suffer from processing overheads by buffering large amount of intermediate results particularly for parent–child (P–C) edges. Therefore, in this paper, we propose architecture named ReLaQ, which comprises of two components, ReLab+ (node annotator) and QTwig (query processor) for efficient XML query processing. QTwig improves retrieval time by incorporating a pruning technique that avoids accessing irrelevant data during query processing. Experimental results indicated that ReLaQ superseded TwigStack for both path and twig queries using both regular- and skewed-structured datasets. In addition, this is also proven by means of correctness analysis of ReLaQ.

Item Type: Article
Uncontrolled Keywords: XML query processing, query optimization, query evaluation, structural join, labeling scheme, Hypertext systems
Subjects: Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science > QA76.75-76.765 Computer software
Divisions: Faculty of Computing and Informatics (FCI)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 30 Jul 2020 04:04
Last Modified: 30 Jul 2020 04:04
URII: http://shdl.mmu.edu.my/id/eprint/7008


Downloads per month over past year

View ItemEdit (login required)