Sciweavers

354 search results - page 3 / 71
» Efficient Processing of Spatial Joins Using R-Trees
Sort
View
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
12 years 11 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
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
14 years 8 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
GEOINFO
2003
13 years 8 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICDE
1996
IEEE
127views Database» more  ICDE 1996»
14 years 8 months ago
Parallel Processing of Spatial Joins Using R-trees
Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard See...

Publication
344views
12 years 5 months ago
Top-k Similarity Join over Multi-valued Objects
The top-k similarity joins have been extensively studied and used in a wide spectrum of applications such as information retrieval, decision making, spatial data analysis and dat...
Wenjie Zhang, Jing Xu, Xin Liang, Ying Zhang, Xuem...