Accession Number:

ADA061626

Title:

Multidimensional Binary Search Trees in Database Applications.

Descriptive Note:

Interim rept.,

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Bentley,Jon Louis

Report Date:

1978-09-08

Pagination or Media Count:

18.0

Abstract:

The multidimensional binary search tree abbreviated k-d tree is a data structure for storing multi-key records. This structure has been used to solve a number of problems in geometric data bases arising in statistics and data analysis. The purposes of this paper are to cast k-d trees in a database framework, to collect the results on k-d trees which have appeared since the structure was introduced, and to show how the basic data structure can be modified to facilitate implementation in large and very large databases. Author

Descriptors:

• *DATA BASES
• *SEARCHING
• COMPUTER PROGRAMMING

Subject Categories:

• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE