The week's pick
Random Articles
Reseach Article
Efficient Encrypted Data Distribution Vertically by Generating Frequent Pattern
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 142 - Number 9 |
| Year of Publication: 2016 |
| Authors: Preeti Pal Singh, Anjana Verma |
10.5120/ijca2016909898
|
Preeti Pal Singh, Anjana Verma . Efficient Encrypted Data Distribution Vertically by Generating Frequent Pattern. International Journal of Computer Applications. 142, 9 ( May 2016), 7-10. DOI=10.5120/ijca2016909898
Abstract
With the rapid increase in digital world servers security for data is highly required. So most of researcher have proposed different techniques such as data partition and modification. Here proposed work has resolve this issue of digital data security by vertical partition and AES encryption algorithm. In this work vertical patterns are generate from the database by the use of aprior algorithm of association rule mining. These patterns effectively distribute data for different sites. While ach site maintain an index table of inserted rows for proper database operations. Experiment is done on real adult dataset. Results shows that proposed work is better as compare to previous existing algorithm on different evaluation parameters.
References
- Abedjan, Z., Grütze, T., Jentzsch, A., Naumann, F.: Mining and profiling RDF data with ProLOD++. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 1198–1201(2014).
- Rostin, A., Albrecht, O., Bauckmann, J., Naumann, F., Leser,U.: A machine learning approach to foreign key discovery. In: Proceedings of the ACM SIGMOD Workshop on the Web and Databases (WebDB) (2009)
- Thorsten Papenbrock, Jens Ehrlich, Jannik Marten, Tommy Neubert, Jan-Peer Rudolph, Martin Schonberg, Jakob Zwiener and Felix Naumann, “Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms”, Proceedings of VLDB 2015.
- Huhtala, Y., Karkkainen, J., Porkka, P., and Toivonen, H., (1999), TANE: An Efficient Algorithm for discovering Functional and Approximate Dependencies, The Computer Journal, V.42, No.20, pp.100-107.
- Huhtala, Y., Karkkainen, J., Porkka, P., and Toivonen, Dependencies Using Partitions, IEEE ICDE 1998.
- Shyue-liang Wang, Jenn-Shing Tsai and Been-Chian Chien, “Mining Approximate Dependencies Using Partitions on Similarity-relation-based Fuzzy Databases”, IEEE International Conference on Systems, Man and Cybernetics(SMC) 1999.
- Yao, H., Hamilton, H., and Butz, C., FD_Mine: Discovering Functional dependencies in a Database Using Equivalences, Canada, IEEE ICDM 2002.
- Wyss. C., Giannella, C., and Robertson, E. (2001), FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances, Springer Berlin Heidelberg 2001.
- Russell, Stuart J. and Norvig, Peter. Arti cial Intelligence: A ModernApproach. Prentice Hall, 1995.
- Mannila, H. (2000), Theoretical Frameworks for Data Mining, ACM SIGKDD Explorations, V.1, No.2, pp.30-32.
- Stephane Lopes, Jean-Marc Petit, and Lotfi Lakhal, “Efficient Discovery of Functional Dependencies and Armstrong Relations”, Springer 2000.
- Heikki Mannila and Kari-Jouko R¨aih¨a. Design by example: An application of Armstrong relations. Journal of Computer and System Sciences, 33(2):126{141, 1986.
- Wenfei Fan, Jianzhong Li, Nan Tang, And Wenyuan Y. “Incremental Detection Of Inconsistencies In Distributed Data”. Ieee Transactions On Knowledge And Data Engineering, Vol. 26, No. 6, June 2014 1367
Index Terms
Keywords