Sciweavers

677 search results - page 20 / 136
» The XML Typechecking Problem
Sort
View
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
15 years 10 months ago
Relational-style XML query
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
Taro L. Saito, Shinichi Morishita
MFCS
2004
Springer
15 years 3 months ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
DEXA
2009
Springer
70views Database» more  DEXA 2009»
15 years 4 months ago
On the Termination Problem for Declarative XML Message Processing
Abstract. We define a formal syntax and semantics for the Rule Definition Language (RDL) of DemaqLite, which is a fragment of the declarative XML message processing system Demaq....
Tadeusz Litak, Sven Helmer
EDBT
2004
ACM
147views Database» more  EDBT 2004»
15 years 10 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...
CIKM
2005
Springer
15 years 3 months ago
The case for access control on XML relationships
With the emergence of XML as the de facto standard to exchange and disseminate information, the problem of regulating access to XML documents has attracted a considerable attentio...
Béatrice Finance, Saïda Medjdoub, Phil...