The design and analysis of spatial data structures
The design and analysis of spatial data structures
Multidimensional access methods
ACM Computing Surveys (CSUR)
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Querying the trajectories of on-line mobile objects
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
Mining frequent neighboring class sets in spatial databases
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Spatial Databases-Accomplishments and Research Needs
IEEE Transactions on Knowledge and Data Engineering
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
DynaMark: A Benchmark for Dynamic Spatial Indexing
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Indexing of Moving Objects for Location-Based Services
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Location management for next-generation personal communications networks
IEEE Network: The Magazine of Global Internetworking
DynaMark: A Benchmark for Dynamic Spatial Indexing
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
LORE: an infrastructure to support location-aware services
IBM Journal of Research and Development
ACM SIGMOBILE Mobile Computing and Communications Review
Efficient proximity detection among mobile targets with dead reckoning
Proceedings of the 4th ACM international workshop on Mobility management and wireless access
Edge indexing in a grid for highly dynamic virtual environments
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
Extending the LBS-framework TraX: Efficient proximity detection with dead reckoning
Computer Communications
Efficient clique detection among mobile targets
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
A system based on mobile agents to test mobile computing applications
Journal of Network and Computer Applications
Quick geo-fencing using trajectory partitioning and boundary simplification
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
An experimental analysis of iterated spatial joins in main memory
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Much attention has been accorded to Location-Based Services and location tracking, a necessary component in active, trigger-based LBS applications. Tracking the location of a large population of moving objects requires very high update and query performance of the underlying spatial index. In this paper we investigate the performance and scalability of three main-memory based spatial indexing methods under dynamic update and query loads: an R-tree, a ZB-tree, and an array/hashtable method. By leveraging the LOCUS performance evaluation testbed and the City Simulator dynamic spatial data generator, we are able to demonstrate the scalability of these methods and determine the maximum population size supported by each method, a useful parameter for capacity planning by wireless carriers.