58 search results - page 5 / 12 » Labeling and Querying Dynamic XML Trees |
108
click to vote
SSDBM
2002
IEEE
15 years 6 months ago
2002
IEEE
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
123
click to vote
DASFAA
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract. The rapid growth in the amount of XML data and the development of publish-subscribe systems have led to great interest in processing streaming XML data. We propose the Qs...
WEBDB
2005
Springer
15 years 6 months ago
2005
Springer
We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling...
100
click to vote
CIAC
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
125
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
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 ...