Problem
Research questions and friction points this paper is trying to address.
succinct representation
search trees on trees
Steiner-closed
Succinct Representation of Search Trees on Trees
🤖 AI Summary
本文研究了树上搜索树（STT）的简洁表示问题，提出了一种可在多项式时间内构建且空间最优的表示方法，并设计了支持快速遍历的数据结构。
📝 Abstract
A search tree on trees (STT) is a data structure for performing a search for a target vertex in a reference tree. A standard binary search tree is a special case of an STT, where the reference tree is a path of totally ordered elements.
In this paper, we study the problem of succinct representation of STTs. We consider two cases: (1) general search trees on trees, and (2) Steiner-closed search trees on trees [Bose et al. TALG 2023]. For both cases, we present representations that can be constructed in polynomial time and achieve optimal space up to the lower-order additive terms.
We also present data structures for supporting fast traversals of both general and Steiner-closed STTs. For general STTs our data structure still takes optimal space up to lower-order additive terms.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Succinct Representation
Search Trees on Trees (STT)
Optimal Space
Fast Traversals
Polynomial Time
🔎 Similar Papers
2023-08-02arXiv.orgCitations: 0
