On the Complexity of Top-k Querying for Incomplete Data under Order ConstraintsMarkantoine amarilli[0]yael amsterdamer[0]tova milo[0]pierre senellart[0]2015.Cited by: 0|Bibtex|Views7|Code: Data: Full Text (Upload PDF)PPT (Upload PPT)SimilarReferenceUpload PPTYour rating :0 TagsCommentsSubmit
