Sara Cohen, Yehoshua Sagiv. An incremental algorithm for computing ranked full disjunctions. In Chen Li, editor, Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 13-15, 2005, Baltimore, Maryland, USA. pages 98-107, ACM, 2005. [doi]
@inproceedings{CohenS05,
title = {An incremental algorithm for computing ranked full disjunctions},
author = {Sara Cohen and Yehoshua Sagiv},
year = {2005},
doi = {10.1145/1065167.1065180},
url = {http://doi.acm.org/10.1145/1065167.1065180},
tags = {incremental},
researchr = {https://researchr.org/publication/CohenS05},
cites = {0},
citedby = {0},
pages = {98-107},
booktitle = {Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 13-15, 2005, Baltimore, Maryland, USA},
editor = {Chen Li},
publisher = {ACM},
isbn = {1-59593-062-0},
}