Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Banks, G , Caplan, L R , and Hier, D B 1983 The Michael Reese Hospital Stroke Registry - A Mrcrocomputer-Implemented Data Base 7th Annual Symposium 0" Computer Applications~ Medical Care IEEE Computer Society 124-727-
	2	Beckley, D A , Evens, M W , and Raman. V K 1984 An Experiment With Balanced and Unbalanced K-D Trees for Associative Retrieval 0th Int Computer Software and Applications Conf Gceedings IEEE Computer Society IEEE Catalog NO 84CH2096-6 256-262
	3	Beckley, D A , Evers, M W , and Raman, V h 1985 Empirical Comparison of Assoclatlve File Structures International Conference on Foundations of Data Organization Kyo to, Japan May, -85(to be published)
	4	Jon Louis Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM, v.18 n.9, p.509-517, Sept. 1975  [doi>10.1145/361002.361007]
	5	Bentley, J L 1979 Multidimensional Binary Search Trees Used in Database Applications IEEE Transartions on Software Englneerlng Vol SE-5, No 4 333340
	6	Bentley, J L and Friedman, J H 1978 Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces IEEE Transactions on Computers Vol C-27, ho 2 97-105
	7	Bentley, J L 1979 Decomposable Searching Problems Information Processing Letters Vol 8, No 5 244-251
	8	Jon Louis Bentley , Jerome H. Friedman, Data Structures for Range Searching, ACM Computing Surveys (CSUR), v.11 n.4, p.397-409, Dec. 1979  [doi>10.1145/356789.356797]
	9	Jon Louis Bentley, Multidimensional divide-and-conquer, Communications of the ACM, v.23 n.4, p.214-229, April 1980  [doi>10.1145/358841.358850]
	10	Alfonso F. Cardenas, Evaluation and selection of file organization—a model and system, Communications of the ACM, v.16 n.9, p.540-548, Sept. 1973  [doi>10.1145/362342.362352]
	11	Alfonso F. Cárdenas, Analysis and performance of inverted data base structures, Communications of the ACM, v.18 n.5, p.253-263, May 1975  [doi>10.1145/360762.360766]
	12	Cardenas, A F , Sagamang, J P 1977 Doubly- Chained Tree Data Base Organization - Analysis and Design Strategies The Computer Journal Vol 20, No 1 15-26
	13	Chang, J M andFu, KS 1978 Dynamic Clustering Techniques for Physical Database Des lgn TR-EE 78-49, Paue University
	14	Chang, J M and Fu, K S 1979 Extended K-D A- IEEE Compu 79CH1515-6C 39-43 Tree Data Base Organization A Dynamic p*l+*- Attribute Clustering Method 3rd T-c F-, Software and Applications Conf ter Society IEEE Proceedings Catalog No
	15	J. M. Chang , K. S. Fu, A dynamic clustering technique for physical database design, Proceedings of the 1980 ACM SIGMOD international conference on Management of data, May 14-16, 1980, Santa Monica, California  [doi>10.1145/582250.582280]
	16	Douglas Comer, Ubiquitous B-Tree, ACM Computing Surveys (CSUR), v.11 n.2, p.121-137, June 1979  [doi>10.1145/356770.356776]
	17	Charles R. Dyer , Azriel Rosenfeld , Hanan Samet, Region representation: boundary codes from quadtrees, Communications of the ACM, v.23 n.3, p.171-179, March 1980  [doi>10.1145/358826.358838]
	18	Flnkel, R A and Bentley, 3 L 1974 A Data Structure for Retrieval on Composite Keys Acta Informatrca Vol 4 l-9
	19	Jerome H. Freidman , Jon Louis Bentley , Raphael Ari Finkel, An Algorithm for Finding Best Matches in Logarithmic Expected Time, ACM Transactions on Mathematical Software (TOMS), v.3 n.3, p.209-226, Sept. 1977  [doi>10.1145/355744.355745]
	20	Irene Gargantini, An effective way to represent quadtrees, Communications of the ACM, v.25 n.12, p.905-910, Dec 1982  [doi>10.1145/358728.358741]
	21	Lum, V Y , Ling, H , and Senko, M E Analysis of a Complex Data Management ACCeSS Method by Simulation Modeling AFIPS Proceedin@ of Fall Joint Computer Conference --- AFIPS Press, Arlington, Va Vol 37 211-222
	22	Overmars, M H and Van Leeuwen, Jan 1982 Dynamic Multi-Dimensional Data Structures Based on Quad- and K-d Trees Acta Informatlca Vol 17 267-285
	23	John T. Robinson, The K-D-B-tree: a search structure for large multidimensional dynamic indexes, Proceedings of the 1981 ACM SIGMOD international conference on Management of data, April 29-May 01, 1981, Ann Arbor, Michigan  [doi>10.1145/582318.582321]
	24	Hanan Samet, Region representation: quadtrees from boundary codes, Communications of the ACM, v.23 n.3, p.163-170, March 1980  [doi>10.1145/358826.358836]
	25	Hanan Samet, Deletion in two-dimensional quad trees, Communications of the ACM, v.23 n.12, p.703-710, Dec. 1980  [doi>10.1145/359038.359043]
	26	Hanan Samet, The Quadtree and Related Hierarchical Data Structures, ACM Computing Surveys (CSUR), v.16 n.2, p.187-260, June 1984  [doi>10.1145/356924.356930]
	27	Saxe, J B and Bentley, J L 1979 Transforming Static Data Str&tures to Dynamic Structures - 20th Annual IEEE S~~POSUUII Proc on Foundations of GumScGe Catalog No 79CHlRl-2 148-168 IEEE
	28	Snedecor, G W and Cochran, W G 1980 Statistical Methods 7th ed The Iowa State University Press Ames, Iowa
	29	James Edward Vandendorpe, A crash tolerant b-tree data structure for database retrieval systems, 1980
	30	Van Leeuwen, J and Overmars, M H 1983 Stratified Balanced Search Trees Acta Informatica Vol 18 345-359

• Constructing reality Proceedings of the 11th annual international conference on Systems documentation
  Douglas A. Powell ,  Norman R. Ball ,  Mansel W. Griffiths
  
  
• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  

• ACM SIGMOD Record
  Volume 14 ,  Issue 4   May 1985