Dynamic Partition Forest: An Efficient and Distributed Indexing Scheme for Similarity Search based on Hashing

Yangdi Lu, Yang Bo, Wenbo He, Amir Nabatchian. Dynamic Partition Forest: An Efficient and Distributed Indexing Scheme for Similarity Search based on Hashing. In Naoki Abe, Huan Liu 0001, Calton Pu, Xiaohua Hu, Nesreen Ahmed, Mu Qiao, Yang Song, Donald Kossmann, Bing Liu 0001, Kisung Lee, Jiliang Tang, Jingrui He, Jeffrey Saltz, editors, IEEE International Conference on Big Data, Big Data 2018, Seattle, WA, USA, December 10-13, 2018. pages 1059-1064, IEEE, 2018. [doi]

@inproceedings{LuBHN18,
  title = {Dynamic Partition Forest: An Efficient and Distributed Indexing Scheme for Similarity Search based on Hashing},
  author = {Yangdi Lu and Yang Bo and Wenbo He and Amir Nabatchian},
  year = {2018},
  doi = {10.1109/BigData.2018.8622321},
  url = {https://doi.org/10.1109/BigData.2018.8622321},
  researchr = {https://researchr.org/publication/LuBHN18},
  cites = {0},
  citedby = {0},
  pages = {1059-1064},
  booktitle = {IEEE International Conference on Big Data, Big Data 2018, Seattle, WA, USA, December 10-13, 2018},
  editor = {Naoki Abe and Huan Liu 0001 and Calton Pu and Xiaohua Hu and Nesreen Ahmed and Mu Qiao and Yang Song and Donald Kossmann and Bing Liu 0001 and Kisung Lee and Jiliang Tang and Jingrui He and Jeffrey Saltz},
  publisher = {IEEE},
  isbn = {978-1-5386-5035-6},
}