首页    期刊浏览 2024年11月13日 星期三
登录注册

文章基本信息

  • 标题:A Comparative Study on Confidentiality by Search Engines while Publishing Search Chunks
  • 本地全文:下载
  • 作者:Thappita SumaLatha ; Ch. Sandhya Rani ; Betam Suresh
  • 期刊名称:International Journal of Computer Trends and Technology
  • 电子版ISSN:2231-2803
  • 出版年度:2013
  • 卷号:4
  • 期号:8-4
  • 出版社:Seventh Sense Research Group
  • 摘要:The Database of Intentions is the aggregate results of every search ever entered, every result list ever tendered, and every path taken as a result. This information represents, in aggregate form, a place holder for the intentions of humankind – a massive database of desires, needs, wants, and likes that can be discovered, subpoenaed, archived, tracked, and exploited to all sorts of ends. On search engine millions of people searches for their query and every user having different search .The collection of user’s interaction in the form of search to the search engines known as Search chunks. Search engine companies collecting these Search chunks and want to publish these Search chunks because Search chunks becoming like a gold mines for research. But Search Engine Companies have to care about that they can publish Search chunks in order not to disclose their sensitive information. In this paper we are going to analyze techniques for publishing user’s search keywords, query, information, clicks etc from Search chunks by providing a limitation on their sensitive information. In Existing approach i.e. Privacypreserving data publishing (PPDP) having vulnerable variants which can leads to get attack on their search chunks. In this paper we are going to present an algorithm ZEALOUS .This algorithm having a large number of experimental study using real time application where we compare the work for achieves Kanonymity in search chunk publishing by using proposed and existing system.
  • 关键词:Search engine; log; Algorithm; privacy; k-anonymity
国家哲学社会科学文献中心版权所有