A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions

Shuping Ji, Hans-Arno Jacobsen. A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions. In Guoliang Li 0001, Zhanhuai Li, Stratos Idreos, Divesh Srivastava, editors, SIGMOD '21: International Conference on Management of Data, Virtual Event, China, June 20-25, 2021. pages 817-829, ACM, 2021. [doi]

@inproceedings{JiJ21,
  title = {A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions},
  author = {Shuping Ji and Hans-Arno Jacobsen},
  year = {2021},
  doi = {10.1145/3448016.3457266},
  url = {https://doi.org/10.1145/3448016.3457266},
  researchr = {https://researchr.org/publication/JiJ21},
  cites = {0},
  citedby = {0},
  pages = {817-829},
  booktitle = {SIGMOD '21: International Conference on Management of Data, Virtual Event, China, June 20-25, 2021},
  editor = {Guoliang Li 0001 and Zhanhuai Li and Stratos Idreos and Divesh Srivastava},
  publisher = {ACM},
  isbn = {978-1-4503-8343-1},
}