Sciweavers

116 search results - page 13 / 24
» Privacy-Preserving Top-K Queries
Sort
View
ICDE
2010
IEEE
214views Database» more  ICDE 2010»
14 years 9 months ago
Differential Privacy via Wavelet Transforms
Privacy preserving data publishing has attracted considerable research interest in recent years. Among the existing solutions, -differential privacy provides one of the strongest p...
Xiaokui Xiao, Guozhang Wang, Johannes Gehrke
SPIRE
2005
Springer
14 years 3 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi
ADC
2007
Springer
145views Database» more  ADC 2007»
14 years 3 months ago
The Privacy of k-NN Retrieval for Horizontal Partitioned Data -- New Methods and Applications
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retr...
Artak Amirbekyan, Vladimir Estivill-Castro
VLDB
1999
ACM
127views Database» more  VLDB 1999»
14 years 1 months ago
Evaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
Surajit Chaudhuri, Luis Gravano
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
14 years 4 months ago
Approximate Structural Matching over Ordered XML Documents
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen