Sciweavers

Share
116 search results - page 1 / 24
» Privacy-Preserving Top-K Queries
Sort
View
ICDE
2005
IEEE
147views Database» more  ICDE 2005»
12 years 7 months ago
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 sam...
Jaideep Vaidya, Chris Clifton
SIGMOD
2012
ACM
220views Database» more  SIGMOD 2012»
10 years 4 months ago
GUPT: privacy preserving data analysis made easy
It is often highly valuable for organizations to have their data analyzed by external agents. However, any program that computes on potentially sensitive data risks leaking inform...
Prashanth Mohan, Abhradeep Thakurta, Elaine Shi, D...
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
13 years 3 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
13 years 3 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
WWW
2006
ACM
13 years 2 months ago
A pruning-based approach for supporting Top-K join queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
Jie Liu, Liang Feng, Yunpeng Xing
books