Sciweavers

632 search results - page 31 / 127
» The DSD Schema Language
Sort
View
PODS
2008
ACM
141views Database» more  PODS 2008»
14 years 7 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 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
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 7 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
CIDR
2011
337views Algorithms» more  CIDR 2011»
12 years 11 months ago
The Schema-Independent Database UI: A Proposed Holy Grail and Some Suggestions
If you have ever encountered a piece of highly domain-specific business software, you may have noticed that it was largely a graphical front-end to some relational database. You ...
Eirik Bakke, Edward Benson
WWW
2008
ACM
14 years 8 months ago
Learning deterministic regular expressions for the inference of schemas from XML data
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn V...