Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Analysis of Request over Possible Clouds without Merged Duplicates

Author : R.Shanthi 1 V.Raghavi 2 B.Revathy 3 D.Sharon Sharmishtha 4 D.Shunmugapriya 5

Date of Publication :7th April 2016

Abstract: To realize entity resolution, unmerged duplicate, probabilistic database and top k queries in query sanalytics over database. To provide more secure data transmission. To protect unauthorized person from retrieval of data and security to the data packets by using information security system. Entity resolution approaches exhibit benefits when addressing the problem through unmerged duplicates instances describing real world objects are not merged based on thresholds or human intervention, instead relevant resolution information is employed for evaluating resolution decisions during query processing using possible world’s semantics. In this paper, we present the first known approach for efficiently handling complex analytical queries over probabilistic databases with unmerged duplicates.

Reference :

    1. Query Analytics over Probabilistic Databases with Unmerged Duplicates Ekaterini Ioannou and Minos Garofalakis. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 27, NO. 8, AUGUST 2015.
    2. One-Time Cookies: Preventing Session Hijacking Attacks with Stateless Authentication Tokens .IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 9, NO. 6, JUNE 2015.
    3. R. Fink, L. Han, and D. Olteanu, “Aggregation in probabilistic databases via knowledge compilation,” Proc. VLDB Endowment ,vol. 5, no. 5, pp. 490–501, 2012. [4]The Open Web Application Security Project (OWASP). CrosssiteScripting (XSS).http://www.owasp.org/index.php/Crosssite Scripting 2010.
    4. D. Wang, M. Franklin, M. Garofalakis, and J. Hellerstein,“Querying probabilistic information extraction,” Proc. VLDB Endowment, vol. 3, no. 1, pp. 1057–1067, 2010
    5. C. Aggarwal and P. Yu, “A survey of uncertain data algorithms and applications,” IEEE Trans. Knowl. Data Eng., vol. 21, no. 5, pp. 609–623, May 2009.
    6. C. Jackson and A. Barth. Force https: protecting highsecurity web sites from network attacks. In Proceeding of the ACM international conference on World Wide Web (WWW), 2008.
    7. Duplicate Record Detection: A Survey Ahmed K. Elmagar mid, Senior Member, IEEE, Panagiotis G .Ipeirotis, Member, IEEE Computer Society, and Vassilios S. Verykios, Member, IEEE Computer Society,2007.
    8. P. Andrit os, A. Fuxman, and R. Miller, “Clean answers over dirty databases: A probabilistic approach,” in Proc. 22nd Int. Conf. DataEng., 2006, p. 30.
    9. Jehiah. XSS - Stealing Cookies 101. http://jehiah.cz/a/xss-stealing-cookies-101, 2006.

Recent Article