Using Constraints for Efficient Query Processing in Nondeterministic Databases.

@article{DBLP:journals/tkde/VadapartyN95,
  author    = {Kumar V. Vadaparty and
               Shamim A. Naqvi},
  title     = {Using Constraints for Efficient Query Processing in Nondeterministic
               Databases},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {7},
  number    = {6},
  year      = {1995},
  pages     = {850-864},
  ee        = {db/journals/tkde/VadapartyN95.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1995 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Catriel Beeri, Moshe Y. Vardi: A Proof Procedure for Data Dependencies. J. ACM 31(4): 718-741(1984) BibTeX

[2]

Joachim Biskup: A Formal Approach to Null Values in Database Relations. Advances in Data Base Theory 1979: 299-341 BibTeX

[3]

E. F. Codd: Extending the Database Relational Model to Capture More Meaning. ACM Trans. Database Syst. 4(4): 397-434(1979) BibTeX

[4]

Mehmet Dincbas, Helmut Simonis, Pascal Van Hentenryck: Solving a Cutting-Stock Problem in Constraint Logic Programming. ICLP/SLP 1988: 42-58 BibTeX

[5]

Mehmet Dincbas, Helmut Simonis, Pascal Van Hentenryck: Solving the Car-Sequencing Problem in Constraint Logic Programming. ECAI 1988: 290-295 BibTeX

[6]

David P. Dobkin, Richard J. Lipton: On the Complexity of Computations under Varying Sets of Primitives. J. Comput. Syst. Sci. 18(1): 86-91(1979) BibTeX

[7]

Shimon Even, Alon Itai, Adi Shamir: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5(4): 691-703(1976) BibTeX

[8]

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

[9]

John Grant: Null Values in a Relational Data Base. Inf. Process. Lett. 6(5): 156-157(1977) BibTeX

[10]

Tomasz Imielinski: Abstraction in Query Processing. J. ACM 38(3): 534-558(1991) BibTeX

[11]

Tomasz Imielinski: Incomplete Deductive Databases. Ann. Math. Artif. Intell. 3(2-4): 259-293(1991) BibTeX

[12]

Tomasz Imielinski, Witold Lipski Jr.: Incomplete Information in Relational Databases. J. ACM 31(4): 761-791(1984) BibTeX

[13]

Tomasz Imielinski, Ron van der Meyden, Kumar V. Vadaparty: Complexity Tailored Design: A New Design Methodology for Databases With Incomplete Information. J. Comput. Syst. Sci. 51(3): 405-432(1995) BibTeX

[14]

Tomasz Imielinski, Shamim A. Naqvi, Kumar V. Vadaparty: Incomplete Objects - A Data Model for Design and Planning Applications. SIGMOD Conference 1991: 288-297 BibTeX

[15]

Tomasz Imielinski, Shamim A. Naqvi, Kumar V. Vadaparty: Querying Design and Planning Databases. DOOD 1991: 524-545 BibTeX

[16]

Tomasz Imielinski, Kumar V. Vadaparty: Complexity of Query Processing in Databases with OR-Objects. PODS 1989: 51-65 BibTeX

[17]

Leonid Libkin, Limsoon Wong: Semantic Representations and Query Languages for Or-sets. PODS 1993: 37-48 BibTeX

[18]

Witold Lipski Jr.: On Semantic Issues Connected with Incomplete Information Databases. ACM Trans. Database Syst. 4(3): 262-296(1979) BibTeX

[19]

Witold Lipski Jr.: On Databases with Incomplete Information. J. ACM 28(1): 41-70(1981) BibTeX

[20]

...

[21]

...

[22]

David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents BibTeX

[23]

Jack Minker, Arcot Rajasekar: A Fixpoint Semantics for Disjunctive Logic Programs. J. Log. Program. 9(1): 45-74(1990) BibTeX

[24]

Adegbeniga Ola, Gultekin Özsoyoglu: Incomplete Relational Database Models Based on Intervals. IEEE Trans. Knowl. Data Eng. 5(2): 293-308(1993) BibTeX

[25]

Franco P. Preparata, Michael Ian Shamos: Computational Geometry - An Introduction. Springer 1985, ISBN 3-540-96131-3
BibTeX

[26]

Edward M. Reingold: On the Optimality of Some Set Algorithms. J. ACM 19(4): 649-659(1972) BibTeX

[27]

Raymond Reiter: Towards a Logical Reconstruction of Relational Database Theory. On Conceptual Modelling (Intervale) 1982: 191-233 BibTeX

[28]

Raymond Reiter: A sound and sometimes complete query evaluation algorithm for relational databases with null values. J. ACM 33(2): 349-370(1986) BibTeX

[29]

...

[30]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press 1988, ISBN 0-7167-8158-1
Contents BibTeX

[31]

...

[32]

Moshe Y. Vardi: Querying Logical Databases. J. Comput. Syst. Sci. 33(2): 142-160(1986) BibTeX

[33]

Yannis Vassiliou: Null Values in Data Base Management: A Denotational Semantics Approach. SIGMOD Conference 1979: 162-169 BibTeX

[34]

...

[35]

Li-Yan Yuan, Ding-An Chiang: A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information. PODS 1989: 66-74 BibTeX

Referenced by

1. Wilfred Ng: Extending Functional Dependencies in Indefinite Sequence Relations. ER 1999: 399-412
2. Leonid Libkin: Query Language Primitives for Programming with Incomplete Databases. DBPL 1995: 6