K-tree/forest: efficient indexes for boolean queries.

Rakesh M. Verma|Sanjiv Behl


Anthology ID:DBLP:conf/sigir/VermaB02
Volume:SIGIR 2002: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, August 11-15, 2002, Tampere, Finland
Year:2002
Venue:Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR)
Publisher:ACM
Pages:433-434
URL:https://doi.org/10.1145/564376.564480
DOI:https://doi.org/10.1145/564376.564480
DBLP:conf/sigir/VermaB02
BibTeX:
@inproceedings{verma-2002-ktreeforest, author = {Rakesh M. Verma and Sanjiv Behl}, editor = {Kalervo J\"{a}rvelin and Micheline Beaulieu and Ricardo Baeza-Yates and Sung-Hyon Myaeng}, title = {{K-tree/forest: efficient indexes for boolean queries}}, booktitle = {{SIGIR 2002: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, August 11-15, 2002, Tampere, Finland}}, pages = {433--434}, publisher = {ACM}, year = {2002}, url = {https://doi.org/10.1145/564376.564480}, doi = {https://doi.org/10.1145/564376.564480} }