Hi, I have a question regarding the Concurrent Inverted Radix Tree.

npgall / concurrent-trees

Concurrent Radix and Suffix Trees for Java

Apache License 2.0

510 stars 82 forks source link

Hi, I have a question regarding the Concurrent Inverted Radix Tree. #41

Open juno-junho opened 5 months ago

juno-junho commented 5 months ago

I am using this library to detect profanity in text. Does the Concurrent Inverted Radix Tree use the Aho-Corasick algorithm to search for keywords in external documents?

Could you explain how the time complexity is O(d log(k))?