Sciweavers

168 search results - page 7 / 34
» Incremental Distance Join Algorithms for Spatial Databases
Sort
View
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
14 years 7 days ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
DEXA
2003
Springer
193views Database» more  DEXA 2003»
14 years 1 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
DASFAA
2006
IEEE
183views Database» more  DASFAA 2006»
14 years 1 months ago
Probabilistic Similarity Join on Uncertain Data
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the n...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 9 months ago
Closest-Point-of-Approach Join for Moving Object Histories
In applications that produce a large amount of data describing the paths of moving objects, there is a need to ask questions about the interaction of objects over a long recorded ...
Subramanian Arumugam, Chris Jermaine
SIGMOD
2004
ACM
161views Database» more  SIGMOD 2004»
14 years 8 months ago
Approximation Techniques for Spatial Data
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald