Path queries on functions
In this article the authors propose several algorithms for creating compact data structures used to provide efficient answers to queries on paths like: minimum or maximum, selection, top-\(r\), \(\tau\)-majority and range queries. After a brief introduction of the theoretical concepts, the authors describe the algorithms for constructing the compact structures and querying them. For each algorithm the correctness is demonstrated and the complexity is analyzed in detail. The article is clearly and well written and structured.
scientific article; zbMATH DE number 7050144
scientific article