Sciweavers

134 search results - page 25 / 27
» Using Regular Tree Automata as XML Schemas
Sort
View
ACL
1998
14 years 11 months ago
A Descriptive Characterization of Tree-Adjoining Languages (Project Note)
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
James Rogers
75
Voted
LATA
2009
Springer
15 years 5 months ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger
82
Voted
EDBT
2002
ACM
179views Database» more  EDBT 2002»
15 years 10 months ago
Efficient Complex Query Support for Multiversion XML Documents
Managing multiple versions of XML documents represents a critical requirement for many applications. Also, there has been much recent interest in supporting complex queries on XML ...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo,...
72
Voted
ICDT
2007
ACM
97views Database» more  ICDT 2007»
15 years 4 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...
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
15 years 4 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...