Sciweavers

59 search results - page 11 / 12
» Multi-Step Processing of Spatial Joins
Sort
View
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
14 years 7 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet
ICDCS
2007
IEEE
13 years 11 months ago
Stabilizing Peer-to-Peer Spatial Filters
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
Silvia Bianchi, Ajoy Kumar Datta, Pascal Felber, M...
ISCI
2007
141views more  ISCI 2007»
13 years 5 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
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...
Antonio Corral, Jesús Manuel Almendros-Jim&...
CAD
2004
Springer
13 years 5 months ago
Design formalism for collaborative assembly design
Joints in product design are common because of the limitations of component geometric configurations and material properties, and the requirements of inspection, accessibility, re...
Kyoung-Yun Kim, Yan Wang, Obinna S. Muogboh, Barth...
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
14 years 5 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias