Sciweavers

VLDB
2006
ACM
138views Database» more  VLDB 2006»
14 years 5 months ago
Succinct representation of flexible and privacy-preserving access rights
Abstract We explore the problem of portable and flexible privacy preserving access rights that permit access to a large collection of digital goods. Privacy-preserving access contr...
Marina Blanton, Mikhail J. Atallah
VLDB
2006
ACM
172views Database» more  VLDB 2006»
14 years 5 months ago
Hierarchical hippocratic databases with minimal disclosure for virtual organizations
Abstract The protection of customer privacy is a fundamental issue in today's corporate marketing strategies. Not surprisingly, many research efforts have proposed new privacy...
Fabio Massacci, John Mylopoulos, Nicola Zannone
VLDB
2006
ACM
122views Database» more  VLDB 2006»
14 years 5 months ago
A secure distributed framework for achieving k-anonymity
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous...
Wei Jiang, Chris Clifton
VLDB
2006
ACM
119views Database» more  VLDB 2006»
14 years 5 months ago
Efficient multivariate data-oriented microaggregation
Josep Domingo-Ferrer, Antoni Martínez-Ballesté, ...
VLDB
2006
ACM
171views Database» more  VLDB 2006»
14 years 5 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
VLDB
2006
ACM
190views Database» more  VLDB 2006»
14 years 5 months ago
Online summarization of dynamic time series data
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 5 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
VLDB
2006
ACM
124views Database» more  VLDB 2006»
14 years 5 months ago
Query optimization in XML structured-document databases
While the information published in the form of XML-compliant documents keeps fast mounting up, efficient and effective query processing and optimization for XML have now become mor...
Dunren Che, Karl Aberer, M. Tamer Özsu