An Equational Chase for Path-Conjunctive Queries, Constraints, and Views

Loading...
Thumbnail Image

Degree type

Discipline

Subject

Funder

Grant number

License

Copyright date

Distributor

Related resources

Author

Popa, Lucian

Contributor

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 embedded dependencies, as well as many interesting examples of complex value and oodb queries and integrity constraints. We show that some important classical results on containment, dependency implication, and chasing extend and generalize to this class.

Advisor

Date of presentation

1999-01-10

Conference name

Database Research Group (CIS)

Conference dates

2023-05-17T00:52:26.000

Conference location

Date Range for Data Collection (Start Date)

Date Range for Data Collection (End Date)

Digital Object Identifier

Series name and number

Volume number

Issue number

Publisher

Publisher DOI

Journal Issues

Comments

Postprint version. Published in Lecture Notes in Computer Science, International Conference on Database Theory (ICDT), Volume 1580, 1999, pages 39-57. Publisher URL: http://springerlink.metapress.com/link.asp?id=105633

Recommended citation

Collection