Multidimensional Binary Search Trees in Database Applications.

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 08, 1978
Accession Number
ADA061626

Entities

People

  • Jon Louis Bentley

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programs
  • Computer Science
  • Computers
  • Data Analysis
  • Databases
  • Discriminators
  • Information Processing
  • Information Retrieval
  • Information Science
  • Mathematical Programming
  • North Carolina
  • Students
  • Trees (Data Structures)
  • Two Dimensional
  • Universities

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Database Systems and Applications
  • Forest Ecology