{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T02:40:16Z","timestamp":1768444816276,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T00:00:00Z","timestamp":1580342400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T00:00:00Z","timestamp":1580342400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00778-020-00601-0","type":"journal-article","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T13:03:11Z","timestamp":1580389391000},"page":"973-998","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["FERRARI: an efficient framework for visual exploratory subgraph search in graph databases"],"prefix":"10.1007","volume":"29","author":[{"given":"Chaohui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miao","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sourav S.","family":"Bhowmick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byron","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,30]]},"reference":[{"issue":"5","key":"601_CR1","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1016\/j.ipm.2013.01.007","volume":"49","author":"J Ahn","year":"2013","unstructured":"Ahn, J., Brusilovsky, P.: Adaptive visualization for exploratory information retrieval. Inf. Process. Manag. 49(5), 1139\u20131164 (2013)","journal-title":"Inf. Process. Manag."},{"issue":"8","key":"601_CR2","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1109\/TKDE.2017.2690392","volume":"29","author":"SS Bhowmick","year":"2017","unstructured":"Bhowmick, S.S., Chua, H.-E., Choi, B., Dyreson, C.: ViSual: simulation of visual subgraph query formulation to enable automated performance benchmarking. IEEE Trans. Knowl. Data Eng. 29(8), 1765\u20131778 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"601_CR3","first-page":"149","volume":"11","author":"A Bonifati","year":"2017","unstructured":"Bonifati, A., Martens, W., Timm, T.: An analytical study of large SPARQL query logs. PVLDB 11(2), 149\u2013161 (2017)","journal-title":"PVLDB"},{"key":"601_CR4","doi-asserted-by":"crossref","unstructured":"Bonnici, V., Ferro, A., et\u00a0al.: Enhancing graph database indexing by suffix tree structure. In: Pattern Recognition in Bioinformatics (2010)","DOI":"10.1007\/978-3-642-16001-1_17"},{"issue":"10","key":"601_CR5","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L Cordella","year":"2004","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. PAMI 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. PAMI"},{"key":"601_CR6","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Eppstein, D., Galil, Z., Italiano. G.F.: Dynamic graph algorithms. In: Algorithms and Theory of Computation Handbook. CRC Press, Boca Raton (2010)","DOI":"10.1201\/9781584888239-c9"},{"issue":"1","key":"601_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1186\/1471-2105-11-96","volume":"11","author":"R Di Natale","year":"2010","unstructured":"Di Natale, R., Ferro, A., et al.: Sing: subgraph search in non-homogeneous graphs. BMC Bioinform. 11(1), 96 (2010)","journal-title":"BMC Bioinform."},{"issue":"7","key":"601_CR8","doi-asserted-by":"publisher","first-page":"517","DOI":"10.14778\/2732286.2732289","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy, M., Abdelhamid, E., et al.: GRAMI: frequent subgraph and pattern mining in a single large graph. Proc. VLDB Endow. 7(7), 517\u2013528 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"601_CR9","doi-asserted-by":"crossref","unstructured":"Fan, W., Hu, C., Tian, C.: Incremental graph computations: doable and undoable. In SIGMOD (2017)","DOI":"10.1145\/3035918.3035944"},{"issue":"3","key":"601_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2489791","volume":"38","author":"W Fan","year":"2013","unstructured":"Fan, W., Wang, X., Wu, Y.: Incremental graph pattern matching. ACM Trans. Database Syst. 38(3), 1\u201347 (2013)","journal-title":"ACM Trans. Database Syst."},{"issue":"10","key":"601_CR11","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.14778\/3115404.3115418","volume":"10","author":"A Galakatos","year":"2017","unstructured":"Galakatos, A., Crotty, A., et al.: Revisiting reuse for approximate query processing. Proc. VLDB Endow. 10(10), 1142\u20131153 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"601_CR12","unstructured":"Huan, J.P., Wang, W., Prins, J.: Efficient mining of frequent subgraph in the presence of isomorphism. In ICDM (2003)"},{"issue":"12","key":"601_CR13","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.14778\/3137765.3137794","volume":"10","author":"K Huang","year":"2017","unstructured":"Huang, K., Bhowmick, S.S., Zhou, S., Choi, B.: PICASSO: exploratory search of connected subgraph substructures in graph databases. Proc. VLDB Endow. 10(12), 1861\u20131864 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"601_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00778-013-0322-1","volume":"23","author":"HH Hung","year":"2014","unstructured":"Hung, H.H., Bhowmick, S.S., Truong, B.Q., Choi, B., Zhou, S.: QUBLE: towards blending interactive visual subgraph search queries on large networks. VLDB J. 23(3), 401\u2013426 (2014)","journal-title":"VLDB J."},{"key":"601_CR15","doi-asserted-by":"crossref","unstructured":"Idreos, S., Papaemmanouil, O., Chaudhuri, S.: Overview of data exploration techniques. In SIGMOD (2015)","DOI":"10.1145\/2723372.2731084"},{"issue":"12","key":"601_CR16","doi-asserted-by":"publisher","first-page":"1940","DOI":"10.14778\/2824032.2824106","volume":"8","author":"N Jayaram","year":"2015","unstructured":"Jayaram, N., Goyal, S., Li, C.: VIIQ: auto-suggestion enabled visual interface for interactive graph query formulation. Proc. VLDB Endow. 8(12), 1940\u20131943 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"13","key":"601_CR17","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.14778\/2733004.2733064","volume":"7","author":"P Jayachandran","year":"2014","unstructured":"Jayachandran, P., Tunga, K., Kamat, N., Nandi, A.: Combining user interaction, speculative query execution and sampling in the DICE system. Proc. VLDB Endow. 7(13), 1697\u20131700 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"601_CR18","doi-asserted-by":"crossref","unstructured":"Jin, C., Bhowmick, S.S., Choi, B., Zhou, S.: PRAGUE: a practical framework for blending visual subgraph query formulation and query processing. In ICDE (2012)","DOI":"10.1109\/ICDE.2012.49"},{"key":"601_CR19","doi-asserted-by":"crossref","unstructured":"Jin, C., Bhowmick, S.S., Xiao, X., Cheng, J., Choi, B.; Gblender: towards blending visual query formulation and query processing in graph databases. In ACM SIGMOD (2010)","DOI":"10.1145\/1807167.1807182"},{"issue":"12","key":"601_CR20","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.14778\/2824032.2824054","volume":"8","author":"F Katsarou","year":"2015","unstructured":"Katsarou, F., Ntarmos, N., Triantafillou, P.: Performance and scalability of indexed subgraph query processing methods. Proc. VLDB Endow. 8(12), 1566\u20131577 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"601_CR21","volume-title":"PubChem Substance and Compound Databases. Nucleic Acids Research, 44(D1)","author":"S Kim","year":"2015","unstructured":"Kim, S., et al.: PubChem Substance and Compound Databases. Nucleic Acids Research, 44(D1). Oxford University Press, Oxford (2015)"},{"key":"601_CR22","unstructured":"Koutrika, G., et\u00a0al.: Exploratory search in databases and the web. In EDBT Workshop (2014)"},{"issue":"3","key":"601_CR23","doi-asserted-by":"publisher","first-page":"379","DOI":"10.3758\/BF03195514","volume":"35","author":"L Laura Faulkner","year":"2003","unstructured":"Laura Faulkner, L.: Beyond the five-user assumption: benefits of increased sample sizes in usability testing. Behav. Res. Methods Instrum. Comput. 35(3), 379\u2013383 (2003)","journal-title":"Behav. Res. Methods Instrum. Comput."},{"key":"601_CR24","volume-title":"Research Methods in Human\u2013Computer Interaction","author":"J Lazar","year":"2010","unstructured":"Lazar, J., Feng, J.H., Hochheiser, H.: Research Methods in Human\u2013Computer Interaction. Wiley, Hoboken (2010)"},{"issue":"4","key":"601_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1121949.1121979","volume":"49","author":"G Marchionini","year":"2006","unstructured":"Marchionini, G.: Exploratory search: from finding to understanding. Commun. ACM 49(4), 41\u201346 (2006)","journal-title":"Commun. ACM"},{"key":"601_CR26","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"key":"601_CR27","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1142\/S021972001000477X","volume":"80","author":"M Mongiova","year":"2010","unstructured":"Mongiova, M., Natale, R.D., Giugno, R., Pulvirenti, A., Ferro, A.: Sigma: a set-cover-based inexact graph matching algorithm. J. Bioinform. Comput. Biol. 80, 199\u2013218 (2010)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"601_CR28","doi-asserted-by":"crossref","unstructured":"Namaki, M.H., Wu, Y., Zhang, X.: GExp: cost-aware graph exploration with keywords. In SIGMOD (2018)","DOI":"10.1145\/3183713.3193550"},{"key":"601_CR29","doi-asserted-by":"crossref","unstructured":"Pienta, R., Hohman, F., et\u00a0al.: Visual graph query construction and refinement. In SIGMOD (2017)","DOI":"10.1145\/3035918.3056418"},{"key":"601_CR30","doi-asserted-by":"crossref","unstructured":"Sarrafzadeh, B., Lank, E.: Improving exploratory search experience through hierarchical knowledge graphs. In SIGIR (2017)","DOI":"10.1145\/3077136.3080829"},{"key":"601_CR31","volume-title":"Designing the User Interface: Strategies for Effective Human\u2013Computer Interaction","author":"B Shneiderman","year":"2009","unstructured":"Shneiderman, B., Plaisant, C., Cohen, M., Jacobs, S.: Designing the User Interface: Strategies for Effective Human\u2013Computer Interaction, 5th edn. Pearson, London (2009)","edition":"5"},{"key":"601_CR32","doi-asserted-by":"crossref","unstructured":"Shang, H., et\u00a0al.: Connected substructure similarity search. In SIGMOD (2010)","DOI":"10.1145\/1807167.1807264"},{"issue":"4","key":"601_CR33","first-page":"457","volume":"10","author":"T Siddiqui","year":"2016","unstructured":"Siddiqui, T., et al.: Effortless data exploration with zenvisage: an expressive and interactive visual analytics system. PVLDB 10(4), 457\u2013468 (2016)","journal-title":"PVLDB"},{"key":"601_CR34","doi-asserted-by":"crossref","unstructured":"Song, Y., Chua, H.E., Bhowmick, S.S., Choi, B., Zhou, S.: BOOMER: blending visual formulation and processing of p-homomorphic queries on large networks. In SIGMOD (2018)","DOI":"10.1145\/3183713.3196902"},{"key":"601_CR35","doi-asserted-by":"crossref","unstructured":"Sun, S., Luo, Q.: Scaling up subgraph query processing with efficient subgraph matching. In ICDE (2019)","DOI":"10.1109\/ICDE.2019.00028"},{"key":"601_CR36","doi-asserted-by":"crossref","unstructured":"Wang, C., Xie, M., Bhowmick, S.S., Choi, B., Xiao, X., Zhou, S.: An indexing framework for efficient visual exploratory subgraph search in graph databases. In ICDE (2019)","DOI":"10.1109\/ICDE.2019.00168"},{"key":"601_CR37","doi-asserted-by":"crossref","unstructured":"White, R.W., Roth, R.A.: Exploratory Search: Beyond the Query-response Paradigm. Synthesis Lectures on Information Concepts, Retrieval, and Services, vol. 1, 1 (2009)","DOI":"10.2200\/S00174ED1V01Y200901ICR003"},{"issue":"13","key":"601_CR38","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.14778\/3007263.3007299","volume":"9","author":"M Yahya","year":"2016","unstructured":"Yahya, M., Berberich, K., et al.: Exploratory querying of extended knowledge graphs. Proc. VLDB Endow. 9(13), 1521\u20131524 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"601_CR39","unstructured":"Yan, X., Han, J.: gspan: graph-based substructure pattern mining. In ICDM (2002)"},{"key":"601_CR40","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In SIGMOD (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"601_CR41","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In ACM SIGMOD (2005)","DOI":"10.1145\/1066157.1066244"},{"issue":"3","key":"601_CR42","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s00778-017-0454-9","volume":"26","author":"P Yi","year":"2017","unstructured":"Yi, P., Choi, B., et al.: AutoG: a visual query autocompletion framework for graph databases. VLDB J. 26(3), 347\u2013372 (2017)","journal-title":"VLDB J."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00601-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-020-00601-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00601-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,29]],"date-time":"2021-01-29T00:20:05Z","timestamp":1611879605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-020-00601-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,30]]},"references-count":42,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["601"],"URL":"https:\/\/doi.org\/10.1007\/s00778-020-00601-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,30]]},"assertion":[{"value":"29 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}