60 search results - page 10 / 12 » Data-Parallel Spatial Join Algorithms |
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...
WCRE
2002
IEEE
14 years 12 days ago
2002
IEEE
As new computer architectures are developed to exploit large-scale data-level parallelism, techniques are needed to retarget legacy sequential code to these platforms. Sequential ...
ICDE
2005
IEEE
14 years 8 months ago
2005
IEEE
Moving objects databases managing spatial objects with continuously changing position and extent over time have recently found large interest in the database community. Queries ab...
DASFAA
2004
IEEE
13 years 11 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...