A Toolkit for Managing Multiple Crowdsourced Top-K Queries

被引:0
|
作者
Shan, Caihua [1 ]
Hou, Leong U. [2 ]
Mamoulis, Nikos [3 ]
Cheng, Reynold [1 ]
机构
[1] Univ Hong Kong, Hong Kong, Peoples R China
[2] Univ Macau, Zhuhai, Peoples R China
[3] Univ Ioannina, Ioannina, Greece
关键词
Crowdsourcing; top-k query; query management;
D O I
10.1145/3340531.3417415
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Crowdsourced ranking and top-k queries have attracted significant attention recently. Their goal is to combine human cognitive abilities and machine intelligence to rank computer hostile but human friendly items. Many task assignment algorithms and inference approaches have been proposed to publish suitable micro-tasks to the crowd, obtain informative answers, and aggregate the rank from noisy human answers. However, they are all focused on single query processing. To the best of our knowledge, no prior work helps users manage multiple crowdsourced top-k queries. We propose a toolkit, which seamlessly works with most existing inference and task assignment methods, for crowdsourced top-k query management. Our toolkit attempts to optimize human resource allocation and continuously monitors query quality at any stage of the crowdsourcing process. A user can terminate a query early, if the estimated quality already fulfills her requirements. Besides, the toolkit provides user-friendly interfaces for users to initialize queries, monitor execution status, and do more operations by hand.
引用
收藏
页码:3453 / 3456
页数:4
相关论文
共 50 条
  • [1] Crowdsourced Top-k Queries by Confidence-Aware Pairwise Judgments
    Kou, Ngai Meng
    Li, Yan
    Wang, Hao
    Hou, Leong U.
    Gong, Zhiguo
    [J]. SIGMOD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2017, : 1415 - 1430
  • [2] Crowdsourced top-k queries by pairwise preference judgments with confidence and budget control
    Yan Li
    Hao Wang
    Ngai Meng Kou
    Leong Hou U
    Zhiguo Gong
    [J]. The VLDB Journal, 2021, 30 : 189 - 213
  • [3] Crowdsourced top-k queries by pairwise preference judgments with confidence and budget control
    Li, Yan
    Wang, Hao
    Kou, Ngai Meng
    Hou, Leong U.
    Gong, Zhiguo
    [J]. VLDB JOURNAL, 2021, 30 (02): : 189 - 213
  • [4] Reverse Top-k Queries
    Vlachou, Akrivi
    Doulkeridis, Christos
    Kotidis, Yannis
    Norvag, Kjetil
    [J]. 26TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING ICDE 2010, 2010, : 365 - 376
  • [5] Processing Top-k Join Queries
    Wu, Minji
    Berti-Equille, Laure
    Marian, Amelie
    Procopiuc, Cecilia M.
    Srivastava, Divesh
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2010, 3 (01): : 860 - 870
  • [6] Top-k Combinatorial Skyline Queries
    Su, I-Fang
    Chung, Yu-Chi
    Lee, Chiang
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PT II, PROCEEDINGS, 2010, 5982 : 79 - +
  • [7] Evaluating top-k selection queries
    Chaudhuri, S
    Gravano, L
    [J]. PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, 1999, : 399 - 410
  • [8] Approximate distributed top-k queries
    Boaz Patt-Shamir
    Allon Shafrir
    [J]. Distributed Computing, 2008, 21 : 1 - 22
  • [9] Top-k spatial preference queries
    Yiu, Man Lung
    Dai, Xiangyuan
    Mamoulis, Nikos
    Vaitis, Michail
    [J]. 2007 IEEE 23RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2007, : 1051 - +
  • [10] Optimizing Distributed Top-k Queries
    Neumann, Thomas
    Bender, Matthias
    Michel, Sebastian
    Schenkel, Ralf
    Triantafillou, Peter
    Weikum, Gerhard
    [J]. WEB INFORMATION SYSTEMS ENGINEERING - WISE 2008, PROCEEDINGS, 2008, 5175 : 337 - +