A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Filters
The XML typechecking problem
2002
SIGMOD record
Preserved Fulltext
Typechecking for XML transformers
2000
Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We study the typechecking problem for XML (eXtensible Markup Language) transformers: given an XML transformation program and a DTD for the input XML documents, check whether every result of the program ...
Consequently, typechecking can be performed for a broad range of XML transformation languages, including XML-QL and a fragment of XSLT. r 2003 Published by Elsevier Science (USA). 0022-0000/03/$ -see front ...
Thus, our framework for typechecking is likely to remain relevant as the XML standards evolve. ...
doi:10.1145/335168.335171
dblp:conf/pods/MiloSV00
fatcat:hc2feri2lvetnoduhkntza2lwu
Typechecking for XML transformers
2003
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We study the typechecking problem for XML (eXtensible Markup Language) transformers: given an XML transformation program and a DTD for the input XML documents, check whether every result of the program ...
Consequently, typechecking can be performed for a broad range of XML transformation languages, including XML-QL and a fragment of XSLT. r 2003 Published by Elsevier Science (USA). 0022-0000/03/$ -see front ...
Thus, our framework for typechecking is likely to remain relevant as the XML standards evolve. ...
doi:10.1016/s0022-0000(02)00030-2
fatcat:a2bxrrse3vf2pha25mrbwnaulu
XML with data values: typechecking revisited
2003
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The typechecking problem takes as input a query and two schemes (or types), one for the input XML documents and one for the output XML documents generated by the query. ...
The complexity of typechecking in the decidable cases is also considered. r XML documents. The benefits of schemas are numerous. ...
XML-QL, and for which we know already that typechecking is decidable [19] . ...
doi:10.1016/s0022-0000(03)00032-1
fatcat:lievrskogndkzgl6qtmr7gwntq
Typechecking XML views of relational databases
2003
ACM Transactions on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Motivated by the need to export relational databases as XML data in the context of the Web, we investigate the typechecking problem for transformations of relational data into tree data (XML). ...
We also exhibit a practically appealing restriction for which typechecking is in ptime. * ...
Our work is motivated by the practical need to typecheck XML views from relational databases. ...
doi:10.1145/772062.772065
fatcat:y5vsikjxqbbffm6oonsaasuphy
Frontiers of tractability for typechecking simple XML transformations
2007
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. ...
We consider top-down XML transformations incorporating XPath expressions and abstract document types by grammars and tree automata. ...
Acknowledgment We thank Giorgio Ghelli for raising the question about the complexity of typechecking in the setting of a fixed output schema. We thank Dirk Leinders, Thomas Schwentick, and ...
doi:10.1016/j.jcss.2006.10.005
fatcat:svotzzqmfjcbnpae3mjbyaiicu
Complexity of Typechecking XML Views of Relational Databases
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper we show that the typechecking problem is in coNEXP-TIME. As an intermediate step we consider the following problem, which can be formulated in a language independent of XML notions. ...
The typechecking problem for transformations of relational data into tree data is the following: given a TreeQL program P (called transformation), and a DTD d (called output type), decide whether for every ...
Recently the problem of typechecking gained a lot of attention in literature, especially in the context of typechecking XML-to-XML transformations, which, since relational structures can easily be encoded ...
doi:10.1007/11965893_17
fatcat:5xmihz7mcvabdfuz6nyvgam4c4
Frontiers of tractability for typechecking simple XML transformations
2004
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. ...
We consider top-down XML transformations incorporating XPath expressions and abstract document types by grammars and tree automata. ...
Acknowledgment We thank Giorgio Ghelli for raising the question about the complexity of typechecking in the setting of a fixed output schema. We thank Dirk Leinders, Thomas Schwentick, and ...
doi:10.1145/1055558.1055563
dblp:conf/pods/MartensN04
fatcat:zt4zz55nirdo3ltg5wff3rvgsi
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
[article]
2006
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. ...
In the present work, we investigate the computational complexity of the typechecking problem in the latter setting. ...
Acknowledgments We thank Giorgio Ghelli for raising the question about the complexity of typechecking in the setting of a fixed output schema. ...
arXiv:cs/0606094v1
fatcat:sqo4ken455hh7lgkdvmpsudiem
On the complexity of typechecking top-down XML transformations
2005
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We investigate the typechecking problem for XML transformations: statically verifying that every answer to a transformation conforms to a given output schema, for inputs satisfying a given input schema ...
As typechecking quickly turns undecidable for query languages capable of testing equality of data values, we return to the limited framework where we abstract XML documents as labeled ordered trees. ...
In the present paper, we focus on typechecking of XML to XML transformations. ...
doi:10.1016/j.tcs.2004.10.035
fatcat:nbbnmokbczcpfdbsoqb5fxsk4y
Typechecking top-down XML transformations: Fixed input or output schemas
2008
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. ...
In the present work, we investigate the computational complexity of the typechecking problem in the latter setting. ...
Acknowledgments We thank Giorgio Ghelli for raising the question about the complexity of typechecking in the setting of a fixed output schema. ...
doi:10.1016/j.ic.2008.01.002
fatcat:onmro2rudfh6hguss5hlzt3ici
Modulo Constraints and the Complexity of Typechecking XML Views
2008
Theory of Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The typechecking problem for transformations of relational data into tree data is the following: given a relational-to-XML transformation P , and an XML type d, decide whether for every database instance ...
In this paper we show that the typechecking problem is coNEXPTIMEcomplete. As an intermediate step we consider the following problem, which can be formulated independently of XML notions. ...
The typechecking problem recently gained a lot of attention in the literature, especially in the context of typechecking XML-to-XML transformations. ...
doi:10.1007/s00224-008-9132-z
fatcat:rgpevfdwzjgrnkbg3wb7nygkz4
Typechecking XML views of relational databases
Proceedings 16th Annual IEEE Symposium on Logic in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Motivated by the need to export relational databases as XML data in the context of the Web, we investigate the typechecking problem for transformations of relational data into tree data (XML). ...
We also exhibit a practically appealing restriction for which typechecking is in ptime. * ...
Our work is motivated by the practical need to typecheck XML views from relational databases. ...
doi:10.1109/lics.2001.932517
dblp:conf/lics/AlonMNSV01
fatcat:yc25lcccrzdf7b4fomtpw3l3fm
Komplexität des typechecking-Problems für Top-down XML-Transformationen
2013
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
XML hat sich zu dem weitest verbreiteten Format für semistrukturierte Daten entwickelt. Häufig besteht die Notwendigkeit, Dokumente zu transformieren, um sie für unterschiedliche Zwecke, z.B. ...
Die statische Analyse der Typkorrektheit einer Transformation ist als das Typechecking Problem bekannt und wird im Folgenden hinsichtlich seiner Komplexität, für eingeschränkte Transformationen, untersucht ...
Die Relevanz des Typechecking-Problems soll an einem Beispiel motiviert werden. Ein Motorradhändler möchte die Zweiräder, die er aktuell im Programm hat, speichern. Dazu verwendet er XML. ...
doi:10.17877/de290r-10573
fatcat:iv4sz3ojd5gm5j6fph7up6scu4
Flux: FunctionaL Updates for XML (extended report)
[article]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We are developing an XML update language called Flux, which stands for FunctionaL Updates for XML, drawing upon ideas from functional programming languages. ...
XML database query languages have been studied extensively, but XML database updates have received relatively little attention, and pose many challenges to language design. ...
Static typing for XML processing We will focus on only the most closely related work on XML typechecking; Møller and Schwartzbach (2005) provide a much more complete survey of type systems for XML transformation ...
arXiv:0807.1211v1
fatcat:nnw7so2g7ras7olnpz4kmhstn4
« Previous
Showing results 1 — 15 out of 570 results