On the Complexity of Evaluating Order Queries with the Crowd.

摘要: One of the foremost challenges for information technology over last few years has been to explore, understand, and extract useful from large amounts data. Some particular tasks such as annotating data or matching entities have outsourced human workers many years. But seen rise a new research field called crowdsourcing that aims at delegating wide range workers, building formal frameworks, improving efficiency these processes. The database community thus suggesting algorithms process traditional manipulation operators with crowd, joins filtering. This is even more when comparing underlying “tuples” subjective decision – e.g., they are photos, text, simply noisy different variations interpretations can presumably be done better faster by humans than machines. problems considered in this article aim retrieve subset preferred items set pairwise comparison operations crowd. most obvious example finding maximum (called max). We also consider two natural generalizations max problem: