Searching Moving Objects in a Spatio-temporal Distributed Database Servers System

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.

[1]  Craig A. Knoblock,et al.  Efficiently querying moving objects with pre-defined paths in a distributed environment , 2001, GIS '01.

[2]  Edith Cohen,et al.  Refreshment policies for Web content caches , 2002, Comput. Networks.

[3]  Sriram Raghavan,et al.  Searching the Web , 2001, ACM Trans. Internet Techn..

[4]  Timos K. Sellis,et al.  Managing Trajectories of Moving Objects as Data Streams , 2004, STDBM.

[5]  Filippo Menczer,et al.  Search Engine-Crawler Symbiosis , 2002 .

[6]  Max J. Egenhofer,et al.  Advances in Spatial Databases , 1997, Lecture Notes in Computer Science.

[7]  Edith Cohen,et al.  Refreshment policies for Web content caches , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Marc Najork,et al.  Breadth-first crawling yields high-quality pages , 2001, WWW '01.

[9]  Hector Garcia-Molina,et al.  Efficient Crawling Through URL Ordering , 1998, Comput. Networks.

[10]  Mahesh K. Marina,et al.  Performance of route caching strategies in Dynamic Source Routing , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[11]  Yufei Tao,et al.  Historical spatio-temporal aggregation , 2005, TOIS.

[12]  Yannis Theodoridis,et al.  On the Generation of Spatiotemporal Datasets , 1999 .

[13]  Zhen Liu,et al.  Optimal Robot Scheduling for Web Search Engines , 1998 .

[14]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[15]  Jennifer Widom,et al.  Efficient Monitoring and Querying of Distributed, Dynamic Data via Approximate Replication , 2005, IEEE Data Eng. Bull..

[16]  Serge Abiteboul,et al.  Adaptive on-line page importance computation , 2003, WWW '03.

[17]  Sunil Prabhakar,et al.  Efficient CNG indexing in location-aware services , 2003, 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings..

[18]  Ricardo A. Baeza-Yates,et al.  Crawling a country: better strategies than breadth-first for web page ordering , 2005, WWW '05.

[19]  Prabhu Ram,et al.  The need for distributed asynchronous transactions , 1999, SIGMOD '99.

[20]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[21]  Cédric du Mouza,et al.  Web architectures for scalable moving object servers , 2002, GIS '02.

[22]  Christopher Olston,et al.  Finding (recently) frequent items in distributed data streams , 2005, 21st International Conference on Data Engineering (ICDE'05).

[23]  Torsten Suel,et al.  Design and implementation of a high-performance distributed Web crawler , 2002, Proceedings 18th International Conference on Data Engineering.