Skip to main content

Answering the Why-Not Questions of Graph Query Autocompletion

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10827))

Included in the following conference series:

  • 3366 Accesses

Abstract

Graph query autocompletion (gQAC) helps users formulate graph queries in a visual environment (a.k.a GUI). It takes a graph query that the user is formulating as input and generates a ranked list of query suggestions. Since it is impossible to accurately predict the user’s target query, the current state-of-the-art of gQAC sometimes fails to produce useful suggestions. In such scenarios, it is natural for the user to ask why are useful suggestions not returned. In this paper, we address the why-not questions of gQAC. Specifically, given an intermediate query q, a target query \(q_t\), and a gQAC system X, the why-not questions of gQAC seek for the minimal refinement of the configuration of X, with respect to a penalty model, such that at least one useful suggestion towards \(q_t\) appears in the returned suggestions. We propose a generic ranking function for existing gQAC systems. We propose a search algorithm for the why-not questions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Chapman, A., Jagadish, H.V.: Why not? In: SIGMOD, pp. 523–534 (2009)

    Google Scholar 

  2. Islam, M.S., Liu, C., Li, J.: Efficient answering of why-not questions in similar graph matching. TKDE 27, 2672–2686 (2015)

    Google Scholar 

  3. Jayaram, N., Goyal, S., Li, C.: VIIQ: auto-suggestion enabled visual interface for interactive graph query formulation. PVLDB 8, 1940–1951 (2015)

    Google Scholar 

  4. Li, G., Ng, N., Yi, P., Zhang, Z., Choi, B.: Answering the why-not questions of graph query autocompletion (2018). https://goo.gl/4Hpt5m

  5. Mottin, D., Bonchi, F., Gullo, F.: Graph query reformulation with diversity. In: KDD, pp. 825–834 (2015)

    Google Scholar 

  6. Nandi, A., Jagadish, H.V.: Effective phrase prediction. In: PVLDB, pp. 219–230 (2007)

    Google Scholar 

  7. NLM: PubChem. ftp://ftp.ncbi.nlm.nih.gov/pubchem/

  8. Pienta, R., Hohman, F., Tamersoy, A., Endert, A., Navathe, S., Tong, H., Chau, D.H.: Visual graph query construction and refinement. In: SIGMOD, pp. 1587–1590 (2017)

    Google Scholar 

  9. Yi, P., Choi, B., Bhowmick, S., Xu, J.: AutoG: a visual query autocompletion framework for graph databases. VLDB J. 26, 347–372 (2017)

    Article  Google Scholar 

  10. Yi, P., Choi, B., Zhang, Z., Bhowmick, S.S., Xu, J.: Gfocus: user focus-based graph query autocompletion (2018). https://goo.gl/MYYw94

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guozhong Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, G., Ng, N., Yi, P., Zhang, Z., Choi, B. (2018). Answering the Why-Not Questions of Graph Query Autocompletion. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds) Database Systems for Advanced Applications. DASFAA 2018. Lecture Notes in Computer Science(), vol 10827. Springer, Cham. https://doi.org/10.1007/978-3-319-91452-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-91452-7_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-91451-0

  • Online ISBN: 978-3-319-91452-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics