Sciweavers

182 search results - page 12 / 37
» Comparing XML path expressions
Sort
View
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 7 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
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 8 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
CAISE
2006
Springer
13 years 11 months ago
An Efficient Approach to Support Querying Secure Outsourced XML Information
Abstract. Data security is well-recognized a vital issue in an information system that is supported in an outsource environment. However, most of conventional XML encryption propos...
Yin Yang, Wilfred Ng, Ho Lam Lau, James Cheng
WEBDB
2001
Springer
113views Database» more  WEBDB 2001»
13 years 12 months ago
Indexing XML Data with ToXin
Indexing schemes for semistructured data have been developed in recent years to optimize path query processing by summarizing path information. However, most of these schemes can ...
Flavio Rizzolo, Alberto O. Mendelzon
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 7 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...