Optimal composition of real-time systems
Artificial Intelligence
A data model for approximate query processing of real-time databases
Data & Knowledge Engineering
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Applying imprecise algorithms to real-time image and video transmission
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Solving time-dependent planning problems
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
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.