Sciweavers

58 search results - page 9 / 12
» Labeling and Querying Dynamic XML Trees
Sort
View
ICALP
2005
Springer
14 years 1 months ago
The Tree Inclusion Problem: In Optimal 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 r...
Philip Bille, Inge Li Gørtz
BMCBI
2006
150views more  BMCBI 2006»
13 years 7 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...
ICDT
2007
ACM
97views Database» more  ICDT 2007»
14 years 1 months ago
Combining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
14 years 7 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...
PODS
2006
ACM
98views Database» more  PODS 2006»
14 years 7 months ago
Two-variable logic on data trees and XML reasoning
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Th...