Re: What is the most difficult search operations for criminal finger print

wtxwtx_at_gmail.com wrote:
> Hi,
> I am a newbie in database theory, but I think it cannot prevent me from
> making some contributions to the field, not in theory, but in database
> performance. That is, what I am interested in the database is how to do
> match, not its interface or its language. Is it the right place to ask
> the question?
>
> It is often read that a criminal finger print got a match in FBI
> criminal finger print database through several months waiting period.
>
> The following questions arise from my mind:
> 1. What is the most difficult search operations for criminal finger
> print database?
>
> 2. Could someone give an example on what happened over there?
>
> 3. The finger print database is closely linked to a finger print
> encoding. While doing search, finger print picked up from the field is
> used to generate a match pattern, then the encoding method determines
> how the match pattern is generated. Finally the match pattern is used
> to scan all database data to see if there is any match between one of
> stored finger print data with match pattern data. That means, for
> example, one full set of finger print needs 256 bytes, a match pattern
> has same 256 data, then a comparison is made between the 256 bytes to
> see if they are matched with some bit comparison results are masked or
> some bits are masked before doing match. In search process, I think
> there is no need to know how finger print is encoded. Is it correct?
>
> 4. Essentially what I really want to know is what operations are needed
> to implement the process? For example, there are 256 bytes finger print
> data, and there is a part of finger print picked up from the criminal
> field.
>
> Thank you.
>
> Weng
>

i think this is one logical/'right' place. also that the question is in the domain of 'domains'! eg. what does 'equal' mean.

that is intriguing about a finger-print only taking 256 bytes. never knew that.

p Received on Wed Jan 11 2006 - 04:08:45 CET