Using Conjunctions for Faster Disjunctive Top-k Queries.
Michal Siedlaczek|Antonio Mallia|Torsten Suel
| Anthology ID: | DBLP:conf/wsdm/SiedlaczekMS22 |
|---|---|
| Volume: | WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21 - 25, 2022 |
| Year: | 2022 |
| Venue: | Web Search and Data Mining (WSDM) |
| Publisher: | ACM |
| Pages: | 917-927 |
| URL: | https://doi.org/10.1145/3488560.3498489 |
| DOI: | https://doi.org/10.1145/3488560.3498489 |
| DBLP: | conf/wsdm/SiedlaczekMS22 |
| BibTeX: |
@inproceedings{siedlaczek-2022-using,
author = {Michal Siedlaczek and
Antonio Mallia and
Torsten Suel},
editor = {K. Sel\c{c}uk Candan and
Huan Liu and
Leman Akoglu and
Xin Dong and
Jiliang Tang},
title = {{Using Conjunctions for Faster Disjunctive Top-k Queries}},
booktitle = {{WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21 - 25, 2022}},
pages = {917--927},
publisher = {ACM},
year = {2022},
url = {https://doi.org/10.1145/3488560.3498489},
doi = {https://doi.org/10.1145/3488560.3498489}
}