Definitions
Visual querying of graphs: Formulation of a graph query by drawing it using a visual query interface.
Overview
Querying graphs has emerged as an important research problem due to the prevalence of graph-structured data in many real-world applications (e.g., social networks, road networks, collaboration networks, cheminformatics, bioinformatics, computer vision). At the core of many of these applications lies a common and important query primitive called subgraph search, which retrieves one or more matching subgraphs or data graphs containing exact (Han et al. 2013; Yan et al. 2004) or approximate (Yan et al. 2005; Tian and Patel 2008) match of a user-specified query graph (aka subgraph query). Since the last decade, a number of graph query languages (e.g., sparql, Cypher) have been proposed to facilitate textual formulation of subgraph queries. All these languages assume that a user has programming and debugging expertise to formulate queries correctly in these languages....
This is a preview of subscription content, log in via an institution to check access.
Notes
- 1.
- 2.
- 3.
From an end user’s perspective, the srt is crucial as it is the time a user has to wait before she can view the results.
References
Bhowmick SS (2014) DB ⋈ HCI: towards bridging the chasm between graph data management and HCI. In: Proceedings of the 25th international conference on database and expert systems applications (DEXA), Part I, Munich, 1–4 Sept 2014, pp 1–11
Bhowmick SS, Dyreson CE, Choi B, Ang M (2015) Interruption-sensitive empty result feedback: rethinking the visual query feedback paradigm for semistructured data. In: Proceedings of the 24th ACM international conference on information and knowledge management (CIKM), Melbourne, 19–23 Oct 2015, pp 723–732
Bhowmick SS, Choi B, Dyreson CE (2016) Data-driven visual graph query interface construction and maintenance: challenges and opportunities. PVLDB 9(12):984–992
Bhowmick SS, Choi B, Li C (2017a) Graph querying meets HCI: state of the art and future directions. In: Proceedings of the 2017 ACM international conference on management of data, SIGMOD conference 2017, Chicago, 14–19 May 2017, pp 1731–1736
Bhowmick SS, Chua H, Choi B, Dyreson CE (2017b) VISUAL: simulation of visual subgraph query formulation to enable automated performance benchmarking. IEEE Trans Knowl Data Eng 29(8):1765–1778
Fan W, Li J, Ma S, Wang H, Wu Y (2010) Graph homomorphism revisited for graph matching. PVLDB 3(1):1161–1172
Han W, Lee J, Lee J (2013) Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD), New York, 22–27 June 2013, pp 337–348
Huang K, Bhowmick SS, Zhou S, Choi B (2017) PICASSO: exploratory search of connected subgraph substructures in graph databases. PVLDB 10(12):1861–1864
Hung HH, Bhowmick SS, Truong BQ, Choi B, Zhou S (2014) QUBLE: towards blending interactive visual subgraph search queries on large networks. VLDB J 23(3):401–426
Jin C, Bhowmick SS, Xiao X, Cheng J, Choi B (2010) GBLENDER: towards blending visual query formulation and query processing in graph databases. In: Proceedings of the ACM SIGMOD international conference on management of data, (SIGMOD), Indianapolis, 6–10 June 2010, pp 111–122
Jin C, Bhowmick SS, Choi B, Zhou S (2012) PRAGUE: towards blending practical visual subgraph query formulation and query processing. In: IEEE 28th international conference on data engineering (ICDE), Washington, DC, 1–5 Apr 2012, pp 222–233
Katsarou F, Ntarmos N, Triantafillou P (2015) Performance and scalability of indexed subgraph query processing methods. PVLDB 8(12):1566–1577
Pienta R, Tamersoy A, Endert A, Navathe SB, Tong H, Chau DH (2016) VISAGE: interactive visual graph querying. In: Proceedings of the international working conference on advanced visual interfaces (AVI), Bari, 7–10 June 2016, pp 272–279
Pienta R, Hohman F, Endert A, Tamersoy A, Roundy K, Gates C, Navathe SB, Chau DH (2018) VIGOR: interactive visual exploration of graph query results. IEEE Trans Vis Comput Graph 24:215–225
Tian Y, Patel JM (2008) TALE: a tool for approximate large graph matching. In: Proceedings of the 24th international conference on data engineering (ICDE), Cancún, 7–12 Apr 2008, pp 963–972
Yan X, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: Proceedings of the ACM SIGMOD international conference on management of data, Paris, 13–18 June 2004, pp 335–346
Yan X, Yu PS, Han J (2005) Substructure similarity search in graph databases. In: Proceedings of the ACM SIGMOD international conference on management of data, Baltimore, 14–16 June 2005, pp 766–777
Yi P, Choi B, Bhowmick SS, Xu J (2017) Autog: a visual query autocompletion framework for graph databases. VLDB J 26(3):347–372
Zhang J, Bhowmick SS, Nguyen HH, Choi B, Zhu F (2015) Davinci: data-driven visual interface construction for subgraph search in graph databases. In: 31st IEEE international conference on data engineering (ICDE), Seoul, 13–17 Apr 2015, pp 1500–1503
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this entry
Cite this entry
Bhowmick, S.S., Choi, B. (2018). Visual Graph Querying. In: Sakr, S., Zomaya, A. (eds) Encyclopedia of Big Data Technologies. Springer, Cham. https://doi.org/10.1007/978-3-319-63962-8_78-1
Download citation
DOI: https://doi.org/10.1007/978-3-319-63962-8_78-1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63962-8
Online ISBN: 978-3-319-63962-8
eBook Packages: Springer Reference MathematicsReference Module Computer Science and Engineering