arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1007.3415cs.DS
收藏

树上动态目录的检索

Searching in Dynamic Catalogs on a Tree

Yakov Nekrich

摘要:

在本文中,我们考虑以下修改的迭代搜索问题。我们给出树$T$,使得动态目录$C(v)$与每个树节点$v$相关联。对于任何$x$和$T$中的任何节点到根路径$π$,我们必须在$\cup_{v\in π} C(v)$中找到$x$的前身。我们提出了一个线性空间的动态数据结构,支持这样的查询在$O(t(n)+|π|)$的时间,其中$t(n)$是所需的时间在一个目录中搜索和$|π|$表示路径$π$上的节点数。我们还考虑了这个问题的报告变体,其中对于任何$x_1$,$x_2$和任何路径$π'$,必须报告$\cup_{v\in π'} (C(v)\cap [x_1,x_2])$的所有元素;这里$π'$表示任意节点$v_0$和其祖先$v_1$之间的路径。我们表明,这样的查询可以回答在$O(t(n)+|π'|+ k)$的时间,其中$k$是在答案中的元素的数量。为了说明我们的技术的应用,我们描述了第一动态数据结构的刺最大值问题,水平点定位问题,正交线段相交问题与最佳的$O(\log n/\log \log n)$查询时间和多对数更新时间。

英文摘要:

In this paper we consider the following modification of the iterative search problem. We are given a tree $T$, so that a dynamic catalog $C(v)$ is associated with every tree node $v$. For any $x$ and for any node-to-root path $π$ in $T$, we must find the predecessor of $x$ in $\cup_{v\in π} C(v)$. We present a linear space dynamic data structure that supports such queries in $O(t(n)+|π|)$ time, where $t(n)$ is the time needed to search in one catalog and $|π|$ denotes the number of nodes on path $π$. We also consider the reporting variant of this problem, in which for any $x_1$, $x_2$ and for any path $π'$ all elements of $\cup_{v\in π'} (C(v)\cap [x_1,x_2])$ must be reported; here $π'$ denotes a path between an arbitrary node $v_0$ and its ancestor $v_1$. We show that such queries can be answered in $O(t(n)+|π'|+ k)$ time, where $k$ is the number of elements in the answer. To illustrate applications of our technique, we describe the first dynamic data structures for the stabbing-max problem, the horizontal point location problem, and the orthogonal line-segment intersection problem with optimal $O(\log n/\log \log n)$ query time and poly-logarithmic update time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑