XDMA: A dual indexing and mutual summation based keyword search algorithm for XML databases

Citation

Selvaganesan, S. and Haw, Su Cheng and Soon, Lay Ki (2014) XDMA: A dual indexing and mutual summation based keyword search algorithm for XML databases. International Journal of Software Engineering and Knowledge Engineering, 24 (4). p. 591. ISSN 1793-6403

Full text not available from this repository.

Abstract

Achieving the effectiveness in relation to the relevance of query result is the most crucial part of XML keyword search. Developing an XML Keyword search approach which addresses the user search intention, keyword ambiguity problems and query/search result grading (ranking) problem is still challenging. In this paper, we propose a novel approach called XDMA for keyword search in XML databases that builds two indices to resolve these problems. Then, a keyword search technique based on two-level matching between two indices is presented. Further, by utilizing the logarithmic and probability functions, a terminology that defines the Mutual Score to find the desired T-typed node is put forward. We also introduce the similarity measure to retrieve the exact data through the selected T-typed node. In addition, grading for the query results having comparable relevance scores is employed. Finally, we demonstrate the effectiveness of our proposed approach, XDMA with a comprehensive experimental evaluation using the datasets of DBLP, WSU and eBay.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Computing and Informatics (FCI)
Depositing User: Ms Nurul Iqtiani Ahmad
Date Deposited: 23 Oct 2014 06:33
Last Modified: 23 Oct 2014 06:33
URII: http://shdl.mmu.edu.my/id/eprint/5791

Downloads

Downloads per month over past year

View ItemEdit (login required)