1998
DOI: 10.1016/s0020-0190(97)00210-x
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of signature file models with superimposed coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

1999
1999
2016
2016

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 20 publications
(9 citation statements)
references
References 12 publications
0
9
0
Order By: Relevance
“…A signature is an abstraction that contains some partial information of attributes of a data record [8]. In general, a bit string is a common presentation of a signature.…”
Section: Signature-based Operationsmentioning
confidence: 99%
“…A signature is an abstraction that contains some partial information of attributes of a data record [8]. In general, a bit string is a common presentation of a signature.…”
Section: Signature-based Operationsmentioning
confidence: 99%
“…For example, assume that we have hash(pro) = 2, hash(rof) = 4, hash(ofe) = 8, and hash(fes) = 9. Then, we will establish a bit string: 010 100 011 000 for "professor" as its word signature (see [8] for a detailed discussion).…”
Section: Signature Filesmentioning
confidence: 99%
“…Note that in our case the 1s of a term signature do not overlap. There exists yet one more SSF (FSB) model that allows the overlapping of the 1s at the term signature level [15,19].…”
Section: Estimating the Number Of False Dropsmentioning
confidence: 99%