A Caltech Library Service

CARTAM : the Cartesian Access Method for Data Structures with n-Dimensional Keys


Petersen, Stephen Vaughn (1979) CARTAM : the Cartesian Access Method for Data Structures with n-Dimensional Keys. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/va76-8270.


The Cartesian Access Method (CARTAM) is a data structure and its attendant access program designed to provide rapid retrievals from a data file based upon multi-dimensional keys: for example, using earth surface points defined by latitude and longitude, retrieve all points within x nautical miles. This thesis describes that data structure and program in detail and provides the actual routines as implemented on the International Business Machine (IBM) System/370 series of computers. The search technique is analogous to the binary search for a linear sorted file and seems to run in O(log(N)) time. An indication of the performance is the extraction, in less than 25 milliseconds CPU time on an IBM 370, Model 3033, of all points within a 10,000-foot circle from a geographic data base containing approximately 100,000 basic records.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:Computer Science
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Computer Science
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Thompson, Frederick B.
Thesis Committee:
  • Unknown, Unknown
Defense Date:20 September 1978
Record Number:CaltechTHESIS:02072018-133905871
Persistent URL:
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:10681
Deposited By: Benjamin Perez
Deposited On:07 Feb 2018 22:58
Last Modified:16 Apr 2021 22:23

Thesis Files

PDF - Final Version
See Usage Policy.


Repository Staff Only: item control page