Computing full disjunctions

Yaron Kanza, Yehoshua Sagiv. Computing full disjunctions. In Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA. pages 78-89, ACM, 2003. [doi]

@inproceedings{KanzaS03,
  title = {Computing full disjunctions},
  author = {Yaron Kanza and Yehoshua Sagiv},
  year = {2003},
  doi = {10.1145/773153.773162},
  url = {http://doi.acm.org/10.1145/773153.773162},
  researchr = {https://researchr.org/publication/KanzaS03},
  cites = {0},
  citedby = {0},
  pages = {78-89},
  booktitle = {Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA},
  publisher = {ACM},
  isbn = {1-58113-670-6},
}