Sciweavers

677 search results - page 11 / 136
» The XML Typechecking Problem
Sort
View
SIGMOD
2003
ACM
1527views Database» more  SIGMOD 2003»
14 years 7 months ago
XPRESS: A Queriable Compression for XML Data
Like HTML, many XML documents are resident on native file systems. Since XML data is irregular and verbose, the disk space and the network bandwidth are wasted. To overcome the ve...
Jun-Ki Min, Myung-Jae Park, Chin-Wan Chung
ICDT
2007
ACM
118views Database» more  ICDT 2007»
13 years 11 months ago
Approximate Data Exchange
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
Michel de Rougemont, Adrien Vieilleribière
ICDT
2007
ACM
105views Database» more  ICDT 2007»
13 years 11 months ago
Unlocking Keys for XML Trees
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
Sven Hartmann, Sebastian Link
DATESO
2008
129views Database» more  DATESO 2008»
13 years 8 months ago
Database Engineering from the Category Theory Viewpoint
Abstract. This paper gives an overview of XML formal models, summarizes database engineering practices, problems and their evolution. We focus on categorical aspects of XML formal ...
David Toth
ADL
2000
Springer
225views Digital Library» more  ADL 2000»
13 years 11 months ago
Using Regular Tree Automata as XML Schemas
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful that the XML DTDs and is clo...
Boris Chidlovskii