Sciweavers

430 search results - page 2 / 86
» An Efficient Parallel Join Algorithm Based On Hypercube-Part...
Sort
View
PVLDB
2010
195views more  PVLDB 2010»
13 years 1 days ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
DEXA
2005
Springer
77views Database» more  DEXA 2005»
13 years 10 months ago
An Optimal Skew-insensitive Join and Multi-join Algorithm for Distributed Architectures
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...
Mostafa Bamha
ISCC
2000
IEEE
13 years 8 months ago
An Efficient and Flexible Late Join Algorithm for Interactive Shared Whiteboards
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term `late join algorithm'...
Werner Geyer, Jürgen Vogel, Martin Mauve
EUROPAR
2001
Springer
13 years 9 months ago
An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
Sandra de F. Mendes Sampaio, Jim Smith, Norman W. ...
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
12 years 9 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge