96 search results - page 2 / 20 » A Cost Model and Index Architecture for the Similarity Join |
DAWAK
2005
Springer
13 years 10 months ago
2005
Springer
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
VLDB
1998
ACM
13 years 9 months ago
1998
ACM
Time of creation is one of the predominant (often implicit) clustering strategies found not only in Data Warehouse systems: line items are created together with their correspondin...
SBBD
2007
13 years 6 months ago
2007
Similarity joins in databases can be used for several important tasks such as data cleaning and instance-based data integration. In this paper, we explore ways how to support such ...
DEXA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The development of scalable parallel database systems requires the design of efficient algorithms for the join operation which is the most frequent and expensive operatio...
ADBIS
2009
Springer
13 years 9 months ago
2009
Springer
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...