Sciweavers

736 search results - page 21 / 148
» Confidence-Aware Join Algorithms
Sort
View
DEXA
2004
Springer
83views Database» more  DEXA 2004»
14 years 1 months ago
Processing Ad-Hoc Joins on Mobile Devices
Abstract. Mobile devices are capable of retrieving and processing data from remote databases. In a wireless data transmission environment, users are typically charged by the size o...
Eric Lo, Nikos Mamoulis, David Wai-Lok Cheung, Wai...
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
13 years 19 days ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
14 years 1 months ago
Efficient Set Similarity Joins Using Min-prefixes
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...
Leonardo Ribeiro, Theo Härder
SIGMOD
1995
ACM
80views Database» more  SIGMOD 1995»
14 years 1 months ago
Join Queries with External Text Sources: Execution and Optimization Techniques
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing i...
Surajit Chaudhuri, Umeshwar Dayal, Tak W. Yan
DKE
2006
123views more  DKE 2006»
13 years 9 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...