Boolean Query Optimization

Boolean Query Optimization is a computational method within information retrieval that refines Boolean queries by minimizing their execution complexity through logical simplification and operator reordering while preserving semantic equivalence.

20

Publications

930

Citations

43

Authors

27

Institutions

Publications per year

2017–2026

3

Authors

43

  1. HS
    Harrisen Scells

    The University of Queensland, Australia

    3 publications · 296 citations

    3

    h-index

  2. GZ
    Guido Zuccon

    Commonwealth Scientific and Industrial Research Organisation, Australia

    3 publications · 296 citations

    3

    h-index

  3. VS
    Václav Snåšel

    VSB - Technical University of Ostrava, Czechia

    2 publications · 33 citations

    2

    h-index

  4. LD
    Luc De Raedt

    KU Leuven, Belgium

    2 publications · 62 citations

    2

    h-index

  5. BK
    Bevan Koopman

    Commonwealth Scientific and Industrial Research Organisation, Australia

    2 publications · 244 citations

    2

    h-index

1–5 of 43

Venues

  1. Communications of the ACM

    1 publications · 53 citations

    1

    h-index

  2. Teaching and Learning in Medicine

    1 publications · 12 citations

    1

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 42 citations

    1

    h-index

  4. DATESO

    1 publications · 17 citations

    1

    h-index

  5. Bioinformatics

    1 publications · 17 citations

    1

    h-index

1–5