Prefetching Tiled Internet Data Using a Neighbor Selection Markov Chain
IICS '01 Proceedings of the International Workshop on Innovative Internet Computing Systems
ADBIS '01 Proceedings of the 5th East European Conference on Advances in Databases and Information Systems
Adaptation of a Neighbor Selection Markov Chain for Prefetching Tiled Web GIS Data
ADVIS '02 Proceedings of the Second International Conference on Advances in Information Systems
A Design Pattern for Efficient Retrieval of Large Data Sets from Remote Data Sources
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Robustness of a Neighbor Selection Markov Chain in Prefetching Tiled Web Data
AISA '02 Proceedings of the First International Workshop on Advanced Internet Services and Applications
Journal of Parallel and Distributed Computing
Where the speed matters... zero-response-time search engine for small collections
ICADL'05 Proceedings of the 8th international conference on Asian Digital Libraries: implementing strategies and sharing experiences
| Hi-index | 0.00 |
Consider a geographic information system (GIS), which is set up as a Web server that allows users to query the database with a Web browser. As the query result may be huge and the network delay could be significant, we investigate the fundamental problem of how to deliver the query result efficiently over the network. In a conventional client-server database system, the commonly used application programming interface (API) is the so-called iterator-based interface in which a client queries the server with an ISQL statement and the result, which is called a result or active set, is generated. To retrieve the query result, multiple calls are made to the server and objects in the result set are retrieved sequentially. To enhance system performance, objects in a result set can also be retrieved in bulk by storing them in an array. In the Web environment, a database server is commonly implemented with a distributed object technology such as Java or CORBA. As network delay could be significant, the client memory spaces are limited, and varying, neither multiple calls nor bulk retrieval is a viable solution to this problem. We propose a technique by caching and piping the result set through a socket connection without forfeiting the iterator-based interface. We show that the proposed method is superior in delivering a query result in a LAN and in the Web environment. We then investigate how to retrieve and display geometric data in a map efficiently in a network environment. We show by experiments that, compared to other R-tree variants, the class of Multi-scale R-tree is an excellent indexing structure for supporting the display functionality in a GIS, especially when the system is set up as a Web server.