Skip to main content

A Retrieval Method for Real-Time Spatial Data Browsing

  • Conference paper
  • First Online:
  • 536 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2113))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G-XML. http://gisclh01.dpc.or.jp/gxml/contents-e.

  2. M. Boddy and T. Dean. Solving Time-Dependent Planning Problems. In Proceedings of IJCAI 89, pages 979–984, 1989.

    Google Scholar 

  3. S. Zilberstein and S. Russel. Optimal composition of real-time systems. Artificial Intelligence, 82(1-2):181–213, 1996.

    Article  MathSciNet  Google Scholar 

  4. K.-J. Lin, S. Natarajan, J. W.-S. Liu, and T. Krauskopf. Concord: A System of Imprecise Computation. In Proceedings of COMPSAC 87, pages 75–81. IEEE, 1987.

    Google Scholar 

  5. X. Huang and A.M.K. Cheng. Applying Imprecise Algorithms to Real-Time Image and Video Transmission. In Proceedings of Real-Time Technology and Applications Symposium, pages 96–101, 1995.

    Google Scholar 

  6. S.V. Vrbsky. A data model for approximate query processing of real-time databases. Data & Knowledge Engineering, 21:79–102, 1997.

    Article  Google Scholar 

  7. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In Proceedings of ACM SIGMOD Conference, pages 47–57, 1984.

    Google Scholar 

  8. Geographical Survey Institute. http://www.gsi.go.jp/ENGLISH.

  9. G.R. Hjaltason and H. Samet. Ranking in Spatial Databases. In Advances in Spatial Databases: 4th International Symposium, SSD’ 95 (LNCS-951), pages 83–95, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shiraishi, Y., Anzai, Y. (2001). A Retrieval Method for Real-Time Spatial Data Browsing. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-44759-8_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42527-4

  • Online ISBN: 978-3-540-44759-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics