I am working on an application that needs to map pdf documents to corresponding json data files (see: Kotlin data structure for efficient lookup of nested data for more details). In trying to implement a solution, I encountered a more broad question about how to estimate the expected performance of a search function.