Sciweavers

PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 1 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
PODS
2003
ACM
157views Database» more  PODS 2003»
16 years 1 months ago
Algorithms for data migration with cloning
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers, or multimedia servers...
Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
PODS
2003
ACM
156views Database» more  PODS 2003»
16 years 1 months ago
Limiting privacy breaches in privacy preserving data mining
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
Alexandre V. Evfimievski, Johannes Gehrke, Ramakri...
PODS
2003
ACM
151views Database» more  PODS 2003»
16 years 1 months ago
Feasible itemset distributions in data mining: theory and application
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...
Database
Top of PageReset Settings