{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:43:18Z","timestamp":1760708598325},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,8,3]],"date-time":"2013-08-03T00:00:00Z","timestamp":1375488000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00778-013-0322-1","type":"journal-article","created":{"date-parts":[[2013,8,2]],"date-time":"2013-08-02T11:48:45Z","timestamp":1375444125000},"page":"401-426","source":"Crossref","is-referenced-by-count":21,"title":["QUBLE: towards blending interactive visual subgraph search queries on large networks"],"prefix":"10.1007","volume":"23","author":[{"given":"Ho Hoang","family":"Hung","sequence":"first","affiliation":[]},{"given":"Sourav S","family":"Bhowmick","sequence":"additional","affiliation":[]},{"given":"Ba Quan","family":"Truong","sequence":"additional","affiliation":[]},{"given":"Byron","family":"Choi","sequence":"additional","affiliation":[]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,8,3]]},"reference":[{"key":"322_CR1","unstructured":"Bhowmick, S.S. et al.: VOGUE: towards a visual interaction-aware graph query processing framework. In: CIDR (2013)"},{"key":"322_CR2","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W., Lu, A.: FG-Index: towards verification-free query processing on graph databases. In: SIGMOD (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"322_CR3","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: 3rd IAPR TC-15 workshop on graph-based representations in, pattern recognition (2001)"},{"key":"322_CR4","doi-asserted-by":"crossref","unstructured":"Han, W.-S. et al.: iGraph: a framework for comparisons of disk based graph indexing techniques. In: VLDB (2010)","DOI":"10.14778\/1920841.1920901"},{"key":"322_CR5","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"322_CR6","doi-asserted-by":"crossref","unstructured":"Huan, J.P., Wang, W.: Efficient mining of frequent subgraph in the presence of isomorphism. In: ICDM (2003)","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"322_CR7","doi-asserted-by":"crossref","unstructured":"Hung, H., Bhowmick, S.S. et al.: QUBLE: blending visual subgraph query formulation with query processing on large networks. In: SIGMOD (2013)","DOI":"10.1145\/2463676.2463681"},{"key":"322_CR8","doi-asserted-by":"crossref","unstructured":"Jin, C. et al.: GBLENDER: towards blending visual query formulation and query processing in graph databases. In: ACM SIGMOD (2010)","DOI":"10.1145\/1807167.1807182"},{"key":"322_CR9","doi-asserted-by":"crossref","unstructured":"Jin, C. et al.: Prague: a practical framework for blending visual subgraph query formulation and query processing. In: ICDE (2012)","DOI":"10.1109\/ICDE.2012.49"},{"key":"322_CR10","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1999)"},{"key":"322_CR11","doi-asserted-by":"crossref","unstructured":"Shang, H. et al.: Connected substructure similarity search. In: SIGMOD (2010)","DOI":"10.1145\/1807167.1807264"},{"key":"322_CR12","doi-asserted-by":"crossref","unstructured":"Tian, Y., Patel, J.: TALE: a tool for approximate large graph matching. In: ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"322_CR13","doi-asserted-by":"crossref","unstructured":"Xie, Y., Yu, P. S.: CP-Index: on the efficient indexing of large graphs. In: CIKM (2011)","DOI":"10.1145\/2063576.2063835"},{"key":"322_CR14","unstructured":"Yan, X., Han, J. : gSpan: graph-based substructure pattern mining. In: ICDM (2002)"},{"key":"322_CR15","doi-asserted-by":"crossref","unstructured":"Yan, X. et al.: Graph indexing: a frequent structure-based approach. In: SIGMOD (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"322_CR16","doi-asserted-by":"crossref","unstructured":"Yan, X. et al.: Substructure similarity search in graph databases. In: SIGMOD (2005)","DOI":"10.1145\/1066157.1066244"},{"key":"322_CR17","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J. et al.: Comparing stars: on approximating graph edit distance. In: VLDB (2009)","DOI":"10.14778\/1687627.1687631"},{"key":"322_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, S. et al.: GADDI: distance index based subgraph matching in biological networks. In: EDBT, pp. 192\u2013203 (2009)","DOI":"10.1145\/1516360.1516384"},{"key":"322_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, S. et al.: SAPPER: subgraph indexing and approximate matching in large graphs. In: VLDB (2010)","DOI":"10.14778\/1920841.1920988"},{"key":"322_CR20","doi-asserted-by":"crossref","unstructured":"Zhu, G., Lin, X., Zhu, K. et al.: TreeSpan: efficiently computing similarity all-matching. In: SIGMOD (2012)","DOI":"10.1145\/2213836.2213896"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-013-0322-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-013-0322-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-013-0322-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T08:39:23Z","timestamp":1563611963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-013-0322-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,3]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["322"],"URL":"https:\/\/doi.org\/10.1007\/s00778-013-0322-1","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,3]]}}}