Abstract—The storage method for XML data in database will affect the efficiency of XML keywords querying, indexing and updating significantly. In most cases, the XPath sentences provided by user are not refined. These queries can often achieve minimization by deleting redundant parts. It means the minimized query is one of subsets of this query. Such kind of minimization query is method based on deleting queries. The steps are determining nodes relations, finding redundant nodes, deleting redundant nodes and sub-tree and obtain final minimization query tree. In this paper, we propose an improved XPath query minimization method based on deletion using simulation concept. Experiments analysis results show that with introduction of appropriate indexing and new algorithm, the XML keywords indexing efficiency can be significantly improved.
Index Terms—XML keyword query, XPath query, XML storage, XML database.
Zhen-Fang Li is with the School of Computer and Information Technology, Shanxi University, China (e-mail: lizfsmile@163.com).
[PDF]
Cite: Zhen-Fang Li, "An Effective XML Storage Method Based on Deleting XPath Query Minimization," International Journal of Future Computer and Communication vol. 2, no. 5, pp. 372-375, 2013.
