Gray Codes for Partial Match and Range Queries

IEEE Transactions on Software Engineering

Volumn 14, Issue 10, 1988, Pages 1381-1393

  Faloutsos, Christos ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Distance preserving mappings; fractals; Gray codes; multiattribute hashing; partial match queries; secondary key retrieval; space filling curves

Indexed keywords

CODES, SYMBOLIC; COMPUTER AIDED DESIGN; INFORMATION RETRIEVAL SYSTEMS; VISION -- ARTIFICIAL;

DISTANCE-PRESERVING MAPPINGS; GRAY CODES; MULTIATTRIBUTE HASHING; PARTIAL MATCH QUERIES; SECONDARY KEY RETRIEVAL;

DATABASE SYSTEMS;

EID: 0024089394     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.6184     Document Type: Article

References (32)

1. A. V. Aho and J. D. Ullman, “Optimal partial match retrieval when fields are independently specified,” ACM Trans. Database Syst., vol. 4, no. 2, pp. 168-179, June 1979.
2. J. L. Bentley, “Multidimensional binary search trees used for associative searching,” Commun. ACM, vol. 18, no. 9, pp. 509-517, Sept. 1975.
3. H. Boral and S. Redfield, “Database machine morphology,” in Proc. 11th Int. Conf. VLDB, Stockholm, Sweden, Aug. 1985, pp. 59-71.
4. W. A. Burkhard, “Interpolation-based index maintenance,” in Proc. ACM Conf. PODS, 1983, pp. 76-89.
5. A. F. Cardenas, “Analysis and performance of inverted data base structures,” Commun. ACM, vol. 18, no. 5, pp. 253-263, May 1975.
6. J. P. Cheiney, P. Faudemay, R. Michel, and J. M. Thevenin, “A reliable parallel backend using multiattribute clustering and select-join operations,” in Proc. 12th Int. Conf. VLDB, Kyoto, Japan, Aug. 1986, pp. 220-227.
7. M. Chock, A. F. Cardenas, and A. Klinger, “Database structure and manipulation capabilities of a picture database management system (PICDMS),” IEEE Trans. Pattern Anal Machine Intell., vol. PAMI-6, no. 4, pp. 484-492, July 1984.
8. R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong, “Extendible hashing-A fast access method for dynamic files,” ACM Trans. Database Syst., vol. 4, no. 3, pp. 315-344, Sept. 1979.
9. E. N. Gilbert, “Gray codes and paths on the n-cube,” Bell Syst. Tech. J., vol. 37, no. 3, pp. 815-826, May 1958.
10. F. Gray, Pulse Code Communications, U.S. Patent 2 632 058, Mar. 17, 1953.
11. A. Guttman, “R-trees: A dynamic index structure for spatial searching,” in Proc. ACM S1GMOD, Boston, MA, June 1984, pp. 47-57.
12. R. Kowalski, “Logic for data description,” in Logic and Data Bases, J. Minker, Ed. New York: Plenum, 1978, pp. 77-103.
13. P. Larson, “Dynamic hashing,” BIT, vol. 18, pp. 184-201, 1978.
14. P. A. Larson, “Performance analysis of linear hashing with partial expansions,” ACM Trans. Database Syst., vol. 7, no. 4, pp. 566-587, Dec. 1982.
15. W. Litwin, “Linear hashing: A new Tool for file and table addressing,” in Proc. 6th Int. Conf. VLDB, Montreal, Oct. 1980, pp. 212-223.
16. J. W. Lloyd, “Optimal partial-match retrieval,” BIT, vol. 20, pp. 406-413, 1980.
17. J. W. Lloyd and K. Ramamohanarao, “Partial-match retrieval for dynamic files,” BIT, vol. 22, pp. 150-168, 1982.
18. G. N. N. Martin, “Spiral storage: Incrementally augmentable hash addressed storage,” Theory of Computation, Univ. Warwick, Coventry, England, Rep. 27, Mar. 1979.
19. J. Minker, “An experimental relational data base system based on logic,” in Logic and Data Bases, J. Minker, Ed. New York: Plenum, 1978.
20. L. Naish and J. A. Thorn, “The MU-prolog deductive database,” Dep. Comput. Sci., Univ. Melbourne, Tech. Rep. 83/10, 1983.
21. J. Nievergelt, H. Hinterberger, and K. C. Sevcik, “The grid file: An adaptable, symmetric multikey file structure,” ACM Trans. Database Syst., vol. 9, no. 1, pp. 38-71, Mar. 1984.
22. J. A. Orenstein and T. H. Merrett, “A class of data structures for associative searching,” in Proc. SIGACT-SIGMOD, Waterloo, Ont., Canada, Apr. 2-4, 1984, pp. 181-190.
23. J. K. Ousterhout, G. T. Hamachi, R. N. Mayo, W. S. Scott, and G. 5. Taylor, “Magic: A VLSI layout system,” in Proc. 21st Design Automation Conf, Alburquerque, NM, June 1984, pp. 152-159.
24. J. L. Pfaltz, W. H. Berman, and E. M. Cagley, “Partial match retrieval using indexed descriptor files,” Commun. ACM, vol. 23, no. 9, pp. 522-528, Sept. 1980.
25. K. Ramanohanarao, J. W. Lloyd, and J. A. Thorn, “Partial-match retrieval using hashing and descriptors,” ACM Trans. Database Syst., vol. 8, no. 4, pp. 552-576, Dec. 1983.
26. E. M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms: Theory and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1977.
27. R. L. Rivest, “Partial match retrieval algorithms,” SI AM J. Comput., vol. 5, no. 1, pp. 19-50, Mar. 1976.
28. J. T. Robinson, “The k-D-B-tree: A search structure for large multidimensional dynamic indexes,” in Proc. ACM SIGMOD, 1981, pp. 10-18.
29. J. B. Rothnie and T. Lozano, “Attribute based file organization in a paged memory environment,” Commun. ACM, vol. 17, no. 2, pp. 63-69, Feb. 1974.
30. N. Roussopoulos and D. Leifker, “Direct spatial search on pictorial databases using packed R-trees,” in Proc. ACM SIGMOD, Austin, TX, May 1985.
31. J. A. Thorn, K. Ramamohanarao, and L. Naish, “A superjoin algorithm for deductive databases”,in Proc. 12th Int. Conf. VLDB, Kyoto, Japan, Aug. 1986, pp. 189-196.
32. M. White, “N-trees: Large ordered indexes for MultiDimensional space,” Application mathematics Research Staff, Statistical Research Division, U. S. Bureau of the Census, Dec. 1981.