Skip to main content

Implementation of a Spatial Data Structure on a FPGA

  • Conference paper

Abstract

Many systems exist that store and manipulate data; however, many do no have sufficient support for spatial data Many data structures are proposed that are intended specifically for spatial data; however, software implementations have not performed as well as hoped. This work presents a feasibility study investigating the use of a FPGA for the implementation of a structure to support spatial search and retrieval.

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
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Osborn, W. The 2DR-tree: a 2-Dimensional Spatial Access Method. PhD Thesis, University of Calgary, 2004.

    Google Scholar 

  2. S impson, A., Hunter, J., Wylie, M., Hu, Y., and Mann, D. Demonstrating Real-Time JPEG Image Compression-Decompression Using Standard Component IP Cores on a Programmable Logic Based Platform for DSP and Image Processing. Proceedings of FPL 2001, LNCS 2147, Springer-Verlag, pp. 441-450, 2001.

    Google Scholar 

  3. Lee, H. and Ercal, F. RMESH Algorithms for Parallel String Matching. Proceedings of the 3rd International Symposium on Parallel Architectures, Algorithms and Networks (I- SPAN’97), pp. 223-226, 1997.

    Google Scholar 

  4. Gaede, V. and Guenther, O. Multidimensional Access Methods. ACM Computing Surveys, 30(2), pp. 170-231, 1998

    Article  Google Scholar 

  5. K. B. Kent, J. E. Rice, S. Van Schaick, and P. A. Evans. Hardware-Based Implementation of the Common Approximate Substring Algorithm. In Proceedings of the Euromicro Symposium on Digital System Design: Architectures, Methods and Tools (DSD), pages 314–320, 2005.

    Google Scholar 

  6. J. E. Rice and K. B. Kent. Systolic Array Techniques for Determining Common Approximate Substrings. In Proceedings of the International Symposium on Circuits and Systems (ISCAS), 2006. Paper number 1480 (CDROM).

    Google Scholar 

  7. K. B. Kent, R. B. Proudfoot, and Y. Zhao. Optimizing the Edit-Distance Problem. In Proceedings of the 17th International Workshop on Rapid System Prototyping (RSP), 2006. to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer

About this paper

Cite this paper

Rice, J., Osborn, W., Schultz, J. (2007). Implementation of a Spatial Data Structure on a FPGA. In: Elleithy, K. (eds) Advances and Innovations in Systems, Computing Sciences and Software Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6264-3_37

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-6264-3_37

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-6263-6

  • Online ISBN: 978-1-4020-6264-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics