Sciweavers

4113 search results - page 580 / 823
» Watermarking Relational Databases
Sort
View
SIGKDD
2010
159views more  SIGKDD 2010»
15 years 2 months ago
Providing K-Anonymity in location based services
The offering of anonymity in relational databases has attracted a great deal of attention in the database community during the last decade [4]. Among the different solution appr...
Aris Gkoulalas-Divanis, Panos Kalnis, Vassilios S....
TDP
2010
124views more  TDP 2010»
15 years 2 months ago
Random Forests for Generating Partially Synthetic, Categorical Data
Abstract. Several national statistical agencies are now releasing partially synthetic, public use microdata. These comprise the units in the original database with sensitive or ide...
Gregory Caiola, Jerome P. Reiter
VLDB
2010
ACM
144views Database» more  VLDB 2010»
15 years 2 months ago
Methods for finding frequent items in data streams
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Graham Cormode, Marios Hadjieleftheriou
XSYM
2010
Springer
148views Database» more  XSYM 2010»
15 years 2 months ago
Promoting the Semantic Capability of XML Keys
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys...
Flavio Ferrarotti, Sven Hartmann, Sebastian Link, ...
ICDE
2010
IEEE
174views Database» more  ICDE 2010»
15 years 2 months ago
Semantic flooding: Search over semantic links
Abstract-- Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one le...
Fausto Giunchiglia, Uladzimir Kharkevich, Alethia ...