Sciweavers

3 search results - page 1 / 1
» The Asymmetric Approximate Anytime Join: A New Primitive wit...
Sort
View
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
13 years 6 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 4 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
14 years 4 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...