18 search results - page 4 / 4 » Efficient Techniques for Online Record Linkage |
USENIX
1994
13 years 6 months ago
1994
As distributed computing systems grow in size, complexity and variety of application, the problem of protecting sensitive data from unauthorized disclosure and tampering becomes i...
ALGORITHMICA
2000
13 years 5 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...