Sciweavers

1888 search results - page 7 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 9 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
14 years 9 months ago
DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
Shan-Hung Wu, Kun-Ta Chuang, Chung-Min Chen, Ming-...
ICDCS
2005
IEEE
14 years 1 months ago
DSI: A Fully Distributed Spatial Index for Location-Based Wireless Broadcast Services
Recent announcement of the MSN Direct Service has demonstrated the feasibility and industrial interest in utilizing wireless broadcast for pervasive information services. To suppo...
Wang-Chien Lee, Baihua Zheng
VLDB
2009
ACM
208views Database» more  VLDB 2009»
14 years 8 months ago
A distributed spatial index for error-prone wireless data broadcast
Information is valuable to users when it is available not only at the right time but also at the right place. To support efficient location-based data access in wireless data broad...
Baihua Zheng, Wang-Chien Lee, Ken C. K. Lee, Dik L...
PODS
1993
ACM
122views Database» more  PODS 1993»
13 years 11 months ago
Towards an Analysis of Range Query Performance in Spatial Data Structures
In this paper, we motivate four di erent user de ned window query classes and derive a probabilistic model for each of them. For each model, we characterize the e ciency of spatia...
Bernd-Uwe Pagel, Hans-Werner Six, Heinrich Toben, ...