%0 Conference Paper %1 noKey %A Nieke, Christian %A Güntzer, Ulrich %A Balke, Wolf-Tilo %B Conceptual Modeling %D 2014 %E Yu, Eric %E Dobbie, Gillian %E Jarke, Matthias %E Purao, Sandeep %I Springer International Publishing %K myown %P 122-135 %R 10.1007/978-3-319-12206-9_10 %T TopCrowd %U http://dx.doi.org/10.1007/978-3-319-12206-9_10 %V 8824 %X Building databases and information systems over data extracted from heterogeneous sources like the Web poses a severe challenge: most data is incomplete and thus difficult to process in structured queries. This is especially true for sophisticated query techniques like Top-k querying where rankings are aggregated over several sources. The intelligent combination of efficient data processing algorithms with crowdsourced database operators promises to alleviate the situation. Yet the scalability of such combined processing is doubtful. We present TopCrowd, a novel crowd-enabled Top-k query processing algorithm that works effectively on incomplete data, while tightly controlling query processing costs in terms of response time and money spent for crowdsourcing. TopCrowd features probabilistic pruning rules for drastically reduced numbers of crowd accesses (up to 95%), while effectively balancing querying costs and result correctness. Extensive experiments show the benefit of our technique. %@ 978-3-319-12205-2

@inproceedings{noKey, abstract = {Building databases and information systems over data extracted from heterogeneous sources like the Web poses a severe challenge: most data is incomplete and thus difficult to process in structured queries. This is especially true for sophisticated query techniques like Top-k querying where rankings are aggregated over several sources. The intelligent combination of efficient data processing algorithms with crowdsourced database operators promises to alleviate the situation. Yet the scalability of such combined processing is doubtful. We present TopCrowd, a novel crowd-enabled Top-k query processing algorithm that works effectively on incomplete data, while tightly controlling query processing costs in terms of response time and money spent for crowdsourcing. TopCrowd features probabilistic pruning rules for drastically reduced numbers of crowd accesses (up to 95%), while effectively balancing querying costs and result correctness. Extensive experiments show the benefit of our technique.}, added-at = {2015-01-05T15:40:04.000+0100}, author = {Nieke, Christian and Güntzer, Ulrich and Balke, Wolf-Tilo}, biburl = {https://www.bibsonomy.org/bibtex/2725f7ef3e600d7baa455b001cac15902/balke}, booktitle = {Conceptual Modeling}, description = {TopCrowd - Springer}, doi = {10.1007/978-3-319-12206-9_10}, editor = {Yu, Eric and Dobbie, Gillian and Jarke, Matthias and Purao, Sandeep}, interhash = {0c3b9f1307fdd255224002997d88dced}, intrahash = {725f7ef3e600d7baa455b001cac15902}, isbn = {978-3-319-12205-2}, keywords = {myown}, language = {English}, pages = {122-135}, publisher = {Springer International Publishing}, series = {Lecture Notes in Computer Science}, timestamp = {2015-01-05T15:40:04.000+0100}, title = {TopCrowd}, url = {http://dx.doi.org/10.1007/978-3-319-12206-9_10}, volume = 8824, year = 2014 }