Symbolic gray code as a multikey hashing function

In this paper, we extend the binary Gray code to symbolic Gray code. We then show that this symbolic Gray code can be used as a multikey hashing function for storing symbolic records. The record stored at location k and the record stored at location k + 1 will be nearest neighbors if this hashing fu...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 2(1980), 1 vom: 01. Jan., Seite 83-90
1. Verfasser: Du, H C (VerfasserIn)
Weitere Verfasser: Lee, R C
Format: Aufsatz
Sprache:English
Veröffentlicht: 1980
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM216985838
003 DE-627
005 20231224033023.0
007 tu
008 231224s1980 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0723.xml 
035 |a (DE-627)NLM216985838 
035 |a (NLM)22499629 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Du, H C  |e verfasserin  |4 aut 
245 1 0 |a Symbolic gray code as a multikey hashing function 
264 1 |c 1980 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 02.10.2012 
500 |a Date Revised 12.11.2019 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a In this paper, we extend the binary Gray code to symbolic Gray code. We then show that this symbolic Gray code can be used as a multikey hashing function for storing symbolic records. The record stored at location k and the record stored at location k + 1 will be nearest neighbors if this hashing function is used. Thus, this symbolic Gray code hashing function exhibits some kind of clustering property which will group similar records together. This property is a desirable property for designing nearest neighbor searching (also called best match searching) systems. There are many other interesting properties of this hashing function. For instance, there exists an address-to-key transformation which can be used to determine the record stored at certain location k if this hashing function is used. Besides, if there are totally M records, we only have to reserve exactly M locations; there are no collisions and wasting of memory storage. At the end of this paper, it is shown that the resulting file exhibits the multiple-attribute tree structure 
650 4 |a Journal Article 
700 1 |a Lee, R C  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 2(1980), 1 vom: 01. Jan., Seite 83-90  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:2  |g year:1980  |g number:1  |g day:01  |g month:01  |g pages:83-90 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 2  |j 1980  |e 1  |b 01  |c 01  |h 83-90