An algorithm for generating MCCTree from XML document

Authors:
Ummu Sulaim Sazaly;Mohd Hasan Selamat;Salmi Baharom;Marzanah Ab. Jabar
Affiliations:
Department of Information System, Universiti Putra Malaysia, Serdang, Selangor, Malaysia;Department of Information System, Universiti Putra Malaysia, Serdang, Selangor, Malaysia;Department of Information System, Universiti Putra Malaysia, Serdang, Selangor, Malaysia;Department of Information System, Universiti Putra Malaysia, Serdang, Selangor, Malaysia
Venue:
ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
Year:
2011

Citing 5
Cited 0

On finding lowest common ancestors in trees

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
XRANK: ranked keyword search over XML documents

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient keyword search for smallest LCAs in XML databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Multiway SLCA-based keyword search in XML data

Proceedings of the 16th international conference on World Wide Web
Finding and ranking compact connected trees for effective keyword proximity search in XML documents

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Keyword query is an important research in information retrieval. Although many approaches have been proposed, searching for efficient and accurate approach to answer keyword query still continue. This paper presents a new algorithm to select and generate MCCTree from XML document called XMCCTree. This algorithm uses CLCA and MCLCA notions and considered as an enhancement of the previous CGTreeGenerator and MCCTreeGenerator algorithms. The objective of this algorithm's development is to improve the efficiency on generating MCCTree to answer keyword query in XML document.