Data Mining for XML Query-Answering Support along with Path-Join Algorithm

Gomathi G*, Vijayameena**
*-** Department of Information Technology, Dr. Sivanthi Aditanar College of Engineering. Thiruchendur, Tamil Nadu.
Periodicity:March - May'2014
DOI : https://doi.org/10.26634/jcom.2.1.2850

Abstract

Extensible Markup Language (XML) has become a de facto standard for storing, sharing and exchanging information across heterogeneous platforms. The XML content is growing day-by-day in rapid pace. Enterprises need to make queries on XML databases frequently. As huge XML data is available, it is a challenging task to extract required data from the XML database. It is computationally expensive to answer queries without any support. In this paper, the authors have presented a technique known as Tree-based Association Rules (TARs) mined rules that provide required information on structure and content of XML file and the TARs are also stored in XML format. The mined knowledge (TARs) is used later for XML query answering support. This enables quick and accurate answering. Distributed query processing is used to relate two or more databases using sedna tool. To search information from xml document, an algorithm called path-join algorithm is used. They also developed a prototype application to demonstrate the efficiency of the proposed system. The empirical results are very positive and query answering is expected to be useful in real time applications.

Keywords

XML, Query Answering Support, Data Mining, Tree-Based Association Rules, Sedna Tool, Path-Join Algorithm.

How to Cite this Article?

Gomathi, G., and Vijayameena, P. (2014). Data Mining For XML Query-Answering Support Along With Path-Join Algorithm. i-manager’s Journal on Computer Science, 2(1), 32-35. https://doi.org/10.26634/jcom.2.1.2850

References

[1]. R. Agrawal and R. Srikant, (1994). "Fast Algorithms for Mining Association Rules in Large Databases," Proc. 20th Int'l Conf. Very Large Data Bases, pp. 478-499.
[2]. T. Asai, H. Arimura, T. Uno, and S. Nakano, (2003). "Discovering Frequent Substructures in Large Unordered Trees," Technical Report DOI-TR 216, Dept. of Informatics, Kyushu Univ., http://www.i.kyushu-u.ac.jp/doitr/trcs216. pdf.
[3]. World Wide Web Consortium, (1998). Extensible Markup Language (XML) 1.0, http://www.w3C.org/TR/RECxml/.
[4]. X. Yan and J. Han, (2003). "CloseGraph: Mining Closed Frequent Graph Patterns," Proc. Ninth ACM Int'l Conf. Knowledge Discovery and Data Mining, pp. 286- 295.
[5]. K. Wang and H. Liu, (1998). "Discovering Typical Structures of Documents: A Road Map Approach," Proc. 21st Int'l Conf. Research and Development in Information Retrieval, pp. 146-154.
[6]. Y. Xiao, J.F. Yao, Z. Li, and M.H. Dunham, (2003). "Efficient Data Mining for Maximal Frequent Subtrees," Proc. IEEE Third Int'l Conf. Data Mining, pp. 379-386.
[7]. M.J. Zaki, (2005). "Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications," IEEE Trans. Knowledge and Data Eng., Vol. 17, No. 8, pp. 1021-1035, Aug.
[8]. G. Marchionini, (2006). "Exploratory Search: From Finding to Understanding," Comm. ACM, Vol. 49, No. 4, pp. 41-46.
[9]. Quanzhong Li and Bongki Moon. (2001). Indexing and querying XML data for regular path expressions. In Proceedings of the 27th VLDB Conference, Rome, Italy, pp.361-370.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.