A retrieval method for real-time spatial data browsing

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a retrieval method for real-time spatial data browsing through a computer network. This method is designed based on”anytime algorithm” that improves a quality of the processing results over time. The retrieval method decomposes a region specified in a query into sub-regions and searches at each decomposed region using a spatial index. The searched data are kept as the intermediate results for the query and these results are incrementally sent to a client. Consequently, the client can incrementally browse spatial data for the query. We implemented this retrieval system using Java language and constructed a map browsing system as a sample application. Through some experiments, we discussed the effectiveness of our retrieval system.

Cite

CITATION STYLE

APA

Shiraishi, Y., & Anzai, Y. (2001). A retrieval method for real-time spatial data browsing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2113, pp. 460–469). Springer Verlag. https://doi.org/10.1007/3-540-44759-8_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free