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	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]
	2	W A Burkhard, "Interpolation-based index maintenance," Technical Report Number CS-053, University of California, San Diego, Department of Electrical Engineering and Computer Science
	3	Ronald Fagin , Jurg Nievergelt , Nicholas Pippenger , H. Raymond Strong, Extendible hashing—a fast access method for dynamic files, ACM Transactions on Database Systems (TODS), v.4 n.3, p.315-344, Sept. 1979  [doi>10.1145/320083.320092]
	4	R L Kashyap, S K C Subas and S B Yao, "Analysis of multiple-attribute tree database organization," IEEE Trans. on Soft. Eng., Vol SE-3(6), 451-466
	5	P Larson, "Linear hashing with partial expansions," Proc. 6th Inter. Conf. on Very Large Databases, Montreal, Canada, 224-232, (1980)
	6	P Larson, "Dynamic hashing," BIT, 18(2), 184-201, (1978)
	7	J H Liou and S B Yao, "Multidimensional clustering for database organizations," Information Systems, 2(4), 187-198, (1977)
	8	W Litwin, "Linear hashing A new tool for file and table addressing," Proc. Sixth Inter. Conf. on Very Large Databases, Montreal, Canada, 212-223, (1980)
	9	Witold Litwin, Trie hashing, Proceedings of the 1981 ACM SIGMOD international conference on Management of data, April 29-May 01, 1981, Ann Arbor, Michigan  [doi>10.1145/582318.582322]
	10	T H Merrett, "Multidimensional paging for efficient database querying," Proc. ICMOD '78 Inter. Conf. on Database Management Systems, Milan, Italy, 277-290, (1978)
	11	T H Merrett and E J Otoo, "Dynamic Multipaging A storage structure for large shared data banks," Proc. Second Inter. Conf. on Databases. Improving Usability and Responsiveness, P Scheuermann (ed), Academic Press 237-256, (1982)
	12	M Ouksel and P Scheuermann, "Multidimensional B-trees Analysis of dynamic behavior," BIT 21(4), 401-418, (1981)
	13	Mohamed Ouksel, Order-preserving dynamic hashing schemes for associative searching in data base systems, 1983
	14	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]
	15	James B. Rothnie, Jr. , Tomas Lozano, Attribute based file organization in a paged memory environment, Communications of the ACM, v.17 n.2, p.63-69, Feb. 1974  [doi>10.1145/360827.360831]
	16	P Scheuermann and M Ouksel, "Multidimensional B-trees for associative searching in database systems," Information Systems, 7(2), 123-137, (1982)
	17	P G Sorenson, et al, "Key-to-address transformation techniques," Infor., 16(1), 1-34, (1978)

• 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
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski