Privacy-Preserving Aggregate Queries for Optimal Location Selection Dotnet IEEE Projects


Today, tremendous measures of area information are gathered by different administration suppliers. The area information proprietors have a smart thought of where their clients are more often than not.   Other organizations likewise need to utilize this data for area investigation, for example, finding the ideal area for another branch.   However, area information proprietors can’t straightforwardly impart their information to different organizations, for the most part, because of protection and legitimate concerns.   In this paper, we propose protection saving arrangements in which location-based inquiries can be executed and replied by area information proprietors without imparting their information to different organizations and without getting to the client rundown of the organizations that send the inquiry.

Note: Please Scroll Down to See the Download Link.

Existing System:

To be steady, in this paper we allude the area information proprietor as the server,   what’s more, the business that solicitations inquiries as of the customer. We allude their clients as the clients of the server and the clients of the customer.

 The customer has existing offices, for example, branches of a bank, and expects to locate the ideal area for the better and brighter one among a few competitors.

 The customer can ask for an essential class of inquiries that can be utilized  in ideal area determination.

 In these questions, the customer just gets total data about areas of its clients without taking in the area of a particular client.

 The customer has a few contender for the new office and it can  ask for the inquiries for every competitor area and select the best  one. A straightforward case to these total inquiries is normal separation inquiry, in which the customer recovers the normal separation of its clients to their closest offices. The closest office of every client is the office that has the base separation to that client.

Proposed System:

We present a down to earth setting in which the customer (e.g., a business) runs a helpful class of area construct inquiries with respect to the database of the server (e.g., an area based specialist organization) without disregarding the security of people included both in the customer and the server side.

 2) We upgrade office area issues by removing the supposition that the client areas are known to the organizations. With the proposed solution, a business can locate the best area for another office among a few applicants without knowing its client areas.

 3) We present two novel question handling conventions for three unique sorts of inquiries, for example, RNN cardinality inquiry, normal separation question, and maximum remove inquiry that are utilized as an administration to recognize ideal office area.

System Requirements:

Hardware Requirements: 

  • System: Pentium IV 2.4 GHz.
  • Hard Disk: 40 GB.
  • Floppy Drive: 1.44 Mb.
  • Monitor: 15 VGA Colour.
  • Mouse: Logitech.
  • Ram: 512 Mb.

Software Requirements: 

  • Operating system: – Windows XP.
  • Coding Language: C#.Net
  • Database: SQL Server 2008

Download Base paper: Privacy-Preserving Aggregate Queries for Optimal

Leave a Reply

Your email address will not be published. Required fields are marked *