68 search results - page 9 / 14 » Privacy-preserving data publishing for horizontally partitio... |
PVLDB
2010
13 years 5 months ago
2010
Random perturbation is a promising technique for privacy preserving data mining. It retains an original sensitive value with a certain probability and replaces it with a random va...
EDBT
2009
ACM
14 years 4 days ago
2009
ACM
Traditional bitmap indexes are utilized as a special type of primary or clustered indexes where the queries are answered by performing fast logical operations supported by hardwar...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy preserving paradigms of k-anonymity and -diversity. k-a...
VLDB
2004
ACM
14 years 25 days ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...