Filters








57 Hits in 1.2 sec

Foreword

Thomas Schwentick, Dan Suciu
2008 Theory of Computing Systems  
The paper shows that these asymptotic conditional probabilities always exist, it exhibits explicit formulas for them, and studies the (non-trivial) computational complexity of their computation.  ...  Motivated by considerations from Data Privacy, Query evaluation on a database given by a random graph by Nilesh Dalvi studies asymptotic conditional probabilities of conjunctive queries over sparse relational  ...  The other three articles are concerned with semistructured data and XML.  ... 
doi:10.1007/s00224-008-9156-4 fatcat:224btzm5ynfu7ho6nuzq23327u

XML with data values: typechecking revisited

Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
2003 Journal of computer and system sciences (Print)  
The main contribution of the present paper is to trace a fairly tight boundary of decidability for typechecking with data values.  ...  The present paper investigates typechecking of queries with comparisons of data values.  ...  Yet another approach to typechecking is taken by YAT [6, 8] . This system for semistructured data has an original type system, based on unordered types.  ... 
doi:10.1016/s0022-0000(03)00032-1 fatcat:lievrskogndkzgl6qtmr7gwntq

XML with data values

Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
2001 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '01  
The main contribution of the present paper is to trace a fairly tight boundary of decidability for typechecking with data values.  ...  The present paper investigates typechecking of queries with comparisons of data values.  ...  Yet another approach to typechecking is taken by YAT [6, 8] . This system for semistructured data has an original type system, based on unordered types.  ... 
doi:10.1145/375551.375570 dblp:conf/pods/AlonMNSV01 fatcat:izvhnayfyfgfhnnjqrqk76ylx4

A Web odyssey

Victor Vianu
2003 SIGMOD record  
What does the age of the Web mean for database the ory? It is a challenge and an opportunity, an exciting journey of rediscovery. These are some notes from the road.  ...  Schemas for XML. XML marks the return of the schema" in semistructured data, in the form of its Data Type Denitions DTDs.  ...  A query language for semistructured data based on the ambient calculus a modal logic for mobile computation has recently been proposed 32 .  ... 
doi:10.1145/776985.776999 fatcat:bnoqb57m4narbanpijq5eeghdi

XML: Model, Schemas, Types, Logics, and Queries [chapter]

Nils Klarlund, Thomas Schwentick, Dan Suciu
2004 Logics for Emerging Applications of Databases  
Semistructured Data XML can, of course, represent more than relational data. The kind of data it can express is called semistructured data.  ...  In general, labeled graphs for representing information are called semistructured data. XML is superficially less general because it emphasizes trees.  ... 
doi:10.1007/978-3-642-18690-5_1 fatcat:f5mtevnovffhnpfgdpb7rqlmji

A Web Odyssey

Victor Vianu
2001 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '01  
What does the age of the Web mean for database the ory? It is a challenge and an opportunity, an exciting journey of rediscovery. These are some notes from the road.  ...  Schemas for XML. XML marks the return of the schema" in semistructured data, in the form of its Data Type Denitions DTDs.  ...  A query language for semistructured data based on the ambient calculus a modal logic for mobile computation has recently been proposed 32 .  ... 
doi:10.1145/375551.375554 dblp:conf/pods/Vianu01 fatcat:4r527z4hdbelbflp7ijl74edoe

Typechecking for XML transformers

Tova Milo, Dan Suciu, Victor Vianu
2003 Journal of computer and system sciences (Print)  
The main result of the paper is that typechecking for k-pebble transducers is decidable.  ...  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  ...  Acknowledgments We thank Nils Klarlund for his comments.  ... 
doi:10.1016/s0022-0000(02)00030-2 fatcat:a2bxrrse3vf2pha25mrbwnaulu

Typechecking for XML transformers

Tova Milo, Dan Suciu, Victor Vianu
2000 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00  
The main result of the paper is that typechecking for k-pebble transducers is decidable.  ...  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  ...  Acknowledgments We thank Nils Klarlund for his comments.  ... 
doi:10.1145/335168.335171 dblp:conf/pods/MiloSV00 fatcat:hc2feri2lvetnoduhkntza2lwu

On the complexity of typechecking top-down XML transformations

Wim Martens, Frank Neven
2005 Theoretical Computer Science  
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.  ...  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  ...  The main difference with semistructured data is the possibility to define schemas. In the context of the Web, such schemas can be used to validate data exchange.  ... 
doi:10.1016/j.tcs.2004.10.035 fatcat:nbbnmokbczcpfdbsoqb5fxsk4y

XDuce

Haruo Hosoya, Benjamin C. Pierce
2003 ACM Transactions on Internet Technology  
XDuce is a statically typed programming language for XML processing.  ...  Its basic data values are XML documents, and its types (so-called regular expression types) directly correspond to document schemas.  ...  On the other hand, pattern matching based on regular path expressions, popular in query languages for semistructured data [Deutsch et al. 1998; Abiteboul et al. 1997; Cluet and Siméon 1998 ], is less  ... 
doi:10.1145/767193.767195 fatcat:bnk4rkn6aramvgstqeypeyinoa

Union Types for Semistructured Data [chapter]

Peter Buneman, Benjamin Pierce
2000 Lecture Notes in Computer Science  
Query languages that are designed for semistructured data, even when used with structured data, typically ignore any type information that may be present.  ...  Much semistructured data originates in structured data.  ...  Acknowledgements The idea of using untagged unions to type semistructured data started when Peter Buneman was on a visiting research fellowship provided by the Japanese Society for the Promotion of Science  ... 
doi:10.1007/3-540-44543-9_12 fatcat:67xy67cubnf2jjrmv3nz3szeg4

A Rewriting-based Framework for Web Sites Verification

M. Alpuente, D. Ballis, M. Falaschi
2005 Electronical Notes in Theoretical Computer Science  
patterns inside semistructured documents.  ...  In this paper, we develop a framework for the automated verification of Web sites which can be used to specify integrity conditions for a given Web site, and then automatically check whether these conditions  ...  For instance, [1, 14] propose some techniques based on simulation for analyzing semistructured data w.r.t. a given schema.  ... 
doi:10.1016/j.entcs.2004.07.014 fatcat:4y7rvu3srndz3ob3xz6iysd5oy

Hybrid applications over XML

Paolo Manghi, Fabio Simeoni, David Lievens, Richard Connor
2002 Proceedings of the fourth international workshop on Web information and data management - WIDM '02  
For its original form of structural polymorphism, the language offers integrated support for the development of hybrid applications over XML, where data change form to reflect programming expectations  ...  We discuss the design of a quasi-statically typed language for XML in which data may be associated with different structures and different algebras in different scopes, whilst preserving identity.  ...  It should also be noted that the problem here is not related to labelled trees, which remain the preferred structures for a variety of computational tasks: document manipulation, semistructured data management  ... 
doi:10.1145/584933.584935 fatcat:fjq5sz3i2reifg3jjy5ol3zn7q

Manipulating Trees with Hidden Labels

Luca Cardelli, Philippa Gardner, Giorgio Ghelli
2007 Electronical Notes in Theoretical Computer Science  
Introduction Languages for Semistructured Data XML and semistructured data [1] are inspiring a new generation of programming and query languages based on more flexible type systems [26, 5, 6, 15] .  ...  We define an operational semantics and a type system for manipulating semistructured data that contains hidden information. The data model is simple labeled trees with a hiding operator.  ...  Gabbay for illuminating discussions on transpositions, and to Luís Caires who indirectly influenced this paper through earlier work with the first author.  ... 
doi:10.1016/j.entcs.2007.02.007 fatcat:hwxttro3rrhk5ivoyda6qhhjbm

Manipulating Trees with Hidden Labels [chapter]

Luca Cardelli, Philippa Gardner, Giorgio Ghelli
2003 Lecture Notes in Computer Science  
Introduction Languages for Semistructured Data XML and semistructured data [1] are inspiring a new generation of programming and query languages based on more flexible type systems [26, 5, 6, 15] .  ...  We define an operational semantics and a type system for manipulating semistructured data that contains hidden information. The data model is simple labeled trees with a hiding operator.  ...  Gabbay for illuminating discussions on transpositions, and to Luís Caires who indirectly influenced this paper through earlier work with the first author.  ... 
doi:10.1007/3-540-36576-1_14 fatcat:fnwvlvldc5fvlgeily2vdstlae
« Previous Showing results 1 — 15 out of 57 results