Privacy-Preserving Top-K Queries

Processing of top-k queries has been attracting considerable attention. Much of the work assumes distributed data, with each site holding a different set of attributes for the same set of entities. These methods assume that all sites are happy with revealing the local order or scores of the entities. Privacy/security concerns faced by the individual sites can prohibit such disclosure. We present a mechanism through which only the result of the top-k query (i.e., the top-k entities) is returned while minimizing disclosure of other information.

• Type: Conference
• Year: 2005
• Where: ICDE
• Authors: Jaideep Vaidya, Chris Clifton
• Keywords: Considerable Attention, Database, ICDE 2005, Local Order, Top-k Queries