An Efficient Xquery Keyword Using XML Query Processing

  • P. S. Satheesh, S. Selvakumaran, M. Pavithra Rao, S. Kavitha, V. Umarani, M. Mythily

Abstract

Extracting information from large amount of data is known as data mining which contains structured and semi structured data formats. Data mining includes prediction and analysis of the data. The system of query answering helps to make queries and improve the results for XML documents and reduced processing time even for big sized data files. In this paper, using wild card search is used for extracting the frequent pattern to maximize search results in library database. Tree based Association Rules (TAR) files offers considered information on the content and structure of XML file. Also to compare the proposed linear search algorithm using wild card search (pattern like ??,** and Multi keyword) with existing CM Tree Miner approach based on the evaluation of total matched file count, total elapsed time, time based efficient and file based efficient. Keywords: Tree Based Association Rules (TAR), wild card search, linear search algorithm, XML document, data mining.

Published
2020-01-08
How to Cite
P. S. Satheesh, S. Selvakumaran, M. Pavithra Rao, S. Kavitha, V. Umarani, M. Mythily. (2020). An Efficient Xquery Keyword Using XML Query Processing. International Journal of Advanced Science and Technology, 29(1), 1844 - 1852. Retrieved from http://sersc.org/journals/index.php/IJAST/article/view/38078
Section
Articles