- Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been recognized as an important query primitive in XML databases.Author: Philip Bille, Inge Li GoertzPublish Year: 2006Cite as: arXiv:cs/0608124 [cs.DS]Comments: Minor updates from last timeSubjects: Data Structures and Algorithms (cs.DS)arxiv.org/abs/cs/0608124
WEBThe tree inclusion problem is to determine if P can be included in T and if so report all subtrees of T that include P. Recently, the problem has been recognized as an important query primitive for XML data and has received considerable attention, see e.g., [15, 16, …
WEBGiven two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has …
WEBFor the tree inclusion problem, there can generally be exponentially many ways to obtain the included tree. Thus it is not feasible to check all the possibilities. In this paper we …
(PDF) On the Tree Inclusion Problem - ResearchGate
WEBJul 2, 2013 · Abstract - The ordered tree inclusion is an interesting problem, by which we will check whether a pattern tree P can be in cluded in a target tree T, in which the order …
The tree inclusion problem - SpringerLink
WEBJan 1, 2005 · We consider the following problem: Given ordered albeled trees S and T, can S be obtained from T by deleting nodes? Deletion of the root node u of a subtree with …
The Tree Inclusion Problem: In Optimal Space and Faster
WEBJul 11, 2005 · Abstract. Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. …
The Tree Inclusion Problem: In Linear Space and Faster
WEBAug 31, 2006 · In this paper we show that the tree inclusion problem can be solved in space $O(n_T)$ and time: O(\min(l_Pn_T, l_Pl_T\log \log n_T + n_T, \frac{n_Pn_T}{\log n_T} + n_{T}\log n_{T})).
[PDF] On the Tree Inclusion Problem | Semantic Scholar
WEBJul 2, 2013 · This article shows that the tree inclusion problem can be solved in space O(n), T (sub) and time, which improves or matches the best known time complexities while …
The tree inclusion problem: In linear space and faster
WEBJul 15, 2011 · In this article we show that the tree inclusion problem can be solved in space O(n T) and time: O⎛⎝min⎧⎨⎩lPnTlPlT log log nT + nTnPnTlog nT+ nT log …
- Some results have been removed
Skip to content