Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: An incremental algorithm for computing ranked full disjunctionsSara Cohen, Yehoshua Sagiv. jcss, 73(4):648-668, 2007. [doi] An incremental algorithm for computing ranked full disjunctionsSara Cohen, Yehoshua Sagiv. PODS 2005: 98-107 [doi] Full Disjunctions: Polynomial-Delay Iterators in ActionSara Cohen, Itzhak Fadida, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv. VLDB 2006: 739-750 [doi]
The following publications are possibly variants of this publication: