research-article

Interactive Graph Search

Authors:

Guoliang LiAuthors Info & Claims

SIGMOD '19: Proceedings of the 2019 International Conference on Management of Data

Pages 1393 - 1410

https://doi.org/10.1145/3299869.3319885

Published: 25 June 2019 Publication History

Abstract

We study \em interactive graph search (IGS), with the conceptual objective of departing from the conventional "top-down" strategy in searching a poly-hierarchy, a.k.a.\ a decision graph. In IGS, a machine assists a human in looking for a target node z in an acyclic directed graph G, by repetitively asking questions. In each \em question, the machine picks a node u in G, asks a human "is there a path from u to $z?"', and takes a boolean answer from the human. The efficiency goal is to locate z with as few questions as possible. We describe algorithms that solve the problem by asking a provably small number of questions, and establish lower bounds indicating that the algorithms are optimal up to a small additive factor. An experimental evaluation is presented to demonstrate the usefulness of our solutions in real-world scenarios.

References

[1]

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms, Second Edition .The MIT Press.

[2]

Susan B. Davidson, Sanjeev Khanna, Tova Milo, and Sudeepa Roy. 2013. Using the crowd for top-k and group-by queries. In ICDT. 225--236.

[3]

Eyal Dushkin and Tova Milo. 2018. Top-k Sorting Under Partial Order Information. In SIGMOD. 1007--1019.

Digital Library

[4]

Ju Fan, Guoliang Li, Beng Chin Ooi, Kian-Lee Tan, and Jianhua Feng. 2015. iCrowd: An Adaptive Crowdsourcing Framework. In SIGMOD. 1015--1030.

Digital Library

[5]

Michael J. Franklin, Donald Kossmann, Tim Kraska, Sukriti Ramesh, and Reynold Xin. 2011. CrowdDB: answering queries with crowdsourcing. In SIGMOD. 61--72.

Digital Library

[6]

Stephen Guo, Aditya G. Parameswaran, and Hector Garcia-Molina. 2012. So who won?: dynamic max discovery with the crowd. In SIGMOD. 385--396.

Digital Library

[7]

Ruining He and Julian McAuley. 2016. Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filtering. In WWW. 507--517.

Digital Library

[8]

Chien-Ju Ho, Shahin Jabbari, and Jennifer Wortman Vaughan. 2013. Adaptive Task Assignment for Crowdsourced Classification. In ICML. 534--542.

Digital Library

[9]

Guoliang Li, Chengliang Chai, Ju Fan, Xueping Weng, Jian Li, Yudian Zheng, Yuanbing Li, Xiang Yu, Xiaohang Zhang, and Haitao Yuan. 2017. CDB: Optimizing Queries with Crowd-Based Selections and Joins. In SIGMOD. 1463--1478.

Digital Library

[10]

Xuan Liu, Meiyu Lu, Beng Chin Ooi, Yanyan Shen, Sai Wu, and Meihui Zhang. 2012. CDAS: A Crowdsourcing Data Analytics System. PVLDB, Vol. 5, 10 (2012), 1040--1051.

Digital Library

[11]

Adam Marcus, David R. Karger, Samuel Madden, Rob Miller, and Sewoong Oh. 2012. Counting with the Crowd. PVLDB, Vol. 6, 2 (2012), 109--120.

Digital Library

[12]

Adam Marcus, Eugene Wu, Samuel Madden, and Robert C. Miller. 2011. Crowdsourced Databases: Query Processing with People. In CIDR. 211--214.

[13]

Jonathan J Oliver. 1993. Decision Graphs - An Extension of Decision Trees. In Int. Conf. Artificial Intelligence and Statistics. 343--350.

[14]

Aditya G. Parameswaran, Hector Garcia-Molina, Hyunjung Park, Neoklis Polyzotis, Aditya Ramesh, and Jennifer Widom. 2012. CrowdScreen: algorithms for filtering data with humans. In SIGMOD. 361--372.

[15]

Aditya G. Parameswaran, Anish Das Sarma, Hector Garcia-Molina, Neoklis Polyzotis, and Jennifer Widom. 2011. Human-assisted graph search: it's okay to ask questions. PVLDB, Vol. 4, 5 (2011), 267--278.

Digital Library

[16]

Hyunjung Park, Richard Pang, Aditya G. Parameswaran, Hector Garcia-Molina, Neoklis Polyzotis, and Jennifer Widom. 2012. Deco: A System for Declarative Crowdsourcing. PVLDB, Vol. 5, 12 (2012), 1990--1993.

Digital Library

[17]

Senjuti Basu Roy, Haidong Wang, Gautam Das, Ullas Nambiar, and Mukesh K. Mohania. 2008. Minimum-effort driven dynamic faceted search in structured databases. In CIKM. 13--22.

Digital Library

[18]

Daniel Dominic Sleator and Robert Endre Tarjan. 1983. A Data Structure for Dynamic Trees. JCSS, Vol. 26, 3 (1983), 362--391.

Digital Library

[19]

Vasilis Verroios, Hector Garcia-Molina, and Yannis Papakonstantinou. 2017. Waldo: An Adaptive Human Interface for Crowd Entity Resolution. In SIGMOD. 1133--1148.

Digital Library

[20]

Ka-Ping Yee, Kirsten Swearingen, Kevin Li, and Marti A. Hearst. 2003. Faceted metadata for image search and browsing. In CHI. 401--408.

Digital Library

Cited By

Zhao ZGan JQi JBao Z(2024)Efficient Example-Guided Interactive Graph Search2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00033(342-354)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00033
Shangqi LMartens WNiewerth MTao Y(2023)Partial Order Multiway SearchACM Transactions on Database Systems10.1145/362695648:4(1-31)Online publication date: 9-Oct-2023
https://dl.acm.org/doi/10.1145/3626956
Lu SMartens WNiewerth MTao Y(2023)An Optimal Algorithm for Partial Order Multiway SearchACM SIGMOD Record10.1145/3604437.360445652:1(84-92)Online publication date: 7-Jun-2023
https://dl.acm.org/doi/10.1145/3604437.3604456
Show More Cited By

Index Terms

Interactive Graph Search
1. Information systems
  1. Information retrieval
    1. Users and interactive retrieval
      1. Collaborative search

Recommendations

Noisy Interactive Graph Search
KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining

The interactive graph search (IGS) problem aims to locate an initially unknown target node leveraging human intelligence. In IGS, we can gradually find the target node by sequentially asking humans some reachability queries like "is the target node ...
Beyond the Vizing's Bound for at Most Seven Colors

Let $G=(V,E)$ be a simple graph of maximum degree $\Delta$. The edges of $G$ can be colored with at most $\Delta +1$ colors by Vizing's theorem. We study lower bounds on the size of subgraphs of $G$ that can be colored with $\Delta$ colors. Vizing's ...
On the maximum cardinality search lower bound for treewidth

The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '19: Proceedings of the 2019 International Conference on Management of Data

June 2019

2106 pages

ISBN:9781450356435

DOI:10.1145/3299869

General Chairs:
Peter Boncz
CWI & Vrije Universiteit Amsterdam, The Netherlands
,
Stefan Manegold
CWI & Universiteit Leiden, The Netherlands
,
Program Chairs:
Anastasia Ailamaki
EPFL, Switzerland
,
Amol Deshpande
University of Maryland, USA
,
Tim Kraska
MIT, USA

Copyright © 2019 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 June 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Google
National Basic Research Program of China (973 Program)

Conference

SIGMOD/PODS '19

Sponsor:

SIGMOD

SIGMOD/PODS '19: International Conference on Management of Data

June 30 - July 5, 2019

Amsterdam, Netherlands

Acceptance Rates

SIGMOD '19 Paper Acceptance Rate 88 of 430 submissions, 20%;

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
691
Total Downloads

Downloads (Last 12 months)34
Downloads (Last 6 weeks)3

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhao ZGan JQi JBao Z(2024)Efficient Example-Guided Interactive Graph Search2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00033(342-354)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00033
Shangqi LMartens WNiewerth MTao Y(2023)Partial Order Multiway SearchACM Transactions on Database Systems10.1145/362695648:4(1-31)Online publication date: 9-Oct-2023
https://dl.acm.org/doi/10.1145/3626956
Lu SMartens WNiewerth MTao Y(2023)An Optimal Algorithm for Partial Order Multiway SearchACM SIGMOD Record10.1145/3604437.360445652:1(84-92)Online publication date: 7-Jun-2023
https://dl.acm.org/doi/10.1145/3604437.3604456
Jayaram R(2023)Technical Perspective: Optimal Algorithms for Multiway Search on Partial OrdersACM SIGMOD Record10.1145/3604437.360445552:1(83-83)Online publication date: 7-Jun-2023
https://dl.acm.org/doi/10.1145/3604437.3604455
Cong QTang JHan KHuang YChen LChee YZhang ARangwala H(2022)Noisy Interactive Graph SearchProceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3534678.3539267(231-240)Online publication date: 14-Aug-2022
https://dl.acm.org/doi/10.1145/3534678.3539267
Lu SMartens WNiewerth MTao YLibkin LBarceló P(2022)Optimal Algorithms for Multiway Search on Partial OrdersProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3517804.3524150(175-187)Online publication date: 12-Jun-2022
https://dl.acm.org/doi/10.1145/3517804.3524150
Cong QTang JHuang YChen LChee Y(2022)Cost-Effective Algorithms for Average-Case Interactive Graph Search2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00091(1152-1165)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00091
Zhu XHuang XChoi BJiang JZou ZXu J(2021)Budget constrained interactive search for multiple targetsProceedings of the VLDB Endowment10.14778/3447689.344769414:6(890-902)Online publication date: 12-Apr-2021
https://dl.acm.org/doi/10.14778/3447689.3447694
Zhu XHuang XChoi BXu JCheung WZhang YLiu J(2021)Efficient and Optimal Algorithms for Tree Summarization with Weighted TerminologiesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2021.3120722(1-1)Online publication date: 2021
https://doi.org/10.1109/TKDE.2021.3120722
Yang JZhao XFan JChen GPeng CYao SDu X(2021)A Human-in-the-loop Approach to Social Behavioral Targeting2021 IEEE 37th International Conference on Data Engineering (ICDE)10.1109/ICDE51399.2021.00031(277-288)Online publication date: Apr-2021
https://doi.org/10.1109/ICDE51399.2021.00031
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten