1390 search results - page 202 / 278 » Self-Sizing of Clustered Databases |
174
click to vote
VLDB
2008
ACM
15 years 10 months ago
2008
ACM
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
134
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
An extensive bibliometric study on the db community using the collaboration network constructed from DBLP data is presented. Among many, we have found that (1) the average distanc...
174
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
Peer-to-peer (p2p) systems are attracting increasing attention as an efficient means of sharing data among large, diverse and dynamic sets of users. The widespread use of XML as a...
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
K-anonymisation is an approach to protecting privacy contained within a dataset. A good k-anonymisation algorithm should anonymise a dataset in such a way that private information...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract— There are many applications in which users interactively access huge tree data by repeating set-based navigations. In this paper, we focus on label-specific/wildcard c...