We investigate two possible techniques to authenticate the q-digest data structure, along with a worst-case study of the computational complexity both in time and space of the proposed solutions, and considerations on the feasibility of the presented approaches in real-world scenarios. We conclude the discussion by presenting some considerations on the information complexity of the queries in the two proposed approaches, and by presenting some interesting ideas that could be the subject of future studies on the topic.

翻译：本文研究了两种可能的分位数摘要（q-digest）数据结构认证技术，并对所提方案在最坏情况下的时间与空间计算复杂度进行了分析，同时探讨了这些方法在实际场景中的可行性。通过讨论两种方案中查询的信息复杂度，我们给出了一些结论，并提出了一些值得后续研究的有趣思路。