ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Constraint-Generating Dependencies.

Marianne Baudinet, Jan Chomicki, Pierre Wolper: Constraint-Generating Dependencies. ICDT 1995: 322-337
@inproceedings{DBLP:conf/icdt/BaudinetCW95,
  author    = {Marianne Baudinet and
               Jan Chomicki and
               Pierre Wolper},
  editor    = {Georg Gottlob and
               Moshe Y. Vardi},
  title     = {Constraint-Generating Dependencies},
  booktitle = {Database Theory - ICDT'95, 5th International Conference, Prague,
               Czech Republic, January 11-13, 1995, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {893},
  year      = {1995},
  isbn      = {3-540-58907-4},
  pages     = {322-337},
  ee        = {db/conf/icdt/BaudinetCW95.html},
  crossref  = {DBLP:conf/icdt/95},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 2, EDBT, ICDT, MFDBS, DASFAA" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

References

[1]
Bengt Aspvall, Michael F. Plass, Robert Endre Tarjan: A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Inf. Process. Lett. 8(3): 121-123(1979) BibTeX
[2]
Marianne Baudinet: On the Expressiveness of Temporal Logic Programming. Inf. Comput. 117(2): 157-180(1995) BibTeX
[3]
Marianne Baudinet: Temporal Logic Programming is Complete and Expressive. POPL 1989: 267-280 BibTeX
[4]
Marianne Baudinet, Jan Chomicki, Pierre Wolper: Temporal Deductive Databases. Temporal Databases 1993: 294-320 BibTeX
[5]
Marianne Baudinet, Marc Niézette, Pierre Wolper: On the Representation of Infinite Temporal Data and Queries. PODS 1991: 280-290 BibTeX
[6]
Catriel Beeri, Moshe Y. Vardi: A Proof Procedure for Data Dependencies. J. ACM 31(4): 718-741(1984) BibTeX
[7]
Alexander Brodsky, Joxan Jaffar, Michael J. Maher: Toward Practical Constraint Databases. VLDB 1993: 567-580 BibTeX
[8]
Alexander Brodsky, Catherine Lassez: Separability of Polyhedra and a New Approach to Spatial Storage (Extended Abstract). PPCP 1993: 7-11 BibTeX
[9]
Jan Chomicki: Polynomial Time Query Processing in Temporal Deductive Databases. PODS 1990: 379-391 BibTeX
[10]
Jan Chomicki, Tomasz Imielinski: Temporal Deductive Databases and Infinite Objects. PODS 1988: 61-73 BibTeX
[11]
Jan Chomicki, Tomasz Imielinski: Finite Representation of Infinite Query Answers. ACM Trans. Database Syst. 18(2): 181-223(1993) BibTeX
[12]
Jim Cox, Ken McAloon: Decision Procedures for Constraint Based Extensions of Datalog. WCLP 1991: 17-32 BibTeX
[13]
M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX
[14]
Seymour Ginsburg, Richard Hull: Order Dependency in the Relational Model. Theor. Comput. Sci. 26: 149-195(1983) BibTeX
[15]
Seymour Ginsburg, Richard Hull: Sort sets in the relational model. J. ACM 33(3): 465-488(1986) BibTeX
[16]
Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom: Constraint Checking with Partial Information. PODS 1994: 45-55 BibTeX
[17]
Naci Ishakbeyoglu, Z. Meral Özsoyoglu: On the Maintenance of Implication Integrity Constraints. DEXA 1993: 221-232 BibTeX
[18]
Christian S. Jensen, Richard T. Snodgrass: Temporal Specialization. ICDE 1992: 594-603 BibTeX
[19]
Froduald Kabanza, Jean-Marc Stévenne, Pierre Wolper: Handling Infinite Temporal Data. PODS 1990: 392-403 BibTeX
[20]
Paris C. Kanellakis: Elements of Relational Database Theory. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 1073-1156 BibTeX
[21]
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz: Constraint Query Languages. PODS 1990: 299-313 BibTeX
[22]
Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter: Indexing for Data Models with Constraints and Classes. PODS 1993: 233-243 BibTeX
[23]
Manolis Koubarakis: Representation and Querying in Temporal Databases: the Power of Temporal Constraints. ICDE 1993: 327-334 BibTeX
[24]
David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents BibTeX
[25]
Peter Z. Revesz: A Closed Form for Datalog Queries with Integer Order. ICDT 1990: 187-201 BibTeX
[26]
Daniel J. Rosenkrantz, Harry B. Hunt III: Processing Conjunctive Predicates and Queries. VLDB 1980: 64-72 BibTeX
[27]
...
[28]
...
[29]
...
[30]
Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
Contents BibTeX
[31]
Ron van der Meyden: The Complexity of Querying Indefinite Data about Linearly Ordered Domains. PODS 1992: 331-345 BibTeX
[32]
...
[33]
Xubo Zhang, Z. Meral Özsoyoglu: On Efficient Reasoning with Implication Constraints. DOOD 1993: 236-252 BibTeX

Referenced by

  1. Jef Wijsen: Temporal FDs on Complex Objects. ACM Trans. Database Syst. 24(1): 127-176(1999)
  2. Michael J. Maher, Divesh Srivastava: Chasing Constrained Tuple-Generating Dependencies. PODS 1996: 128-138
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
Lecture Notes in Computer Science: Copyright © by Springer
Digitization of EDBT/ICDT/MFDBS proceedings was supported by the EDBT Endowment.
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:19:08 2009