Sciweavers

475 search results - page 4 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
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
WWW
2003
ACM
14 years 6 months ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
DASFAA
2004
IEEE
124views Database» more  DASFAA 2004»
13 years 9 months ago
Polygon and Polyline Join Using Raster Filters
Processing spatial joins efficiently is crucial to rendering the spatial data analysis process feasible. As pointed out in many works, the exact intersection test of two spatial ob...
Rodrigo Salvador Monteiro, Leonardo Guerreiro Azev...
IIS
2004
13 years 7 months ago
Query Selectivity Estimation via Data Mining
Estimating the result size of a join is an important query optimization problem as it determines the choice of a good query evaluation strategy. Yet, there are few efficient techni...
Jarek Gryz, Dongming Liang
SIGMOD
2003
ACM
152views Database» more  SIGMOD 2003»
14 years 6 months ago
Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects
In modern application domains such as multimedia, molecular biology and medical imaging, similarity search in database systems is becoming an increasingly important task. Especial...
Hans-Peter Kriegel, Stefan Brecheisen, Peer Kr&oum...