6 search results - page 1 / 2 » Efficient updates in dynamic XML data: from binary string to... |
VLDB
2008
ACM
14 years 11 months ago
2008
ACM
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...
ICDE
2006
IEEE
14 years 5 months ago
2006
IEEE
It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we pr...
DASFAA
2005
IEEE
14 years 4 months ago
2005
IEEE
A number of labeling schemes have been designed to facilitate the query of XML, based on which the ancestor-descendant relationship between any two nodes can be determined quickly....
DASFAA
2007
IEEE
14 years 3 months ago
2007
IEEE
In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
ALGORITHMICA
2010
13 years 11 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...