Mohammad Sadoghi, Hans-Arno Jacobsen. BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space. In Timos K. Sellis, Renée J. Miller, Anastasios Kementsietsidis, Yannis Velegrakis, editors, Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, Greece, June 12-16, 2011. pages 637-648, ACM, 2011. [doi]
@inproceedings{SadoghiJ11,
title = {BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space},
author = {Mohammad Sadoghi and Hans-Arno Jacobsen},
year = {2011},
doi = {10.1145/1989323.1989390},
url = {http://doi.acm.org/10.1145/1989323.1989390},
researchr = {https://researchr.org/publication/SadoghiJ11},
cites = {0},
citedby = {0},
pages = {637-648},
booktitle = {Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, Greece, June 12-16, 2011},
editor = {Timos K. Sellis and Renée J. Miller and Anastasios Kementsietsidis and Yannis Velegrakis},
publisher = {ACM},
isbn = {978-1-4503-0661-4},
}