Multiattribute hashing using gray codes

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 1986, Pages 227-238

  Faloutsos, Chrtatos ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS;

BINARY VALUES; CODE-WORDS; GRID FILES; MULTI-ATTRIBUTES; PARTIAL MATCHES; RANDOM DISK ACCESS; RANGE QUERY; RETRIEVAL METHODS;

BINARY CODES;

EID: 70349231809     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/16894.16877     Document Type: Conference Paper

References (20)

1. Aho, AV and JD Ullman, "Optimal Partial Match Retrieval When Fields are Independently Specified," ACM TODS, vol 4, no 2, pp 168-179, June 1979
2. Bentley, J L, "Multidimensional Binary Search Trees Used for Associative Searching," CACM, vol 18, no 9, pp 509-517, Sept 1975
3. Cardenas, A F, "Analysis and Performance of Inverted Data Base Structures," CACM, vol 18, no 5, pp 253-263, May 1975 Fagin79a
4. Fagin, R, J Nievergelt, N Pippenger, and H R Strong, "Extendible Hashing - A Fast Access Method for Dynamic Files," ACM TODS, vol 4, no 3, pp 315-344, Sept 1979
5. Faloutsos, C, "Gray Codes for Partial Match and Range Queries," IEEE Trans on Software Engineering, 1985
6. Submitted for publication Gilbert, E N, "Gray Codes and Paths on the n-Cube," Bell System Technical Journal, vol 37, no 3, pp 815-826, May 1958
7. Gray, F, Pulse Code Communications, U S Patent 2632058, March 17, 1953
8. Larson, P, "Dynamic Hashing," BIT, vol 18, pp 184-201, 1978
9. Larson, P A, "Performance Analysis of Linear Hashing with Partial Expansions," ACM TODS, vol 7, no 4, pp 566-587, Dec 1982
10. Litwin, W, "Linear Hashing A new Tool for File and Table Addressing," Proc 6th International Conference on VLDB, pp 212-223, Montreal, Oct 1980
11. Lloyd, JW, "Optimal Partial-Match Retrieval," BIT, vol 20, pp 406-413, 1980
12. Lloyd, J W and K Ramamohanarao, "Partial-Match Retrieval for Dynamic Files," BIT, vol 22, pp 150-168, 1982
13. Martin, GNN, "Spiral Storage Incrementally Augmentable Hash Addressed Storage," Theory of Computation, Report No 27, Univ of Warwick, Coventry, England, March 1979
14. Nievergelt, J, H Hinterberger, and K C Sevcik, "The Grid File An Adaptable, Symmetric Mul-tikey File Structure," ACM TODS, vol 9, no 1, pp 38-71, March 1984
15. Orenstein, J A and TH Merrett, "A Class of Data Structures for Associative Searching," Proc of SIGACT-SIGMOD, pp 181-190, Waterloo, Ontario, Canada, April 2-4, 1984
16. Ramamohanarao, K, J W Lloyd, and J A Thorn, "Partial-Match Retrieval Using Hashing and Descriptors," ACM TODS, vol 8, no 4, pp 552-576, Dec 1983
17. Reingold, E M, J Nievergelt, and N Deo, Combinatorial Algorithms Theory and Practice, Prentice-Hall Inc, Englewood Cliffs, New Jersey, 1977
18. Rivest, R L, "Partial Match Retrieval Algorithms," SIAM J Comput, vol 5, no 1, pp 19-50, March 1976
19. Robinson, JT, "The k-D-B-Tree A Search Structure for Large Multidimensional Dynamic Indexes," Proc ACM SIGMOD, pp 10-18, 1981
20. Rothnie, JB and T Lozano, "Attribute Based File Organization in a Paged Memory Environment," CACM, vol 17, no 2, pp 63-69, Feb 1974