Computational geometry in C
The need for distributed asynchronous transactions
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
ACM Transactions on Internet Technology (TOIT)
Efficiently querying moving objects with pre-defined paths in a distributed environment
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Modern Information Retrieval
Web architectures for scalable moving object servers
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Refreshment policies for web content caches
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Efficient CNG Indexing in Location-Aware Sevices
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Finding (Recently) Frequent Items in Distributed Data Streams
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
Crawling a country: better strategies than breadth-first for web page ordering
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Complex Queries for Moving Object Databases in DHT-Based Systems
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
A meta-index for querying distributed moving object database servers
Information Systems
A P2P meta-index for spatio-temporal moving object databases
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
| Hi-index | 0.00 |
Querying about the time-varying locations of moving objects is particularly cumbersome in environments composed of a very large number of distributed spatio-temporal database servers In particular, searching for a specific object can require to visit each server In this paper we propose a strategy to avoid such an exhaustive search that is based on the use of a centralized index, called meta-index, which is the entry point for spatio-temporal search queries This index allows a software agent to determine a search plan for visiting the most likely servers to contain the target object An important issue for large and dynamic distributed servers systems is to keep the meta-index as up-to-date as possible with the real system This paper defines and compares two different strategies for maintaining properly updated the meta-index: crawling, where the centralized system that keeps the index controls itself the updating process, and harvesting, where each distributed database server autonomously transfers data directly into the central index system Both strategies were implemented and compared by using discrete-event simulators with demanding synthetic spatio-temporal data The results show that crawling has better performance.