Near perfect hash table for image databases

Proceedings of the ACM Symposium on Applied Computing

Volumn Part F128723, Issue , 1996, Pages 442-446

  Bhatia, Sanjiv K ^a   Sabharwal, Chaman L ^b  

^a UNIVERSITY OF MISSOURI ST LOUIS   (United States)

^b MISSOURI UNIVERSITY OF SCIENCE AND TECHNOLOGY   (United States)

Author keywords

2D string; Hash table; Image database indexing

Indexed keywords

DATABASE SYSTEMS; EFFICIENCY; HEURISTIC ALGORITHMS; IMAGE RETRIEVAL; SEARCH ENGINES;

2D STRING; HASH TABLE; IMAGE DATABASE; IMAGE DATABASE SYSTEMS; ITS APPLICATIONS; MINIMAL PERFECT HASHES; RETRIEVAL EFFICIENCY; RETRIEVAL PROCESS;

DATA STRUCTURES;

EID: 33846275509     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/331119.331422     Document Type: Conference Paper

References (11)

1. S.K. Bhatia and CL. Sabharwal. A fast implementation of a perfect hash function for picture objects. Pattern Recognition, 27(3):365-376, 1994.
2. C.-C. Chang and S.-Y. Lee. Retrieval of similar pictures on pictorial databases. Pattern Recognition, 24(7) .-675-680, 1991.
3. S. Chang and S. Liu. Picture indexing and abstraction techniques for pictorial databases. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-6:475-484, July 1984.
4. S. Chang, Q. Shi, and C. Yan. Iconic indexing by 2D strings. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMl-9(3):413-428,1987.
5. S.-K. Chang. Principles of Pictorial Information Systems Design. Prentice Hall, Englewood Cliffs, NJ, 1989.
6. S.-K. Chang and E. Jungert. A spatial knowledge structure for image information systems using symbolic projections. In H. S. Stone and S. Winkler, editors, Proceedings of the 1986 Fall Joint Computer Conference, pages 79-86, Dallas, TX, November 1986.
7. S.-K. Chang, E. Jungert, and Y. Li. The design of pictorial databases based upon the theory of symbolic projections. In A. Buchman, O. Günther, T. R. Smith, and Y. F. Wang, editors, Design and Implementation of Large Spatial Databases: Proceedings of the First Symposium SSD '89, pages 303-323, Santa Barbara, CA, July 1989. (Lecture Notes in Computer Science # 409).
8. R. Cichelli. Minimal perfect hashing function made simple. Communications of the ACM, 23(1):17-19, January 1980.
9. C. Cook and R. Oldehoeft. A letter-oriented minimal perfect hashing function. ACM SIGPLAN Notices, 17:18-27, 1982.
10. C. L. Sabharwal and S. K. Bhatia. Perfect hash table algorithm for image databases using negative associated values. Pattern Recognition, 28(7):1091-1101, July 1995.
11. H. Samet. The quadtree and related hierarchical data structures. ACM Computing Surveys, 16(2):187-260, June 1984.