DART: distributed adaptive radix tree for efficient affix-based keyword search on HPC systems

Wei Zhang 0097, Houjun Tang, Suren Byna, Yong Chen 0001. DART: distributed adaptive radix tree for efficient affix-based keyword search on HPC systems. In Skevos Evripidou, Per Stenström, Michael F. P. O'Boyle, editors, Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques, PACT 2018, Limassol, Cyprus, November 01-04, 2018. ACM, 2018. [doi]

@inproceedings{ZhangTBC18,
  title = {DART: distributed adaptive radix tree for efficient affix-based keyword search on HPC systems},
  author = {Wei Zhang 0097 and Houjun Tang and Suren Byna and Yong Chen 0001},
  year = {2018},
  doi = {10.1145/3243176.3243207},
  url = {https://doi.org/10.1145/3243176.3243207},
  researchr = {https://researchr.org/publication/ZhangTBC18},
  cites = {0},
  citedby = {0},
  booktitle = {Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques, PACT 2018, Limassol, Cyprus, November 01-04, 2018},
  editor = {Skevos Evripidou and Per Stenström and Michael F. P. O'Boyle},
  publisher = {ACM},
}