Sciweavers

25 search results - page 2 / 5
» Formalizing the XML Schema Matching Problem as a Constraint ...
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 4 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
PODS
2005
ACM
129views Database» more  PODS 2005»
14 years 4 months ago
Regular rewriting of active XML and unambiguity
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
Serge Abiteboul, Tova Milo, Omar Benjelloun
ICDT
2003
ACM
91views Database» more  ICDT 2003»
13 years 10 months ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
DBPL
2005
Springer
135views Database» more  DBPL 2005»
13 years 10 months ago
Type-Based Optimization for Regular Patterns
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
Michael Y. Levin, Benjamin C. Pierce
SEBD
2003
159views Database» more  SEBD 2003»
13 years 6 months ago
Spatial Tree Logics to reason about Semistructured Data
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
Giovanni Conforti, Giorgio Ghelli