Sciweavers

119 search results - page 9 / 24
» Labeling Dynamic XML Trees
Sort
View
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 2 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
BMCBI
2006
150views more  BMCBI 2006»
13 years 10 months ago
TreeDyn: towards dynamic graphics and annotations for analyses of trees
Background: Analyses of biomolecules for biodiversity, phylogeny or structure/function studies often use graphical tree representations. Many powerful tree editors are now availab...
François Chevenet, Christine Brun, Anne-Lau...
WEBDB
2005
Springer
101views Database» more  WEBDB 2005»
14 years 3 months ago
T-SIX: An Indexing System for XML Siblings
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...
SungRan Cho
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 10 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
DASFAA
2006
IEEE
152views Database» more  DASFAA 2006»
14 years 3 months ago
Effective Keyword Search in XML Documents Based on MIU
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data....
Jianjun Xu, Jiaheng Lu, Wei Wang 0009, Baile Shi