SIGN IN
SIGN UP
Multidimensional binary search trees used for associative searching
Full Text:
PDF
Buy this Article
Author:
Jon Louis Bentley
Stanford Univ., Stanford, CA
Published in:
· Magazine
Communications of the ACM
CACM Homepage
archive
Volume 18 Issue 9, Sept. 1975
Pages 509-517
ACM
New York, NY
, USA
table of contents
doi>
10.1145/361002.361007
1975 Article
Bibliometrics
· Downloads (6 Weeks): 103
· Downloads (12 Months): 844
· Downloads (cumulative): 9,125
· Citation Count: 640
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
associative retrieval
attribute
binary search trees
binary tree insertion
design
graph and tree search strategies
information retrieval system
intersection queries
key
nearest neighbor queries
partial match queries
performance
retrieval models
theory
trees
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder