9 citations found. Retrieving documents...
Alon, N., Milo, T., Neven, F., Suciu, D., and Vianu, V. Typechecking XML views of relational databases. ACM Trans. Comput. Log. 4, 3 (

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
DTD-Directed Publishing with Attribute Translation.. - Benedikt, Chan, Fan.. (2002)   (13 citations)  (Correct)

....transform the data into an XML format. In practice, publishing of relational data is always done with a predefined type, typically a DTD. A community or industry agrees on a certain DTD, and subsequently all members of the community create XML views of their relational data that conform to the DTD [3]. This is common in, e.g. B2B applications and the health care industry: a hospital needs to Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the ....

....language that allows the DTD to guide view creation, as well as an efficient implementation of the language. Two of the well known systems that have been developed for publishing relational data in XML are SilkRoute [13] which is based on the view definition language RXL (abstracted as TreeQL in [3]) and XPERANTO [7] which extends SQL by supporting XML constructors to specify views. However, none of these systems takes DTDs types into account. There have also been several commercial systems [21, 19, 14] that specify XML views by embedding SQL queries within an XML document template. These ....

[Article contains additional citation context not shown here]

N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking XML views of relational databases. In Proc. of Logic in Computer Science (LICS), 2001.


DTD-Directed Publishing with Attribute Translation.. - Benedikt, Chan, Fan.. (2002)   (13 citations)  (Correct)

....transform the data into an XML format. In practice, publishing of relational data is always done with a predefined type, typically a DTD. A community or industry agrees on a certain DTD, and subsequently all members of the community create XML views of their relational data that conform to the DTD [3]. This is common in, e.g. B2B applications and the health care industry: a hospital needs to Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the ....

....language that allows the DTD to guide view creation, as well as an efficient implementation of the language. Two of the well known systems that have been developed for publishing relational data in XML are SilkRoute [13] which is based on the view definition language RXL (abstracted as TreeQL in [3]) and XPERANTO [7] which extends SQL by supporting XML constructors to specify views. However, none of these systems takes DTDs types into account. There have also been several commercial systems [21, 19, 14] that specify XML views by embedding SQL queries within an XML document template. These ....

[Article contains additional citation context not shown here]

N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking XML views of relational databases. In Proc. of Logic in Computer Science (LICS), 2001.


XML with Data Values: Typechecking Revisited - Noga Alon Tel (2001)   (7 citations)  Self-citation (Alon Milo Neven Suciu Vianu)   (Correct)

No context found.

N. Alon, T. Milo, F. Neven, D. Suciu, V. Vianu. Typechecking XML Views of Relational Databases. In Proceedings of the 16th IEEE Symposium on Logic in Computer Science, 421-- 430, 2001.


Typechecking Top-Down Uniform Unranked Tree Transducers - Martens, Neven   (7 citations)  Self-citation (Neven)   (Correct)

....typechecking: verifying at compile time that every XML document which is the result of a specified query applied to a valid input document, satisfies the output schema [23, 24] Obviously, typechecking depends on the transformation language and the schema language at hand. As shown by Alon et al. [1, 2], when transformation languages have the ability to compare data values, the typechecking problem quickly turns undecidable. Milo, Suciu, and Vianu argued that the capability of most XML transformation languages can be encompassed by k pebble transducers when data values are ignored and XML ....

....the class of DTDs where the regular string languages are represented by elements of M. The size of a DTD is the sum of the sizes of the elements of used to represent the function d. To define unordered languages we make use of the specification language inspired by [17] and also used in [1, 2]. The syntax of the language is as follows. Definition 2. For every # # and natural number i, # and # #i are atomic SL formulas; true is also an atomic SL formula. Every atomic is an and the negation, conjunction, and disjunction of are also SL formulas. A string w over # ....

N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking XML views of relational databases. In Proc. 16th IEEE Symposium on Logic in Computer Science (LICS 2001), pages 421--130, 2001.


Typechecking for Semistructured Data - Suciu (2001)   (6 citations)  Self-citation (Suciu)   (Correct)

No context found.

N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking xml views of relational databases. In LICS, 2001.


A Web Odyssey: from Codd to XML - Vianu (2001)   (29 citations)  Self-citation (Vianu)   (Correct)

No context found.

#13# N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking XML views of relational databases,


A Web Odyssey: from Codd to XML - Vianu (2001)   (29 citations)  Self-citation (Vianu)   (Correct)

....prototype enabling the definition of XML views from a relational database [46] The typechecking problem now asks whether all views generated from the database satisfy a target DTD, possibly specialized. The database itself may satisfy given integrity constraints. This problem is investigated in [13], using an abstraction of the query language of SilkRoute. Once again, the general problem is undecidable, and the limits of decidability are established. 5. NEW FRONTIERS As we have seen, database theory has made a good start in providing foundations for semi structured data, XML, query ....

N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking XML views of relational databases, 2001. Manuscript.


Ramsey Theory Applications - Vera Rosta Dept   (Correct)

No context found.

Alon, N., Milo, T., Neven, F., Suciu, D., and Vianu, V. Typechecking XML views of relational databases. ACM Trans. Comput. Log. 4, 3 (


A Uniform System for Publishing and Maintaining XML Data - Ron Choi University   (Correct)

No context found.

N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking XML views of relational databases. In LICS, 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC