Sciweavers

528 search results - page 7 / 106
» The Similarity Join Database Operator
Sort
View
HPCC
2007
Springer
15 years 3 months ago
Parallel Database Sort and Join Operations Revisited on Grids
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
Werner Mach, Erich Schikuta
ICDE
1998
IEEE
142views Database» more  ICDE 1998»
15 years 11 months ago
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
Current data repositories include a variety of data types, including audio, images and time series. State of the art techniques for indexing such data and doing query processing r...
Nick Koudas, Kenneth C. Sevcik
73
Voted
ADBIS
2000
Springer
82views Database» more  ADBIS 2000»
15 years 2 months ago
A New Algorithm for Page Access Sequencing in Join Processing
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
Andrew Lim, Wee-Chong Oon, Chi-Hung Chi
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
15 years 11 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
15 years 11 months ago
Hash-Merge Join: A Non-blocking Join Algorithm for Producing Fast and Early Join Results
This paper introduces the hash-merge join algorithm (HMJ, for short); a new non-blocking join algorithm that deals with data items from remote sources via unpredictable, slow, or ...
Mohamed F. Mokbel, Ming Lu, Walid G. Aref