Sciweavers

EDBT
2009
ACM
118views Database» more  EDBT 2009»
13 years 11 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin
POPL
2009
ACM
13 years 11 months ago
Declarative aspects of memory management in the concurrent collections parallel programming model
Concurrent Collections (CnC)[8] is a declarative parallel language that allows the application developer to express their parallel application as a collection of high-level comput...
Zoran Budimlic, Aparna Chandramowlishwaran, Kathle...
STACS
2010
Springer
13 years 11 months ago
Online Correlation Clustering
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...
Claire Mathieu, Ocan Sankur, Warren Schudy
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
ICDE
2005
IEEE
105views Database» more  ICDE 2005»
14 years 6 months ago
Representing and Querying Data Transformations
Modern information systems often store data that has been transformed and integrated from a variety of sources. This integration may obscure the original source semantics of data ...
John Mylopoulos, Renée J. Miller, Yannis Ve...