Sciweavers

119 search results - page 8 / 24
» Labeling Dynamic XML Trees
Sort
View
ICALP
2005
Springer
14 years 3 months ago
Logics for Unranked Trees: An Overview
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
Leonid Libkin
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 9 months ago
The Tree Inclusion Problem: In Linear Space and Faster
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 ...
Philip Bille, Inge Li Gørtz
FCT
2001
Springer
14 years 2 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
VLDB
2008
ACM
136views Database» more  VLDB 2008»
14 years 10 months ago
Efficient updates in dynamic XML data: from binary string to quaternary string
XML query processing based on labeling schemes has been thoroughly studied in the past several years. Recently efficient processing of updates in dynamic XML data has gained more a...
Changqing Li, Tok Wang Ling, Min Hu