Boolean Query Processing
Boolean Query Processing is a computational method within information retrieval systems that evaluates user queries using Boolean logic—specifically conjunctions, disjunctions, and negations of index terms—to retrieve documents strictly matching the specified logical conditions.
154
Publications
8.7K
Citations
309
Authors
168
Institutions
Publications per year
2017–2026
29
Parents
154
Extended Boolean information retrieval
Gerard Salton, Edward A. Fox, Harry Wu · Communications of the ACM · 1983 · 1K citations · Full text
Luis Gravano, Héctor García-Molina, Anthony Tomasic · ACM Transactions on Database Systems · 1999 · 295 citations · Full text
1–5 of 154
309
Commonwealth Scientific and Industrial Research Organisation, Australia
11 publications · 548 citations
11
h-index
10
h-index
9
h-index
Commonwealth Scientific and Industrial Research Organisation, Australia
8 publications · 465 citations
8
h-index
7
h-index
1–5 of 309
168
University of Mons
Mons, Belgium
9 h-index
11 publications
241 citations

The University of Queensland
Brisbane, Australia
8 h-index
19 publications
853 citations
Stanford University
Stanford, United States
7 h-index
14 publications
969 citations

Commonwealth Scientific and Industrial Research Organisation
Canberra, Australia
7 h-index
8 publications
461 citations

Cornell University
Ithaca, United States
7 h-index
11 publications
1.6K citations

University of Toronto
Toronto, Canada
6 h-index
9 publications
342 citations

The University of Melbourne
Melbourne, Australia
4 h-index
8 publications
793 citations
University of Oxford
Oxford, United Kingdom
4 h-index
6 publications
272 citations
1–8 of 168
JASIS · 10 publications · 629 citations
10
h-index
9 publications · 246 citations
9
h-index
PVLDB · 4 publications · 174 citations
4
h-index
TODS · 4 publications · 374 citations
4
h-index
4 publications · 631 citations
4
h-index
1–5