The week's pick
Reseach Article
A New Dimension to Improve the Query Performance using Disjoint Set Theory
| International Conference on Emerging Technology Trends |
| Foundation of Computer Science USA |
| ICETT2011 - Number 2 |
| None 2011 |
| Authors: M. Ranjit Reddy, M. Narasimhulu, M. Ashok |
| 0cbefc4e-e8c4-4aa4-b064-564f80096da3 |
M. Ranjit Reddy, M. Narasimhulu, M. Ashok . A New Dimension to Improve the Query Performance using Disjoint Set Theory. International Conference on Emerging Technology Trends. ICETT2011, 2 (None 2011), 5-8.
Abstract
An index improves the speed of data retrieval operations on a table. Index Management includes Creation, insertion, deletion & Updation. Reducing the access time of index even for more number of transactions will be our objective. Algorithms efficiency fell down when the index updation is occurring in the existing literature. Managing index is a tough task when the size of database increases. We are organizing clusters using disjoint set theory and a ranking algorithm. It will improve the performance of querying.
References
- Elena Baralis, Tania Cerquitelli, and Silvia Chiusano, “IMine: Index Support for Item Set Mining,” Proc. IEEE Trans. Knowledge and Data Eng., vol. 21, no. 4, April 2009.
- R. Agrawal and R. Srikant, “Fast Algorithm for Mining Association Rules,” Proc. 20th Int’l Conf. Very Large Data Bases (VLDB ’94), Sept. 1994.
- R. Agrawal, T. Imilienski, and A. Swami, “Mining Association Rules between Sets of Items in Large Databases,” Proc. ACM SIGMOD ’93 May 1993.
- J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation,” Proc. ACM SIGMOD, 2000.
- H. Mannila, H. Toivonen, and A.I. verkamo, “Efficient Algorithms for discovering Association Rules,” Proc. AAAI Workshop Knowledge Discovery in Databases (KDD ’94), pp. 181-192, 1994.
- A. Savasere, E. Omiecinski, and S.B. Navathe, “An Efficient Algorithm for Mining Association Rules in Large Databases,” Proc. 21st Int’l Conf. Very Large Data Bases (VLDB ’95), pp. 432- 444, 1995.
- H. Toivonen, “Sampling Large Databases for Association Rules,” Proc. 22nd Int’l Conf. Very Large Data Bases (VLDB ’96), pp. 134-145, 1996.
- M. El-Hajj and O.R. Zaiane, “Inverted Matrix: Efficient Discovery of Frequent Items in Large Datasets in the Context of Interactive Mining,” Proc. Ninth ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (SIGKDD), 2003.
- G. Grahne and J. Zhu, “Mining Frequent Itemsets from Secondary Memory,” Proc. IEEE Int’l Conf. Data Mining (ICDM ’04), pp. 91-98, 2004.
- G. Ramesh, W. Maniatty, and M. Zaki, “Indexing and Data Access Methods for Database Mining,” Proc. ACM SIGMOD Workshop Data Mining and Knowledge Discovery (DMKD), 2002.
- Y.L. Cheung, “Mining Frequent Itemsets Without Support Threshold: With and without Item Constraints,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 9, pp. 1052-1069, Sept. 2004.
- G. Cong and B. Liu, “Speed-Up Iterative Frequent Itemset Mining with Constraint Changes,” Proc. IEEE Int’l Conf. Data Mining (ICDM ’02), pp. 107-114, 2002.
- C.K.-S. Leung, L.V.S. Lakshmanan, and R.T. Ng, “Exploiting Succinct Constraints Using FP-Trees,” SIGKDD Explorations Newsletter, vol. 4, no. 1, pp. 40-49, 2002.
- R. Srikant, Q. Vu, and R. Agrawal, “Mining Association Rules with Item Constraints,” Proc. Third Int’l Conf. Knowledge Discovery and Data Mining (KDD ’97), pp. 67-73, 1997.
- T. Uno, M. Kiyomi, and H. Arimura, “LCM ver.2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets,” Proc. IEEE ICDM Workshop Frequent Itemset Mining Implementations (FIMI), 2004.
Index Terms
Keywords