Thumbnail
Access Restriction
Subscribed

Author Flajolet, Philippe ♦ Puech, Claude
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1986
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract A precise analysis of partial match retrieval of multidimensional data is presented. The structures considered here are multidimensional search trees $(\textit{k}-d-trees)$ and digital tries $(\textit{k}-d-tries),$ as well as structures designed for efficient retrieval of information stored on external devices. The methods used include a detailed study of a differential system around a regular singular point in conjunction with suitable contour integration techniques for the analysis of $\textit{k}-d-trees,$ and properties of the Mellin integral transform for $\textit{k}-d-tries$ and extendible cell algorithms.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1986-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 33
Issue Number 2
Page Count 37
Starting Page 371
Ending Page 407


Open content in new tab

   Open content in new tab
Source: ACM Digital Library