basic storage and retrieval structures

DM-02 - Data retrieval strategies
  • Analyze the relative performance of data retrieval strategies
  • Implement algorithms that retrieve geospatial data from a range of data structures
  • Describe the particular advantages of Morton addressing relative to geographic data representation
  • Discuss the advantages and disadvantages of different data structures (e.g., arrays, linked lists, binary trees, hash tables, indexes) for retrieving geospatial data
  • Compare and contrast direct and indirect access search and retrieval methods
DM-01 - Basic data structures
  • Define basic data structure terminology (e.g., records, field, parent/child, nodes, pointers)
  • Analyze the relative storage efficiency of each of the basic data structures
  • Implement algorithms that store geospatial data to a range of data structures
  • Discuss the advantages and disadvantages of different data structures (e.g., arrays, linked lists, binary trees) for storing geospatial data
  • Differentiate among data models, data structures, and file structures
DM-02 - Data retrieval strategies
  • Analyze the relative performance of data retrieval strategies
  • Implement algorithms that retrieve geospatial data from a range of data structures
  • Describe the particular advantages of Morton addressing relative to geographic data representation
  • Discuss the advantages and disadvantages of different data structures (e.g., arrays, linked lists, binary trees, hash tables, indexes) for retrieving geospatial data
  • Compare and contrast direct and indirect access search and retrieval methods

Pages