Synonyms
Algorithm
Definition
A data structure is information that is organized in a certain way in memory in order to access it more efficiently. The data structure makes it easier to access and modify data.
Main Text
There are many types of data structures. Some examples are stacks, lists, arrays, hash tables, queues, and trees. There is not a data structure that is efficient for every purpose, so there are many different types to use for many different problems or purposes. A data structure should be chosen so that it can perform many types of operations while using little memory and execution time. An example of a good data structure fit would be using a tree-type data structure for use with a database. Of course there may be many data structures that can be used for a specific problem. The choice in these cases is mostly made by preference of the programmer or designer.
Cross References
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Sperber, M. (2008). Data Structure. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_251
Download citation
DOI: https://doi.org/10.1007/978-0-387-35973-1_251
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30858-6
Online ISBN: 978-0-387-35973-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering