Papers on Database Programming Languages

Note: All papers are in PostScript format and have been compressed.

Path Constraints on Deterministic Graphs (132K)
Peter Buneman, Wenfei Fan and Scott Weinstein
Technical Report MS-CIS-98-33, University of Pennsylvania, 1998.
See here for the abstract.

Equality, Type and Word Constraints (138K)
Peter Buneman, Wenfei Fan and Scott Weinstein
Technical Report MS-CIS-98-32, University of Pennsylvania, 1998.
See here for the abstract.

Interaction between Path and Type Constraints (173K)
Peter Buneman, Wenfei Fan and Scott Weinstein
Technical Report MS-CIS-98-16, University of Pennsylvania, 1998.
See here for the abstract.

Path Constraints on Semistructured and Structured Data (96K)
Peter Buneman, Wenfei Fan and Scott Weinstein
To appear in PODS98.
See here for the abstract.

Some Undecidable Implication Problems for Path Constraints (119K)
Peter Buneman, Wenfei Fan and Scott Weinstein
Technical Report MS-CIS-97-14, University of Pennsylvania, 1997.
See here for the abstract.

The Decidability of Some Restricted Implication Problems for Path Constraints (147K)
Peter Buneman, Wenfei Fan and Scott Weinstein
Technical Report MS-CIS-97-15, University of Pennsylvania, 1997.
See here for the abstract.

Path Constraints in the Presence of Types (127K)
Peter Buneman, Wenfei Fan and Scott Weinstein
Technical Report MS-CIS-97-16, University of Pennsylvania, 1997.
See here for the abstract.

Querying an Object-Oriented Database Using CPL (96K)
Susan B. Davidson, Carmem Hara, and Lucian Popa
Technical Report MS-CIS-97-07, University of Pennsylvania, 1997.
See here for the abstract.

Adding Structure to Unstructured Data (164K)
Peter Buneman, Susan Davidson, Mary Fernandez and Dan Suciu
Technical Report MS-CIS-96-21, CIS Department, University of Pennsylvania.
See here for the abstract.

A Query Language and Optimization Techniques for Unstructured Data (133K)
Peter Buneman, Susan Davidson, Gerd Hillebrand and Dan Suciu
Technical Report MS-CIS-96-09, CIS Department, University of Pennsylvania.
An extended abstract of this work appears in SIGMOD Proceedings, 1996.
See here for the abstract.

A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization Techniques (86K)
Leonid Libkin, Rona Machlin and Limsoon Wong
SIGMOD Proceedings, 1996.
See here for the abstract.

Polymorphism and Type Inference in Database Programming (165K)
Peter Buneman and Atsushi Ohori
ACM Transactions on Database Systems 21 (1996), pp 30-76.
See here for the abstract.

Observational Properties of Databases with Object Identity (88K)
Anthony Kosky
Technial Report MS-CIS-95-20, University of Pennsylvania, 1995.
See here for the abstract.

Principles of Programming with Complex Objects and Collection Types (122K)
P. Buneman, S. Naqvi, V. Tannen and L. Wong
Theoretical Computer Science 149 (1995), pp 3-48.
See here for the abstract.

Infinitary Logic and Inductive Definability over Finite Structures (124K)
A. Dawar, S. Lindell and S. Weinstein
Information and Computation 119 (1995), pp 160-175.
Technical Report MS-CIS-91-97, University of Pennsylvania, 1991.
See here for the abstract.

Programming Constructs for Unstructured Data (67K)
P. Buneman, S.B. Davidson and Dan Suciu
In the Proceeding of the Fifth International Workshop on Database Programming Languages, Sept. 1995 (Gubbio, Italy).
Also available as Technical Report MS-CIS-95-14, University of Pennsylvania, 1995.
See here for the abstract.

Pruning Nested Data Values Using Branch Expressions With Wildcards (107K)
K. Hart and L. Wong
In Abstracts of MIMBD, Cambridge, England, July 1995.
See here for the abstract.

Types with Extents (325K)
Anthony Kosky
Thesis Proposal
See here for the abstract.

Approximation in Databases (76K)
Leonid Libkin
In Proceedings of 5th International Conference on Database Theory, Prague, Czech Republic, January 1995.
See here for the abstract.

Domain-independent Queries on Databases with External Functions (87K)
Dan Suciu
In Proceedings of 5th International Conference on Database Theory, Prague, Czech Republic, January 1995.
Also available as University of Pennsylvania Technical Report MS-CIS-94-48/L&C 87
See here for the abstract.

On Two Forms of Structural Recursion (95K)
Dan Suciu and Limsoon Wong
In Proceedings of 5th International Conference on Database Theory, Prague, Czech Republic, January 1995.
See here for the abstract.

Efficient Compilation of High-Level Data-Parallel Algorithms (103K)
Dan Suciu and Val Tannen
In Proceedings of SPAA, June 1994.
Note: Available as Technical Report MS-CIS-94-17, L&C 78, University of Pennsylvania, 1994.
See here for the abstract.

New Techniques for Studying Set Languages, Bag Languages, and Aggregate Functions (93K)
Leonid Libkin and Limsoon Wong
In Proceedings of 13th ACM Symposium on Principles of Database Systems, Minneapolis, Minnesota, May 1994, pp 155-166.
Note: Available as Technical Report MS-CIS-93-95/L&C-75, University of Pennsylvania, 1993.
See here for the abstract.

Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure (79K)
Dan Suciu and Jan Paredaens
In Proceedings of 13th ACM Symposium on Principles of Database System, Minneapolis, Minnesota, May 1994, pp 201-209.
Note: Available as Technical Report MS-CIS-94-04, L&C 76, University of Pennsylvania, 1994.
See here for the abstract.

A Query Language for NC (91K)
Dan Suciu and Val Tannen
In Proceedings of 13th ACM Symposium on Principles of Database Systems, Minneapolis, Minnesota, May 1994, pp 167-178.
Note: Available as Technical Report MS-CIS-94-05, University of Pennsylvania, 1994.
See here for the abstract.

Comprehension Syntax (69K)
Peter Buneman, Leonid Libkin, Dan Suciu, Val Tannen and Limsoon Wong
In Sigmod Record 23(1):87-96, March 1994.
See here for the abstract.

Conservativity of Nested Relational Calculi with Internal Generic Functions (63K)
Leonid Libkin and Limsoon Wong
In Information Processing Letters, March 1994, 46(6):273-280.
See here for the abstract.

Queries on databases with user-defined functions (109K)
Dan Suciu
Technical Report MC-CIS-93-62, University of Pennsylvania, 1993.
See here for the abstract.

The Fast Fourier Transform as a Database Query (28K)
Peter Buneman
Technical Report MS-CIS-93-37/L&C 60, University of Pennsylvania, 1993.
See here for the abstract.

Some Properties of Query Languages for Bags (83K)
Leonid Libkin and Limsoon Wong
In Proceedings of 4th International Workshop on Database Programming Languages, New York, August 1993, pp 97-114.
Note: Full paper available as UPenn Technical Report MS-CIS-93-36.
See here for the abstract.

Aggregate Functions, Conservative Extension, and Linear Orders (63K)
Leonid Libkin and Limsoon Wong
In Proceedings of 4th International Workshop on Database Programming Languages, New York, August 1993, pp 282-294.
See here for the abstract.

Bounded Fixpoints for Complex Objects (98K)
Dan Suciu
In Proceedings of 4th International Workshop on Database Programming Languages, New York, August 1993, pp 263-281.
Note: Full paper available as UPenn Technical Report MC-CIS-93-32.
See here for the abstract.

Normal Forms and Conservative Properties for Query Languages over Collection Types (71K)
Limsoon Wong
In Proceedings of 12th ACM Symposium on Principles of Database Systems, Washington, D. C., May 1993, pp 26-36.
See here for the abstract.

Semantic Representations and Query Languages for Orsets (81K)
Leonid Libkin and Limsoon Wong
In Proceedings of 12th ACM Symposium on Principles of Database Systems, Washington, D. C., May 1993, pp 37-48.
See here for the abstract.
See here for the full paper (142K).

Naturally Embedded Query Languages (99K)
Val Breazu-Tannen, Peter Buneman and Limsoon Wong
In LNCS 646: Proceedings of International Conference on Database Theory, Berlin, Germany, October 1992, pp 140-154.
See here for the abstract.

A Type System that Reconciles Classes and Extents (76K)
Peter Buneman and Atsushi Ohori
In Proceedings of 3rd International Conference on Database Programming Languages, Nafplion, Greece, pp 191-202, Morgan Kaufmann.
See here for the abstract.

Structural Recursion as a Query Language (68K)
Val Breazu-Tannen, Peter Buneman and Shamim Naqvi
In Proceedings of 3rd International Conference on Database Programming Languages, Nafplion, Greece, pp 9-19, Morgan Kaufmann.
See here for the abstract.

Logical and Computational Aspects of Programming with Sets/Bags/Lists (86K)
Val Breazu-Tannen and Ramesh Subrahmanyam
In LNCS 510: Proceedings of 18th International Colloquium on Automata, Languages, and Programming, Madrid, Spain, July 1991, pp. 60-75.
Note: This slightly revised version of the paper that has appeared in the ICALP Proceedings is also available as University of Pennsylvania Technical Report MS-CIS-91-29.
See here for the abstract.

Database Programming in Machiavelli -- a Polymorphic Language with Static Type Inference (75K)
Atsushi Ohori, Peter Buneman and Val Breazu-Tannen
In Proceedings of 1989 ACM SIGMOD International Conference on Management of Data, Portland, May 1989, pp 46-57.
See here for the abstract.

Back to DB Group Homepage