Skip to main content

Spatial Constraint Databases, Indexing

  • Reference work entry
  • First Online:
Encyclopedia of GIS
  • 132 Accesses

Synonyms

Access structures for spatial constraint databases

Definition

Indexing structures are data structures used in computer science to store data. Indexing structures are closely associated with indexing methods or indexing algorithms that describe how to use the indexing structures correctly and efficiently to retrieve data, to insert data, or to modify or update data.

Indexing Methods

Sometimes retrieval only means checking whether a given record is in the indexing structure or not. In this case, only a “yes” or “no” answer needs to be returned. However, the retrieval of data is usually done on an associative basis, that is, a complex data with multiple components is to be retrieved based on one or more components that are given. For example, from an index structure of customer records, one may want to retrieve all those customer records which contain the street name “Apple Street.” There are more sophisticated retrieval problems where instead of exact match between the records...

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Anderson S, Revesz PZ (2009) Efficient MaxCount and threshold operators of moving objects. Geoinformatica 13(4):355–396

    Google Scholar 

  • Cai M, Revesz P (2000) Parametric R-tree: an index structure for moving objects. In: 10th international conference on management of data. McGraw-Hill, New Delhi, pp 57–64

    Google Scholar 

  • Chen Y, Revesz P (2004) Max-count aggregation estimation for moving points. In: 11th international symposium on temporal representation and reasoning. IEEE, Washington, pp 103–108

    Google Scholar 

  • Revesz P (2005) Efficient rectangle indexing algorithms based on point dominance. In: 12th international symposium on temporal representation and reasoning. IEEE, Washington, pp 210–212

    Google Scholar 

  • Revesz P, Chen Y (2003) Efficient aggregation over moving objects. In: 10th international symposium on temporal representation and reasoning. IEEE, Washington, pp 118–127

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Revesz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Revesz, P. (2017). Spatial Constraint Databases, Indexing. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_616

Download citation

Publish with us

Policies and ethics