Abstract—Compiling documents in extensible markup language (XML) increasingly requires access to data services which provide both rapid response and the precise use of search engines. Efficient data service should be based on a skillful representation that can support low complexity and high precision search capabilities. In this paper, a novel complete path representation (CPR) associated with a modified inverted index is presented for the provision of efficient XML data services, where queries can be versatile in terms of predicates. CPR can completely preserve hierarchical information, and the new index is used to save semantic information. The CPR approach can provide template-based indexing for fast data search. An experiment is also conducted for the evaluation of the CPR approach.
Index Terms—XML, DTD, complete path representation (CPR), structural summary tree (SST), versatile query.
H. K. Chang is with the Department of Information Engineering, I-Shou University, Taiwan, R. O. C. (e-mail: hkchang@isu.edu.tw). K. C. Hung is with Institute of Engineering Science and Technology, National Kaohsiung First University of Science and Technology, Kaohsiung, Taiwan, R. O. C. (e-mail: kchung@nkfust. edu.tw).
[PDF]
Cite:Hsu-Kuang Chang and King-Chu Hung, "Structural Summary Tree with Complete Path Representation for Intelligent Query of Social-Web Documents," International Journal of Computer Theory and Engineering vol. 5, no. 6, pp. 885-889, 2013.
