1998
DOI: 10.1016/s0950-7051(98)00041-0
|View full text |Cite
|
Sign up to set email alerts
|

Extending the superimposed codeword indexing scheme to handle incomplete information

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2001
2001
2023
2023

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…This will enhance the search efficiency and speed up the evaluation of the Boolean query. Based on this approach, more sophisticated schemes may be designed to handle conjunctive components, nested components, and incomplete information (Williams & Wong, 1998) in the Boolean‐based query.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…This will enhance the search efficiency and speed up the evaluation of the Boolean query. Based on this approach, more sophisticated schemes may be designed to handle conjunctive components, nested components, and incomplete information (Williams & Wong, 1998) in the Boolean‐based query.…”
Section: Resultsmentioning
confidence: 99%
“…A document is regarded as relevant if it contains one or more words in the query. In this case, we can superimpose the signature of each word in the query to form a single query signature (Williams & Wong, 1998). This query signature can then be used for matching the signature of the documents.…”
Section: Overview Of Psfcmentioning
confidence: 99%
“…This will enhance the search efficiency and speed up the evaluation of the Boolean query. Based on this approach, more sophisticated schemes may be designed to handle conjunctive components, nested components, and incomplete information (Williams & Wong, 1998) in the Boolean-based query.…”
Section: Resultsmentioning
confidence: 99%
“…A document is regarded as relevant if it contains one or more words in the query. In this case, we can superimpose the signature of each word in the query to form a single query signature (Williams & Wong, 1998). This query signature can then be used for matching the signature of the documents.…”
Section: Overview Of Psfcmentioning
confidence: 99%