Research Article
Optimization of Association Rule in Horizontally Distributed Database using Unique Key Value
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 139 - Issue 8 |
| Published: April 2016 |
| Authors: Madhuri Mahajan, Sonal Patil |
10.5120/ijca2016909218
|
Madhuri Mahajan, Sonal Patil . Optimization of Association Rule in Horizontally Distributed Database using Unique Key Value. International Journal of Computer Applications. 139, 8 (April 2016), 1-3. DOI=10.5120/ijca2016909218
@article{ 10.5120/ijca2016909218,
author = { Madhuri Mahajan,Sonal Patil },
title = { Optimization of Association Rule in Horizontally Distributed Database using Unique Key Value },
journal = { International Journal of Computer Applications },
year = { 2016 },
volume = { 139 },
number = { 8 },
pages = { 1-3 },
doi = { 10.5120/ijca2016909218 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2016
%A Madhuri Mahajan
%A Sonal Patil
%T Optimization of Association Rule in Horizontally Distributed Database using Unique Key Value%T
%J International Journal of Computer Applications
%V 139
%N 8
%P 1-3
%R 10.5120/ijca2016909218
%I Foundation of Computer Science (FCS), NY, USA
Abstract
The proposed work describes the optimization of Association Rule for the distributed databases in terms of speed, memory used while transaction of distribution as well as extracting the data from various data sources in the network. The proposed work shall have two parts including distribution of data using Association rule and ensuring the search to be redirected to specific source based on key values used to create the sub set in association rule. The availability shall be tested by verifying if the specific source is ready or not if not the search for that part shall only be carried out on the server itself.
References
- R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. 1994.
- R. Agrawal and R. Srikant. Privacy-preserving data mining. In SIGMOD Conference, pages 439–450, 2000.
- D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In STOC, pages 503–513, 1990.
- M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Crypto, pages 1–15, 1996.
- A. Ben-David, N. Nisan, and B. Pinkas. FairplayMP - A system for secure multi-party computation. In CCS, pages 257–266, 2008.
- J.C. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret. In Crypto, pages 251–260, 1986.
- J. Brickell and V. Shmatikov. Privacy-preserving graph algorithms in the semi-honest model. In ASIACRYPT, pages 236–252, 2005.
- D.W.L. Cheung, J. Han, V.T.Y. Ng, A.W.C. Fu, and Y. Fu. A fast distributed algorithm for mining association rules. In PDIS, pages 31–42, 1996.
- D.W.L Cheung, V.T.Y. Ng, A.W.C. Fu, and Y. Fu. Efficient mining of association rules in distributed databases. IEEE Trans. Knowl. Data Eng., 8(6):911–922, 1996.
- T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469–472, 1985.
Index Terms
Keywords