Sciweavers

146 search results - page 17 / 30
» Medoid Queries in Large Spatial Databases
Sort
View
DEXA
2010
Springer
213views Database» more  DEXA 2010»
13 years 11 months ago
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
CDES
2008
123views Hardware» more  CDES 2008»
13 years 11 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
MM
1999
ACM
155views Multimedia» more  MM 1999»
14 years 2 months ago
Multi-scale sub-image search
If an image should be retrieved by its subregions from a large image database, an immense number of possible queries will appear. Therefore, the index which encodes the spatial in...
Nicu Sebe, Michael S. Lew, Dionysius P. Huijsmans
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
14 years 11 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
GIS
2008
ACM
13 years 11 months ago
Snapshot location-based query processing on moving objects in road networks
Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location...
Haojun Wang, Roger Zimmermann