9 search results - page 2 / 2 » Search algorithms for multiway spatial joins |
ADBIS
2003
Springer
14 years 20 days ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
ISCI
2007
13 years 7 months ago
2007
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...