Annotated XML: Queries and Provenance (2009)
J. Nathan, Foster Todd, J. Green, Val Tannen
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, we decorate unordered...
Thesis: Rupiah: Towards an Expressive Static Type System for Java (2009)
J. Nathan Foster, Adviser Benjamin, C. Pierce, Committee Zachary Ives, Val Tannen, Philip Wadler (external
Annotated XML: Queries and Provenance (2009)
J. Nathan, Foster Todd, J. Green, Val Tannen
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, we decorate unordered...
Reconcilable differences (2009)
Todd J. Green, Zachary G. Ives, Val Tannen
Exact query reformulation using views in positive relational languages is well understood, and has a variety of applications in query optimization and data sharing. Generalizations to larger...
Dirk Van Gucht, Christopher Re, Dan Suciu, Val Tannen
2007. The present book contains some of the scientific papers that were presented at the symposium, but contains also additional papers, written by scientific friends of Jan, written especially to...
Search Engine for XML Schemas (2008)
Name Zhishuang Zhang, Val Tannen, Zachary Ives, Zhishuang Zhang, Val Tannen, Zachary Ives
XML, which stands for eXtensible Markup Language, has become important as a data storage and interchange format, because of its properties of being able to describe structured data, platform...
Annotated XML: Queries and Provenance (2008)
Foster, John N, Green, Todd J, Tannen, Val
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, we decorate unordered...
Services—Data sharing General Terms (2008)
Todd J. Green, Grigoris Karvounarakis, Nicholas E. Taylor, Olivier Biton, Zachary G. Ives, Val Tannen
mappings 1.
Vassilis Christophides, Gregory Karvounarakis, Aimilia Magkanaraki, Dimitris Plexousakis, Val Tannen, Information Integration, ...
A Pc Chase, Lucian Popa, Val Tannen
PC stands for path-conjunctive, the name of a class of queries and dependencies that we define over complex values with dictionaries. This class includes the relational conjunctive queries and...
Conjunctive queries and mappings with unequalities (2008)
Karvounarakis, Grigoris, Tannen, Val
We study conjunctive queries with unequalities (x ≠y) and we identify cases when query containment can still be characterized by the existence of homomorphisms. We also identify a class of...
Update Exchange with Mappings and Provenance (2007)
Green, Todd J, Karvounarakis, Grigoris, Ives, Zachary G, Tannen, Val
We consider systems for data sharing among heterogeneous peers related by a network of schema mappings. Each peer has a locally controlled and edited database instance, but wants to ask queries over...
Presented to the Faculties of the University of Pennsylvania (2007)
Lucian Popa, Val Tannen, Val Tannen, Jonathan Crabtree, Susan Davidson, Alin Deutsch, ...
I am indebted to Val Tannen, my advisor. This dissertation would not have been possible without his invaluable ideas, support, and advice. His deep insight into both fields of databases and...
Aimilia Magkanaraki, Val Tannen, Vassilis Christophides
Abstract. Personalized access and content syndication involving diverse conceptual representations of information resources are two of the key challenges of real-scale Semantic Web (SW) applications,...
Orchestra: Facilitating Collaborative Data Sharing (2007)
Green, Todd J, Karvounarakis, Grigoris, Taylor, Nicholas E, Biton, Olivier, Ives, Zachary G, Tannen, Val
One of the most elusive goals of structured data management has been sharing among large, heterogeneous populations: while data integration [4, 10] and exchange [3] are gradually being adopted by...
Green, Todd J, Karvounarakis, Grigoris, Tannen, Val
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and why provenance are particular cases of the same general algorithms involving...
Update Exchange with Mappings and Provenance (2007)
Todd J. Green, Grigoris Karvounarakis, Zachary G. Ives, Val Tannen
We consider systems for data sharing among heterogeneous peers related by a network of schema mappings. Each peer has a locally controlled and edited database instance, but wants to ask queries over...
Update Exchange with Mappings and Provenance (2007)
Todd J. Green, Grigoris Karvounarakis, Zachary G. Ives, Val Tannen
We consider systems for data sharing among heterogeneous peers related by a network of schema mappings. Each peer has a locally controlled and edited database instance, but wants to ask queries over...
Update Exchange with Mappings and Provenance (2007)
Todd J. Green, Grigoris Karvounarakis, Zachary G. Ives, Val Tannen
We consider systems for data sharing among heterogeneous peers related by a network of schema mappings. Each peer has a locally controlled and edited database instance, but wants to ask queries over...
Update Exchange with Mappings and Provenance (2007)
Todd J. Green, Grigoris Karvounarakis, Zachary G. Ives, Val Tannen
We consider systems for data sharing among heterogeneous peers related by a network of schema mappings. Each peer has a locally controlled and edited database instance, but wants to ask queries over...
Models for Incomplete and Probabilistic Information (2006)
We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite domains and we introduce a new...
Models for Incomplete and Probabilistic Information (2006)
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite domains and we...
Containment and minimization of RDF/S query patterns (2005)
Giorgos Serfiotis, Ioanna Koffina, Vassilis Christophides, Val Tannen
Abstract. Semantic query optimization (SQO) has been proved to be quite useful in various applications (e.g., data integration, graphical query generators, caching, etc.) and has been extensively...
Koffina, Ioanna, Serfiotis, Giorgos, Christophides, Vassilis, Tannen, Val, Deutsch, Alin, Industrial Experiences
Semantic Web (SW) technology aims to facilitate the integration of legacy data sources spread worldwide. Despite the plethora of SW languages e.g., RDF/S, OWL recently proposed for supporting large...
MARS: A System for Publishing XML from Mixed and Redundant Storage (2003)
We present a system for publishing as XML data from mixed (relational+XML) proprietary storage, while supporting redundancy in storage for tuning purposes. The correspondence between public and...
The ICS-FORTH SWIM: A Powerful Semantic Web Integration Middleware (2003)
Christophides, Vassilis, Karvounarakis, Grigoris, Koffina, I., Kokkinidis, G., Magkanaraki, A., Plexousakis, Dimitris, ...
Semantic Web (SW) technology aims to facilitate the integration of legacy data sources spread worldwide. Despite the plethora of SW languages (e.g., RDF/S, DAML+OIL, OWL) recently proposed for...
Reformulation of XML Queries and Constraints (2003)
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redundancies...
MARS: A System for Publishing XML from Mixed and Redundant Storage (2003)
We present a system for publishing as XML data from mixed (relational+XML) proprietary storage, while supporting redundancy in storage for tuning purposes. The correspondence between public and...
V.Tannen: The ICS-FORTH Semantic Web Integration Middleware (2003)
Vassilis Christophides, Gregory Karvounarakis, Aimilia Magkanaraki, Dimitris Plexousakis, Vassilika Vouton, P. O. Box, ...
gregkar, aimilia, dp
Viewing the Semantic Web through RVL Lenses (2003)
Aimilia Magkanaraki, Val Tannen, Vassilis Christophides, Dimitris Plexousakis
Personalized access and content syndication involving diverse conceptual representations of information resources are two of the key challenges of real-scale Semantic Web (SW) applications, such as...
V.Tannen: The ICS-FORTH Semantic Web Integration Middleware (2003)
Vassilis Christophides, Gregory Karvounarakis, Aimilia Magkanaraki, Dimitris Plexousakis, Vassilika Vouton, P. O. Box, ...
Reformulation of XML Queries and Constraints (2003)
Abstract. We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redundancies...
Viewing the Semantic Web Through RVL Lenses (2003)
Aimilia Magkanaraki, Val Tannen, Vassilis Christophides
Abstract. Personalized access and content syndication involving diverse conceptual representations of information resources are two of the key challenges of real-scale Semantic Web (SW) applications,...
Querying XML with Mixed and Redundant Storage (2002)
This paper examines some of the issues that arise in the process of XML publishing of mixed-storage proprietary data. We argue that such data will reside typically in RDBMS's and/or LDAP, etc,...
Containment and Integrity Constraints for XPath Fragments (2001)
XPath is a W3C standard that plays a crucial role in several influential query, transformation, and schema standards for XML. Motivated by the larger challenge of XML query optimization, we...
ubQL, a Language for Programming Distributed Query Systems (2001)
ubQL is a distributed query language for programming large-scale distributed query systems such as resource sharing systems. The language is obtained by adding a small set of mobile process...
K2/Kleisli and GUS: Experiments in Integrated Access to Genomic Data Sources (2001)
Davidson, Susan B, Crabtree, Jonathan, Brunk, Brian P., Schug, Jonathan, Tannen, Val, Overton, Chris, ...
The integration of heterogeneous data sources and software systems is a major issue in the biomed ical community and several approaches have been explored: linking databases, "on-the- fly"...
Deutsch, Alin, Popa, Lucian, Tannen, Val
We have previously proposed chase and backchase as a novel method for using materialized views and integrity constraints in query optimization. In this paper, we show that the method is usable in...
Resource Sharing Through Query Process Migration (2001)
In this paper we focus on systems whose goal is the distribution or exchange of resources such as software packages, scientific data, or multimedia files. To accomplish this goal efficiently,...
Optimization Properties for Classes of Conjunctive Regular Path Queries (2001)
We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment both in the absence and presence...
Michael Hicks, Scott M. Nettles, Val Tannen, Michael Hicks
This dissertation, while an achievement that bears my name, would not have been possible without the help of others, who I would now like to thank. First and foremost, I thank God. He has been a...
Formal Analysis of Routing Protocols (2001)
Val Tannen, G. Grin, F. Bruce Shepherd, Gordon Wilfong, Lixin Gao, Dimosthenis Anthomelidis, ...
thank them for the inspiration they provided. I would like to thank the CISCO Corporation, and especially Alvaro Retana, for supporting my research on BGP. I would also like to thank Rajeev
Containment and integrity constraints for xpath fragments (2001)
XPath is a W3C standard that plays a crucial role in several influential query, transformation, and schema standards for XML. Motivated by the larger challenge of XML query optimization, we...
K2/Kleisli and GUS: Experiments in Integrated Access to Genomic Data Sources (2001)
Susan B. Davidson, Jonathan Crabtree, Brian Brunk, Jonathan Schug, Val Tannen, Chris Overton, ...
The integration of heterogeneous data sources and software systems is a major issue in the biomedical community and several approaches have been explored: linking databases, \on-the- y "...
Scott M. Nettles, Val Tannen, Michael Hicks, Michael Hicks
This dissertation, while an achievement that bears my name, would not have been possible without the help of others, who I would now like to thank. First and foremost, I thank God. He has been a...
Achieving Economic and Computational Efficiency (2001)
Lyle H. Ungar, Val Tannen, David Christopher Parkes, David Christopher Parkes, Supervisor Lyle, H. Ungar
ACHIEVING ECONOMIC AND COMPUTATIONAL EFFICIENCY David Christopher Parkes Supervisor: Lyle H. Ungar This thesis presents new auction-based mechanisms to coordinate systems of selfinterested and...
Iterative combinatorial auctions: Achieving economic and computational efficiency (2001)
Lyle H. Ungar, Val Tannen, David Christopher Parkes, David Christopher Parkes, David Christopher Parkes, Supervisor Lyle, ...
None of this would be possible without my advisor, Lyle Ungar. You cannot imagine how grateful I am for your constant support and guidance. You are an amazing inspiration. I hope this dissertation...
Popa, Lucian, Deutsch, Alin, Sahuguet, Arnaud, Tannen, Val
In a previous paper we proposed a novel method for generating alternative query plans that uses chasing (and back-chasing) with logical constraints. The method brings together use of indexes, use of...
Lucian Popa, Alin Deutsch, Arnaud Sahuguet, Val Tannen
In a previous paper we proposed a novel method for generating alternative query plans that uses chasing (and back-chasing) with logical constraints. The method brings together use of indexes, use of...
Lucian Popa, Alin Deutsch, Arnaud Sahuguet, Val Tannen
In a previous paper we proposed a novel method for generating alternative query plans that uses chasing (and back-chasing) with logical constraints. The method brings together use of indexes, use of...
Techniques for Mitigating Lag-Time When Joining Interest Groups in Real-Time Simulations (2000)
B. Greenwald, Val Tannen, Karen Carter, Rama Bindiganavale, John Granieri, Thomas J. Smith, ...
Distributed virtual environments, which simulate a physical or imaginary world on a network and allow multiple participants to interact simultaneously with one another within it, are becoming...
Physical Data Independence, Constraints and Optimization with Universal Plans (1999)
Deutsch, Alin, Popa, Lucian, Tannen, Val
We present an optimization method and al gorithm designed for three objectives: physi cal data independence, semantic optimization, and generalized tableau minimization. The method relies on...
An Equational Chase for Path-Conjunctive Queries, Constraints, and Views (1999)
We consider the class of path-conjunctive queries and constraints (dependencies) defined over complex values with dictionaries. This class includes the relational conjunctive queries and embedded...
Popa, Lucian, Deutsch, Alin, Sahuguet, Arnaud, Tannen, Val
In a previous paper* we proposed a novel method for generating alternative query plans that uses chasing (and back-chasing) with logical constraints. The method brings together use of indexes, use of...
Silverman, Barry G., Wong, Alex, Lang, Lance, Khoury, Allan, Campbell, Keith, Tannen, Val, ...
This paper describes the efforts of a consortium that is trying to develop and validate formal methods and a meta-environment for authoring, checking, and maintaining a large repository of machine...
Physical data independence, constraints, and optimization with universal plans (1999)
Alin Deutsch, Lucian Popa, Val Tannen
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method relies on...
An Equational Chase for Path-Conjunctive Queries, Constraints, and Views (1999)
Abstract. We consider the class of path-conjunctive queries and constraints (dependencies) defined over complex values with dictionaries. This class includes the relational conjunctive queries and...
Physical Data Independence, Constraints, and Optimization With Universal Plans (1999)
Alin Deutsch, Lucian Popa, Val Tannen
We present an optimization method and al# gorithm designed for three objectives# physi# cal data independence# semantic optimization# and generalized tableau minimization. The method relies on...
Venus: A Virtual Environment Network Using (1999)
Satellites Sanjay Udani, Val Tannen, Sanjay K. Udani, Sanjay K. Udani, Sanjay K. Udani, Jonathan M. Smith, ...
VENUS: A VIRTUAL ENVIRONMENT NETWORK USING SATELLITES Sanjay K. Udani Jonathan M. Smith & David J. Farber Network access has evolved from basic text-only terminals to color graphical browsers...
Professional Experience (1999)
Partha Pratim Talukdar, Advisors Prof, Mark Liberman, Prof Fern, O Pereira, Best Poster Award, ...
I am primarily interested in Machine Learning and Computational Linguistics. My recent research
Efficient Compilation of High-Level Data Parallel Algorithms. (1998)
We present a high-level parallel calculus for nested sequences, NSC, offered as a possible theoretical "core" of an entire class of collection-oriented parallel languages. NSC is based on while-loops...
Engineering Robust Distributed Database Software (1998)
Tannen, Val, Buneman, Peter, Davidson, Susan
The research has focused on a technology for mobile information management.' Underlying this technology is a mathematical foundation enabling the use of formal methods in developing and reasoning...
PC stands for path-conjunctive, the name of a class of queries and dependencies that we define over complex values with dictionaries. This class includes the relational conjunctive queries and...
Chase and Axioms for PC Queries and Dependencies (1998)
This report is the extended version of [PT99] and while they are some overlapping parts (mainly the results) we don't repeat here some of the examples given in [PT99], even though we frequently...
BioKleisli: A Digital Library for Biomedical Researchers (1997)
S.B. Davidson, Susan B. Davidson, V. Tannen, L. Wong, C. Overton, Val Tannen, ...
. Data of interest to biomedical researchers associated with the Human Genome Project (HGP) is stored all over the world in a number of different electronic data formats and accessible through a...
A Typed Pattern Calculus (1996)
Delia Kesner, Laurence Puel, Val Tannen
The theory of programming with pattern-matching function definitions has been studied mainly in the framework of first-order rewrite systems. We present a typed functional calculus that emphasizes...
Proof Theoretic Concepts for the Semantics of Types and Concurrency (1995)
Gunter, Carl A, Tannen, Val, Coquand, Thierry, Scedrov, Andre
We present a method for providing semantic interpretations for languages with a type system featuring inheritance polymorphism. Our approach is illustrated on an extension of the language Fun of...
Parallel Programming Languages for Collections (1995)
In this paper we propose a new framework for parallel processing of collections. We define a high-level language called CoPa for processing nested sets, bags, and sequences (a generalization of...
Principles of Programming with Complex Objects and Collection Types (1995)
Peter Buneman, Shamim Naqvi, Val Tannen, Limsoon Wong
We present a new principle for the development of database query languages that the primitive operations should be organized around types. Viewing a relational database as consisting of sets of...
Principles of Programming with Complex Objects and Collection Types (1995)
Peter Buneman Shamim, Peter Buneman, Shamim Naqvi, Val Tannen, Limsoon Wong
We present a new principle for the development of database query languages that the primitive operations should be organized around types. Viewing a relational database as consisting of sets of...
Principles of Programming with Complex Objects and Collection Types (1995)
Peter Buneman, Shamim Naqvi, Val Tannen, Limsoon Wong
We present a new principle for the development of database query languages that the primitive operations should be organized around types. Viewing a relational database as consisting of sets of...
Efficient Compilation of High-Level Data Parallel Algorithms (1994)
We present a high-level parallel calculus for nested sequences, NSC offered as a possible theoretical "core" of an entire class of collection-oriented parallel languages. NSC is based on while-loops...
A Query Language for NC (1994)
We show that a form of divide and conquer recursion on sets together with the relational algebra expresses exactly the queries over ordered relational databases which are NC-computable. At a finer...
Peter Buneman, Leonid Libkin, Dan Suciu, Val Tannen, Limsoon Wong
Abstract. The syntax of comprehensions is very close to the syntax of a number of practical database query languages and is, we believe, a better starting point than first-order logic for the...
Tutorial: Languages for Collection Types (1994)
Collection types such as sets, bags (multisets), lists, complex objects, nested relations, arrays, and certain kinds of trees are widely used in non-traditional database applications and must...
Efficient Compilation of High-Level Data Parallel Algorithms (1994)
We present a high-level parallel calculus for nested sequences, NSC, offered as a possible theoretical "core" of an entire class of collection-oriented parallel languages. NSC is based on...
A Query Language for NC (1994)
We show that a form of divide and conquer recursion on sets together with the relational algebra expresses exactly the queries over ordered relational databases which are NC -computable. At a finer...
Peter Buneman Leonid, Leonid Libkin, Dan Suciu, Val Tannen, Limsoon Wong
. The syntax of comprehensions is very close to the syntax of a number of practical database query languages and is, we believe, a better starting point than first-order logic for the development of...
Peter Buneman, Leonid Libkin, Dan Suciu, Val Tannen, Limsoon Wong
. The syntax of comprehensions is very close to the syntax of a number of practical database query languages and is, we believe, a better starting point than first-order logic for the development of...
Efficient Compilation of High-Level Data Parallel Algorithms (1994)
We present a high-level parallel calculus for nested sequences, NSC, offered as a possible theoretical "core" of an entire class of collection-oriented parallel languages. NSC is based on...
Peter Buneman, Leonid Libkin, Dan Suciu, Val Tannen, Limsoon Wong
. The syntax of comprehensions is very close to the syntax of a number of practical database query languages and is, we believe, a better starting point than first-order logic for the development of...
Naturally Embedded Query Languages (1992)
Tannen, Val, Buneman, Peter, Wong, Limsoon
We investigate the properties of a simple programming language whose main computational engine is structural recursion on sets. We describe a progression of sublanguages in this paradigm that (1)...
Structural Recursion As A Query Language (1992)
Tannen, Val, Buneman, Peter, Naqvi, Shamim
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. Its main computational...
Polymorphic Rewriting Conserves Algebraic Confluence (1992)
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term rewriting. Algebraic and lambda terms are mixed by adding the symbols of the algebraic signature to...
Logical and Computational Aspects of Programming with Sets/Bags/Lists (1991)
Tannen, Val, Subrahmanyam, Ramesh
We study issues that arise in programming with primitive recursion over non-free datatypes such as lists, bags and sets. Programs written in this style can lack a meaning in the sense that their...
Inheritance As Implicit Coercion (1991)
Tannen, Val, Coquand, Thierry, Gunter, Carl A., Scedrov, Andre
We present a method for providing semantic interpretations for languages with a type system featuring inheritance polymorphism. Our approach is illustrated on an extension of the language Fun of...
Polymorphic Rewriting Conserves Algebraic Strong Normalization (1990)
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term rewriting. Algebraic and lambda terms are mixed by adding the symbols of the algebraic signature to...
Lambda Calculus,Conservative Extension and Structural Induction (1989)
Tannen, Val, Subrahmanyam, Ramesh
The issue of whether embedding algebraic theories in higher-order theories such as the simply typed and polymorphic lambda calculi is of interest in programming language design. The establishment of...
Computing with Coercions (1989)
Tannen, Val, Gunter, Carl A, Scedrov, Andre
This paper relates two views of the operational semantics of a language with multiple inheritance. It is shown that the introduction of explicit coercions as an interpretation for the implicit...
Denotational Semantics for Subtyping Between Recursive Types (1989)
Tannen, Val, Gunter, Carl A, Scedrov, Andre
Inheritance in the form of subtyping is considered in the framework of a polymorphic type discipline with records, variants, and recursive types. We give a denotational semantics based on the...
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence (1989)
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term rewriting. Algebraic and lambda terms are mixed by adding the symbols of the algebraic signature to...
Database Programming in Machiavelli - A Polymorphic Language with Static Type Inference (1988)
Ohori, Atsushi, Buneman, Peter, Tannen, Val
Machiavelli is a polymorphically typed programming language in the spirit of ML, but supports a different type inferencing that makes its polymorphism somewhat more general than that of ML and...
Extensional Models for Polymorphism (1988)
We present a general method for constructing extensional models for the Girard-Reynolds polymorphic lambda calculus - the polymorphic extensional collapse. The method yields models that satisfy...
Combining Algebra and Higher-Order Types (1988)
We study the higher-order rewrite/equational proof systems obtained by adding the simply typed lambda calculus to algebraic rewrite/equational proof systems. We show that if a many-sorted algebraic...
We investigate extensions to the language of hereditary Harrop formulas as logical frameworks for meta-theoretic analysis of deductive systems. We find that a combination of partial inductive...