CFP last date
16 December 2024
Call for Paper
January Edition
IJAIS solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 16 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Ordered Frequent Itemsets Matrix Based On Fp-Tree Structure And Apriori Algorithm

Abdulkader M. Al-Badani Abdualmajed A. Al-Khulaidi
Random Articles
Reseach Article

Frequent XML Query Caching in ebXML based E-commerce Applications using Association Rule Mining

by Anju Vijayan, V. Uma, G. Aghila
journal cover thumbnail

International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 5 - Number 6
Year of Publication: 2013
Authors: Anju Vijayan, V. Uma, G. Aghila
10.5120/ijais13-450924

Anju Vijayan, V. Uma, G. Aghila . Frequent XML Query Caching in ebXML based E-commerce Applications using Association Rule Mining. International Journal of Applied Information Systems. 5, 6 ( April 2013), 8-11. DOI=10.5120/ijais13-450924

@article{ 10.5120/ijais13-450924,
author = { Anju Vijayan, V. Uma, G. Aghila },
title = { Frequent XML Query Caching in ebXML based E-commerce Applications using Association Rule Mining },
journal = { International Journal of Applied Information Systems },
issue_date = { April 2013 },
volume = { 5 },
number = { 6 },
month = { April },
year = { 2013 },
issn = { 2249-0868 },
pages = { 8-11 },
numpages = {9},
url = { https://www.ijais.org/archives/volume5/number6/454-0924/ },
doi = { 10.5120/ijais13-450924 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T17:58:38.657712+05:30
%A Anju Vijayan
%A V. Uma
%A G. Aghila
%T Frequent XML Query Caching in ebXML based E-commerce Applications using Association Rule Mining
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 5
%N 6
%P 8-11
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Mining frequent XML query patterns and caching the results can improve the performance of XML based systems. Temporal features of queries can be used to guide cache replacement. Many approaches have been proposed to mine frequent XML query patterns and caching the results. Those approaches mine frequent subquery patterns from historical queries. But for ebXML (electronic business using XML) based applications in e-commerce, most of the queries will be of same structure. In such cases instead of mining subqueries, frequent queries can be mined directly. In this work an efficient system for frequent XML query caching in ebXML based e-commerce applications is proposed which incorporates temporal features of frequent queries for cache replacement. Association rules are mined between frequent queries to discover temporal patterns among them. Semantically closer infrequent queries are clustered and their associations with frequent queries are also mined. These rules are used to guide cache replacement so that subsequent query results will not get replaced from cache.

References
  1. T. Chang, S. Chen, Frequent Xml Query pattern mining for ebXML applications in Ecommerce, Expert Systems with Applications, An International journal archive, Volume 39 Issue 2, February 2012, Pages 2183-2193.
  2. L. Chen, S. S. Bhowmick, L. T. Chia, Mining Positive and Negative Association Rules from XML Query Patterns for Caching, Proceedings of the 10th international conference on Database Systems, 2005, Pages 736-747.
  3. G. Li, J. Feng, J. Wang, Y. Zang, L. Zhou, Incremental pattern mining from xml queries for caching, Data Mining, Sixth International Conference on Computing & Processing Hardware /Software, 2006, Pages 350-361.
  4. L. H. Yang, M. L. Li, W. Hsu, Efficient mining of XML query patterns for caching, Proceedings of the 29th international conference on Very large data bases, 2003, Pages 69-80.
  5. C. Hua, Frequent Query Patterns Guided XML Caching and Materialization, Wireless Communications Networking and Mobile Computing, International Conference on Communication Networking Broadcasting, 2007, Pages 3673-3676.
  6. Y. Bei, G. Chen, L. Shou, X. Li, J. Dong , Bottom up discovery of frequent rooted unordered subtrees, Information sciences, Volume 179, Issues 1-2, 2 January 2009, Pages 70-88.
  7. X. Wu, C. Zhang, S. Zhang, Mining both positive and negative association rules. In Proc. of ICML, 2002, Pages 381-405.
  8. Jin, Z. Yong, Ye, S. Ping, ebXML compatible agent communication language, Proceedings of international conference on computational and information sciences, 2011, Pages 361-365.
  9. ebXML. Available from: http://www. ebxml. org/
Index Terms

Computer Science
Information Sciences

Keywords

requent XML query mining Frequent XML query caching ebXML

Powered by PhDFocusTM