Rank-Based Inference Over Web Databases
In recent years, there has been much research in the adoption of ranked retrieval model (in addition to the Boolean retrieval model) in structured databases, especially those in a client-server environment (e.g., web databases). With this model, a search query returns top-k tuples according to not just exact matches of selection conditions, but a suitable ranking function. While much research has gone into the design of ranking functions and the efficient processing of top-k queries, this paper studies a novel problem on the privacy implications of database ranking.
Provided by: George Washington University Topic: Data Management Date Added: Feb 2015 Format: PDF