Sciweavers

1031 search results - page 38 / 207
» Managing the operator ordering problem in parallel databases
Sort
View
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 1 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
DAWAK
2005
Springer
14 years 1 months ago
A Decremental Algorithm for Maintaining Frequent Itemsets in Dynamic Databases
Data mining and machine learning must confront the problem of pattern maintenance because data updating is a fundamental operation in data management. Most existing data-mining alg...
Shichao Zhang, Xindong Wu, Jilian Zhang, Chengqi Z...
IPPS
2007
IEEE
14 years 2 months ago
Adaptive Distributed Database Replication Through Colonies of Pogo Ants
We address the problem of optimizing the distribution of partially replicated databases over a computer network. Replication is used to increase data availability in the presence ...
Sarah Abdul-Wahid, Razvan Andonie, Joseph Lemley, ...
DBPL
1999
Springer
122views Database» more  DBPL 1999»
14 years 17 hour ago
A Representation Independent Language for Planar Spatial Databases with Euclidean Distance
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
Gabriel M. Kuper, Jianwen Su
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
14 years 1 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu