{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:26:53Z","timestamp":1783038413091,"version":"3.54.6"},"publisher-location":"Cham","reference-count":163,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319493398","type":"print"},{"value":"9783319493404","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-49340-4_16","type":"book-chapter","created":{"date-parts":[[2017,2,25]],"date-time":"2017-02-25T08:23:30Z","timestamp":1488011010000},"page":"531-582","source":"Crossref","is-referenced-by-count":4,"title":["Big-Graphs: Querying, Mining, and Beyond"],"prefix":"10.1007","author":[{"given":"Arijit","family":"Khan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sayan","family":"Ranu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,2,26]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s00778-008-0125-y","volume":"18","author":"DJ Abadi","year":"2009","unstructured":"D.J. Abadi, A. Marcus, S.R. Madden, K. Hollenbach, SW-Store: a vertically partitioned DBMS for semantic web data management. VLDB J. 18(2), 385\u2013406 (2009)","journal-title":"VLDB J."},{"issue":"1","key":"16_CR2","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s007990050001","volume":"1","author":"S Abiteboul","year":"1997","unstructured":"S. Abiteboul, D. Quass, J. McHugh, J. Widom, J.L. Wiener, The lorel query language for semistructured data. Int. J. Digit. Libr. 1(1), 68\u201388 (1997)","journal-title":"Int. J. Digit. Libr."},{"key":"16_CR3","unstructured":"B.\u00a0Aditya, G.\u00a0Bhalotia, S.\u00a0Chakrabarti, A.\u00a0Hulgeri, C.\u00a0Nakhe, P.\u00a0Parag, S.\u00a0Sudarshan, BANKS: browsing and keyword searching in relational databases, in VLDB (2002)"},{"key":"16_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and Mining Graph Data","author":"C Aggarwal","year":"2010","unstructured":"C. Aggarwal, H. Wang, Managing and Mining Graph Data (Springer, Berlin, 2010)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"S.\u00a0Agrawal, S.\u00a0Chaudhuri, G.\u00a0Das, DBXplorer: a system for keyword-based search over relational databases, in ICDE (2002)","DOI":"10.1145\/564691.564782"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"D. Ajwani, M. Karnstedt, A. Sala, Processing large graphs: representations, storage, systems, and algorithms, in WWW (2015)","DOI":"10.1145\/2740908.2741990"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"R. Angles, C. Gutierrez, Survey of graph database models. ACM Comput. Surv. 40(1), 1:1\u20131:39 (2008)","DOI":"10.1145\/1322432.1322433"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"A.\u00a0Arora, M.\u00a0Sachan, A.\u00a0Bhattacharya, Mining statistically significant connected subgraphs in vertex labeled graphs, in SIGMOD (2014)","DOI":"10.1145\/2588555.2588574"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"P.\u00a0Barcel\u00f3, L.\u00a0Libkin, J.L. Reutter, Querying graph patterns, in PODS (2011)","DOI":"10.1145\/1989284.1989307"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"M. Bayati, M. Gerritsen, D.F. Gleich, A. Saberi, Y. Wang, Algorithms for large sparse network alignment problems, in ICDM (2009)","DOI":"10.1109\/ICDM.2009.135"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"J.\u00a0Berry, B.\u00a0Hendrickson, S.\u00a0Kahan, P.\u00a0Konecny, Software and algorithms for graph queries on multithreaded architectures, in IPDPS (2007)","DOI":"10.1109\/IPDPS.2007.370685"},{"key":"16_CR12","unstructured":"S.S. Bhowmick, B.\u00a0Choi, S.\u00a0Zhou, VOGUE: towards a visual interaction-aware graph query processing framework, in CIDR (2013)"},{"key":"16_CR13","unstructured":"C.\u00a0Borgelt, M.R. Berthold, Mining molecular fragments: finding relevant substructures of molecules, in ICDM (2002)"},{"issue":"1\u20137","key":"16_CR14","first-page":"107","volume":"30","author":"S Brin","year":"1998","unstructured":"S. Brin, L. Page, The anatomy of a large-scale hypertextual web search engine. Comput. Netw. 30(1\u20137), 107\u2013117 (1998)","journal-title":"Comput. Netw."},{"key":"16_CR15","unstructured":"B.\u00a0Bringmann, S.\u00a0Nijssen, What is frequent in a single graph? in PAKDD (2008)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"J.\u00a0Broekstra, A.\u00a0Kampman, F.v.\u00a0Harmelen, Sesame: a generic architecture for storing and querying RDF and RDF schema, in ISWC (2002)","DOI":"10.1007\/3-540-48005-6_7"},{"issue":"4","key":"16_CR17","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1177\/1094342011403516","volume":"25","author":"A Bulu\u00e7","year":"2011","unstructured":"A. Bulu\u00e7, J.R. Gilbert, The combinatorial BLAS: design, implementation, and applications. Int. J. High Perform. Comput. Appl. 25(4), 496\u2013509 (2011)","journal-title":"Int. J. High Perform. Comput. Appl."},{"issue":"1","key":"16_CR18","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/s007780050084","volume":"9","author":"P Buneman","year":"2000","unstructured":"P. Buneman, M.F. Fernandez, D. Suciu, UnQL: a query language and algebra for semistructured data based on structural recursion. VLDB J. 9(1), 76\u2013110 (2000)","journal-title":"VLDB J."},{"key":"16_CR19","unstructured":"M.\u00a0Bureli, The Current State of Graph Databases (2012). http:\/\/bigbe.su\/lectures\/2014\/16.3.pdf"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"C.\u00a0Chen, X.\u00a0Yan, F.\u00a0Zhu, J.\u00a0Han, P.S. Yu, Graph OLAP: towards online analytical processing on graphs, in ICDM (2008)","DOI":"10.1109\/ICDM.2008.30"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"H.\u00a0Cheng, D.\u00a0Lo, Y.\u00a0Zhou, X.\u00a0Wang, X.\u00a0Yan, Identifying bug signatures using discriminative graph mining, in ISSTA (2009)","DOI":"10.1145\/1572272.1572290"},{"key":"16_CR22","unstructured":"E.I. Chong, S.\u00a0Das, G.\u00a0Eadon, J.\u00a0Srinivasan, An efficient SQL-based RDF querying scheme, in VLDB (2005)"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"S.\u00a0Cohen, J.\u00a0Mamou, Y.\u00a0Kanza, Y.\u00a0Sagiv, XSEarch: a semantic search engine for XML, in VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50013-6"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"M.P. Consens, A.O. Mendelzon, Expressing structural hypertext queries in graphlogm, in HYPERTEXT (1989)","DOI":"10.1145\/74224.74247"},{"key":"16_CR25","unstructured":"S.\u00a0Cook, The complexity of theorem-proving procedures, in STOC (1971), pp. 151\u2013158"},{"issue":"10","key":"16_CR26","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"L.P. Cordella, P. Foggia, C. Sansone, M. Vento, A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"16_CR27","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"T.H. Cormen, C. Stein, R.L. Rivest, C.E. Leiserson, Introduction to Algorithms (McGraw-Hill Higher Education, New York, 2001)"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"X.H. Dang, A.\u00a0Singh, P.\u00a0Bogdanov, H.\u00a0You, B.\u00a0Hsu, Discriminative subnetworks with regularized spectral learning for global-state network data, in ECML PKDD (2014)","DOI":"10.1007\/978-3-662-44848-9_19"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"X.H. Dang, H.\u00a0You, P.\u00a0Bogdanov, A.\u00a0Singh, Learning predictive substructures with regularization for network data, in ICDM (2015)","DOI":"10.1109\/ICDM.2015.56"},{"key":"16_CR30","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M Deshpande","year":"2005","unstructured":"M. Deshpande, M. Kuramochi, N. Wale, G. Karypis, Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowl. Data Eng. 17, 1036\u20131050 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR31","unstructured":"DEX\/Sparksee, http:\/\/sparsity-technologies.com\/"},{"issue":"4","key":"16_CR32","first-page":"1055","volume":"15","author":"A Dovier","year":"2003","unstructured":"A. Dovier, C. Piazza, The subgraph bisimulation problem. TKDE 15(4), 1055\u20131056 (2003)","journal-title":"The subgraph bisimulation problem. TKDE"},{"key":"16_CR33","doi-asserted-by":"crossref","first-page":"09","DOI":"10.1371\/journal.pcbi.1002180","volume":"7","author":"J Dutkowski","year":"2011","unstructured":"J. Dutkowski, T. Ideker, Protein networks as logic functions in development and cancer. PLoS Comput. Biol. 7, 09 (2011)","journal-title":"PLoS Comput. Biol."},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"M.\u00a0Elseidy, E.\u00a0Abdelhamid, S.\u00a0Skiadopoulos, P.\u00a0Kalnis, GraMi: frequent subgraph and pattern mining in a single large graph, in VLDB (2014)","DOI":"10.14778\/2732286.2732289"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"O.\u00a0Erling, A.\u00a0Averbuch, J.\u00a0Larriba-Pey, H.\u00a0Chafi, A.\u00a0Gubichev, A.\u00a0Prat, M.-D. Pham, P.\u00a0Boncz, The LDBC social network benchmark: interactive workload, in SIGMOD (2015)","DOI":"10.1145\/2723372.2742786"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"R.\u00a0Fagin, A.\u00a0Lotem, M.\u00a0Naor, Optimal aggregation algorithms for middleware, in PODS (2001)","DOI":"10.1145\/375551.375567"},{"key":"16_CR37","unstructured":"C.\u00a0Faloutsos, G.\u00a0Miller, C.\u00a0Tsourakakis, Large graph mining: power tools and a practioner\u2019s guide, in KDD (2009)"},{"key":"16_CR38","doi-asserted-by":"crossref","unstructured":"W.\u00a0Fan, J.\u00a0Li, S.\u00a0Ma, N.\u00a0Tang, Y.\u00a0Wu, Y.\u00a0Wu, Graph pattern matching: from intractable to polynomial time, in VLDB (2010)","DOI":"10.14778\/1920841.1920878"},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"W.\u00a0Fan, J.\u00a0Li, S.\u00a0Ma, H.\u00a0Wang, Y.\u00a0Wu, Graph homomorphism revisited for graph matching, in VLDB (2010)","DOI":"10.14778\/1920841.1920986"},{"key":"16_CR40","doi-asserted-by":"crossref","unstructured":"W.\u00a0Fan, J.\u00a0Li, J.\u00a0Luo, Z.\u00a0Tan, X.\u00a0Wang, Y.\u00a0Wu, Incremental graph pattern matching, in SIGMOD (2011)","DOI":"10.1145\/1989323.1989420"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"W.\u00a0Fan, J.\u00a0Li, S.\u00a0Ma, N.\u00a0Tang, Y.\u00a0Wu, Adding regular expressions to graph reachability and pattern queries, in ICDE (2011)","DOI":"10.1109\/ICDE.2011.5767858"},{"issue":"1","key":"16_CR42","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/s007780050082","volume":"9","author":"MF Fernandez","year":"2000","unstructured":"M.F. Fernandez, D. Florescu, A.Y. Levy, D. Suciu, Declarative specification of web sites with STRUDEL. VLDB J. 9(1), 38\u201355 (2000)","journal-title":"VLDB J."},{"key":"16_CR43","doi-asserted-by":"crossref","unstructured":"M. Fiedler, C. Borgelt, Subgraph support in a single large graph, in ICDM Workshops, 2007 (2007)","DOI":"10.1109\/ICDMW.2007.74"},{"key":"16_CR44","doi-asserted-by":"crossref","unstructured":"B.\u00a0Gallagher, Matching structure and semantics: a survey on graph-based pattern matching, in AAAI FS (2006)","DOI":"10.2172\/895418"},{"key":"16_CR45","unstructured":"J.E. Gonzalez, R.S. Xin, A.\u00a0Dave, D.\u00a0Crankshaw, M.J. Franklin, I.\u00a0Stoica, GraphX: graph processing in a distributed dataflow framework, in OSDI (2014)"},{"key":"16_CR46","unstructured":"D.\u00a0Gregor, A.\u00a0Lumsdaine, The parallel BGL: a generic library for distributed graph computations, in POOSC (2005)"},{"key":"16_CR47","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Guan, J.\u00a0Wu, Q.\u00a0Zhang, A.\u00a0Singh, X.\u00a0Yan, Assessing and ranking structural correlations in graphs, in SIGMOD (2011)","DOI":"10.1145\/1989323.1989421"},{"key":"16_CR48","doi-asserted-by":"crossref","unstructured":"L.\u00a0Guo, F.\u00a0Shao, C.\u00a0Botev, J.\u00a0Shanmugasundaram, XRANK: ranked keyword search over XML documents, in SIGMOD (2003)","DOI":"10.1145\/872760.872762"},{"key":"16_CR49","doi-asserted-by":"crossref","unstructured":"R.\u00a0Gupta, S.\u00a0Sarawagi, Answering table augmentation queries from unstructured lists on the web, in VLDB (2009)","DOI":"10.14778\/1687627.1687661"},{"key":"16_CR50","doi-asserted-by":"crossref","unstructured":"S.\u00a0Gurukar, S.\u00a0Ranu, B.\u00a0Ravindran, COMMIT: a scalable approach to mining communication motifs from dynamic networks, in SIGMOD (2015)","DOI":"10.1145\/2723372.2737791"},{"key":"16_CR51","doi-asserted-by":"crossref","unstructured":"A.\u00a0Guttman, R-trees: a dynamic index structure for spatial searching, in SIGMOD (1984)","DOI":"10.1145\/602264.602266"},{"key":"16_CR52","doi-asserted-by":"crossref","unstructured":"J.\u00a0Han, Y.\u00a0Sun, X.\u00a0Yan, P.S. Yu, Mining knowledge from databases: an information network analysis approach, in SIGMOD (2010)","DOI":"10.1145\/1807167.1807333"},{"key":"16_CR53","doi-asserted-by":"crossref","unstructured":"L.\u00a0Han, T.\u00a0Finin, A.\u00a0Joshi, GoRelations: an intuitive query system for dbpedia, in JIST (2011)","DOI":"10.1007\/978-3-642-29923-0_22"},{"key":"16_CR54","doi-asserted-by":"crossref","unstructured":"M.\u00a0Han, K.\u00a0Daudjee, K.\u00a0Ammar, M.T. \u00d6zsu, X.\u00a0Wang, T.\u00a0Jin, An experimental comparison of pregel-like graph processing systems, in VLDB (2014)","DOI":"10.14778\/2732977.2732980"},{"key":"16_CR55","doi-asserted-by":"crossref","unstructured":"W.-S. Han, J.\u00a0Lee, M.-D. Pham, J.\u00a0Yu, iGraph: a framework for comparisons of disk-based graph indexing techniques, in VLDB (2010)","DOI":"10.14778\/1920841.1920901"},{"key":"16_CR56","doi-asserted-by":"crossref","unstructured":"W.-S. Han, S.\u00a0Lee, K.\u00a0Park, J.-H. Lee, M.-S. Kim, J.\u00a0Kim, H.\u00a0Yu, TurboGraph: a fast parallel graph engine handling billion-scale graphs in a single PC, in KDD (2013)","DOI":"10.1145\/2487575.2487581"},{"key":"16_CR57","unstructured":"S.\u00a0Harris, N.\u00a0Gibbins, 3store: efficient bulk RDF, in PSSS (2003)"},{"key":"16_CR58","doi-asserted-by":"crossref","unstructured":"M.A. Hasan, V.\u00a0Chaoji, S.\u00a0Salem, J.\u00a0Besson, M.J. Zaki, ORIGAMI: mining representative orthogonal graph patterns, in ICDM (2007)","DOI":"10.1109\/ICDM.2007.45"},{"key":"16_CR59","doi-asserted-by":"crossref","unstructured":"M.A. Hasan, M.J. Zaki, Output space sampling for graph patterns, in VLDB (2009)","DOI":"10.14778\/1687627.1687710"},{"key":"16_CR60","doi-asserted-by":"crossref","unstructured":"H.\u00a0He, A.\u00a0Singh, Graphs-at-a-time: query language and access methods for graph databases, in SIGMOD (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"16_CR61","doi-asserted-by":"crossref","unstructured":"H.\u00a0He, H.\u00a0Wang, J.\u00a0Yang, P.S. Yu, BLINKS: ranked keyword searches on graphs, in SIGMOD (2007)","DOI":"10.1145\/1247480.1247516"},{"key":"16_CR62","doi-asserted-by":"crossref","unstructured":"B.\u00a0Hendrickson, R.\u00a0Leland, A multilevel algorithm for partitioning graphs, in Supercomputing (1995)","DOI":"10.1145\/224170.224228"},{"key":"16_CR63","unstructured":"M.R. Henzinger, T.A. Henzinger, P.W. Kopke, Computing simulations on finite and infinite graphs, in FOCS (1995)"},{"key":"16_CR64","doi-asserted-by":"crossref","unstructured":"S.\u00a0Hong, H.\u00a0Chafi, E.\u00a0Sedlar, K.\u00a0Olukotun, Green-Marl: a dsl for easy and efficient graph analysis, in ASPLOS (2012)","DOI":"10.1145\/2150976.2151013"},{"key":"16_CR65","doi-asserted-by":"crossref","unstructured":"V.\u00a0Hristidis, Y.\u00a0Papakonstantinou, Discover: keyword search in relational databases, in VLDB (2002)","DOI":"10.1016\/B978-012722442-8\/50080-X"},{"key":"16_CR66","doi-asserted-by":"crossref","unstructured":"V.\u00a0Hristidis, L.\u00a0Gravano, Y.\u00a0Papakonstantinou, Efficient IR-style keyword search over relational databases, in VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50080-X"},{"issue":"4","key":"16_CR67","first-page":"525","volume":"18","author":"V Hristidis","year":"2006","unstructured":"V. Hristidis, N. Koudas, Y. Papakonstantinou, D. Srivastava, Keyword proximity search in XML trees. TKDE 18(4), 525\u2013539 (2006)","journal-title":"TKDE"},{"key":"16_CR68","doi-asserted-by":"crossref","unstructured":"J.\u00a0Huan, W.\u00a0Wang, J.\u00a0Prins, Efficient mining of frequent subgraphs in the presence of isomorphism, in ICDM (2003)","DOI":"10.1145\/1014052.1014123"},{"key":"16_CR69","doi-asserted-by":"crossref","unstructured":"J.\u00a0Huan, W.\u00a0Wang, J.\u00a0Prins, J.\u00a0Yang, Spin: mining maximal frequent subgraphs from graph databases, in KDD (2004)","DOI":"10.1145\/1014052.1014123"},{"key":"16_CR70","unstructured":"J.\u00a0Huan, W.\u00a0Wang, D.Bandyopadhyay, J.\u00a0Snoeyink, J.\u00a0Prins, A.\u00a0Tropsha, Mining spatial motifs from protein structure graphs, in Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB04) (2004), pp. 308\u2013315"},{"key":"16_CR71","unstructured":"InfiniteGraph, http:\/\/www.objectivity.com\/products\/infinitegraph\/"},{"key":"16_CR72","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume":"1910","author":"A Inokuchi","year":"2000","unstructured":"A. Inokuchi, T. Washio, H. Motoda, An apriori-based algorithm for mining frequent substructures from graph data. Princ. Data Min. Knowl. Discov. 1910, 13\u201323 (2000)","journal-title":"Princ. Data Min. Knowl. Discov."},{"issue":"10","key":"16_CR73","first-page":"2797","volume":"27","author":"N Jayaram","year":"2015","unstructured":"N. Jayaram, A. Khan, C. Li, X. Yan, R. Elmasri, Querying knowledge graphs by example entity tuples. TKDE 27(10), 2797\u20132811 (2015)","journal-title":"TKDE"},{"key":"16_CR74","doi-asserted-by":"crossref","unstructured":"N.\u00a0Jin, C.\u00a0Young, W.Wang, 0010. GAIA: graph classification using evolutionary computation, in SIGMOD (2010)","DOI":"10.1145\/1807167.1807262"},{"key":"16_CR75","doi-asserted-by":"crossref","unstructured":"C.\u00a0Jin, S.S. Bhowmick, X.\u00a0Xiao, B.\u00a0Choi, S.\u00a0Zhou, GBLENDER: visual subgraph query formulation meets query processing, in SIGMOD (2011)","DOI":"10.1145\/1989323.1989489"},{"key":"16_CR76","unstructured":"V.\u00a0Kacholia, S.\u00a0Pandit, S.\u00a0Chakrabarti, S.\u00a0Sudarshan, R.\u00a0Desai, H.\u00a0Karambelkar, Bidirectional expansion for keyword search on graph databases, in VLDB (2005)"},{"key":"16_CR77","doi-asserted-by":"crossref","unstructured":"M.\u00a0Kargar, A.\u00a0An, Keyword search in graphs: finding R-cliques, in VLDB (2011)","DOI":"10.14778\/2021017.2021025"},{"key":"16_CR78","volume-title":"METIS and ParMETIS, in Encyclopedia of parallel computing","author":"G Karypis","year":"2011","unstructured":"G. Karypis, METIS and ParMETIS, in Encyclopedia of parallel computing (Springer, Berlin, 2011)"},{"key":"16_CR79","unstructured":"Z.\u00a0Kefato, M.\u00a0Lissandrini, D.\u00a0Mottin, T.\u00a0Palpanas, Keyword Query to Graph Query. Technical report DISI-14-003, University of Trento (2013)"},{"key":"16_CR80","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1093\/nar\/gkh411","volume":"32","author":"BP Kelley","year":"2004","unstructured":"B.P. Kelley, B. Yuan, F. Lewitter, R. Sharan, B.R. Stockwell, T. Ideker, PathBLAST: a tool for alignment of protein interaction networks. Nucleic Acids Res. 32, 83\u201388 (2004)","journal-title":"Nucleic Acids Res."},{"key":"16_CR81","doi-asserted-by":"crossref","unstructured":"D.\u00a0Kempe, J.M. Kleinberg, E.\u00a0Tardos, Maximizing the spread of influence through a social network, in KDD (2003)","DOI":"10.1145\/956755.956769"},{"key":"16_CR82","doi-asserted-by":"crossref","unstructured":"A.\u00a0Khan, L.\u00a0Chen, On uncertain graphs modeling and queries, in VLDB (2015)","DOI":"10.14778\/2824032.2824133"},{"key":"16_CR83","doi-asserted-by":"crossref","unstructured":"A.\u00a0Khan, S.\u00a0Elnikety, Systems for big-graphs, in VLDB (2014)","DOI":"10.14778\/2733004.2733067"},{"key":"16_CR84","doi-asserted-by":"crossref","unstructured":"A.\u00a0Khan, N.\u00a0Li, Z.\u00a0Guan, S.\u00a0Chakraborty, S.\u00a0Tao, Neighborhood based fast graph search in large networks, in SIGMOD (2011)","DOI":"10.1145\/1989323.1989418"},{"key":"16_CR85","doi-asserted-by":"crossref","unstructured":"A.\u00a0Khan, X.\u00a0Yan, K.-L. Wu, Towards proximity pattern mining in large graphs, in SIGMOD (2010)","DOI":"10.1145\/1807167.1807261"},{"key":"16_CR86","doi-asserted-by":"crossref","unstructured":"A.\u00a0Khan, Y.\u00a0Wu, X.\u00a0Yan, Emerging graph queries in linked data, in ICDE (2012)","DOI":"10.1109\/ICDE.2012.143"},{"key":"16_CR87","doi-asserted-by":"crossref","unstructured":"A.\u00a0Khan, Y.\u00a0Wu, C.\u00a0Aggarwal, X.\u00a0Yan, NeMa: fast graph search with label similarity, in VLDB (2013)","DOI":"10.14778\/2535569.2448952"},{"key":"16_CR88","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"J Kleinberg","year":"2000","unstructured":"J. Kleinberg, Navigation in a small world. Nature 406, 845 (2000)","journal-title":"Nature"},{"key":"16_CR89","unstructured":"K.\u00a0Kochut, M.\u00a0Janik, SPARQLeR: extended sparql for semantic association discovery, in ESWC (2007)"},{"key":"16_CR90","unstructured":"R.\u00a0Krishnamurthy, S.P. Morgan, M.\u00a0Zloof, Query-by-example: operations on piecewise continuous data, in VLDB (1983)"},{"key":"16_CR91","unstructured":"M.\u00a0Kuramochi, G.\u00a0Karypis, Frequent subgraph discovery, in ICDM (2001)"},{"key":"16_CR92","doi-asserted-by":"crossref","unstructured":"M.\u00a0Kuramochi, G.\u00a0Karypis, GREW-a scalable frequent subgraph discovery algorithm, in ICDM (2004)","DOI":"10.21236\/ADA439436"},{"key":"16_CR93","doi-asserted-by":"crossref","unstructured":"T.\u00a0Lappas, K.\u00a0Liu, E.\u00a0Terzi, Finding a team of experts in social networks, in KDD (2009)","DOI":"10.1145\/1557019.1557074"},{"key":"16_CR94","doi-asserted-by":"crossref","unstructured":"J.\u00a0Lee, W.-S. Han, R.\u00a0Kasperovics, J.-H. Lee, An in-depth comparison of subgraph isomorphism algorithms in graph databases, in VLDB (2013)","DOI":"10.14778\/2535568.2448946"},{"key":"16_CR95","doi-asserted-by":"crossref","unstructured":"J.\u00a0Leskovec, C.\u00a0Faloutsos, Tools for large graph mining: structure and difference, in WWW (2008)","DOI":"10.1145\/1452520.1452521"},{"key":"16_CR96","doi-asserted-by":"crossref","unstructured":"G. Li, B.C. Ooi, J. Feng, J. Wang, L. Zhou, EASE: an effective 3-in-1 keyword search method for unstructured semi-structured and structured data, in SIGMOD (2008)","DOI":"10.1145\/1376616.1376706"},{"issue":"17","key":"16_CR97","doi-asserted-by":"crossref","first-page":"2175","DOI":"10.1093\/bioinformatics\/btl287","volume":"22","author":"Z Liang","year":"2006","unstructured":"Z. Liang, M. Xu, M. Teng, L. Niu, NetAlign: a web-based tool for comparison of protein interaction networks. Bioinformatics 22(17), 2175\u20132177 (2006)","journal-title":"Bioinformatics"},{"key":"16_CR98","doi-asserted-by":"crossref","unstructured":"F.\u00a0Liu, C.\u00a0Yu, W.\u00a0Meng, A.\u00a0Chowdhury, Effective keyword search in relational databases, in SIGMOD (2006)","DOI":"10.1145\/1142473.1142536"},{"key":"16_CR99","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Low, D.\u00a0Bickson, J.\u00a0Gonzalez, C.\u00a0Guestrin, A.\u00a0Kyrola, J.M. Hellerstein, Distributed graphlab: a framework for machine learning and data mining in the cloud, in VLDB (2012)","DOI":"10.14778\/2212351.2212354"},{"key":"16_CR100","doi-asserted-by":"crossref","unstructured":"S.\u00a0Ma, Y.\u00a0Cao, W.\u00a0Fan, J.\u00a0Huai, T.\u00a0Wo, Capturing topology in graph pattern matching, in VLDB (2012)","DOI":"10.1145\/2187836.2187963"},{"key":"16_CR101","doi-asserted-by":"crossref","unstructured":"G.\u00a0Malewicz, M.H. Austern, A.J.C. Bik, J.C. Dehnert, I.\u00a0Horn, N.\u00a0Leiser, G.\u00a0Czajkowski, Pregel: a system for large-scale graph processing, in SIGMOD (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"16_CR102","unstructured":"F.\u00a0Manola, E.\u00a0Miller, RDF Primer, W3C Recommendation (2004). http:\/\/www.w3.org\/TR\/REC-rdf-syntax\/"},{"key":"16_CR103","doi-asserted-by":"crossref","unstructured":"R.R. McCune, T.\u00a0Weninger, G. Madey, Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Comput. Surv. 48(2), 25:1\u201325:39 (2015)","DOI":"10.1145\/2818185"},{"issue":"1","key":"16_CR104","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/2627692.2627694","volume":"43","author":"A McGregor","year":"2014","unstructured":"A. McGregor, Graph stream algorithms: a survey. SIGMOD Rec. 43(1), 9\u201320 (2014)","journal-title":"SIGMOD Rec."},{"key":"16_CR105","unstructured":"F.\u00a0McSherry, M.\u00a0Isard, D.G. Murray, Scalability! but at what COST? in HotOS (2015)"},{"issue":"1","key":"16_CR106","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K Mehlhorn","year":"1995","unstructured":"K. Mehlhorn, S. Naher, LEDA, a platform for combinatorial and geometric computing. Commun. ACM 38(1), 96\u2013102 (1995)","journal-title":"Commun. ACM"},{"key":"16_CR107","unstructured":"S.\u00a0Melnik, H.G.-Molina, E.\u00a0Rahm, Similarity flooding: a versatile graph matching algorithm and its application to schema matching, in ICDE (2002)"},{"issue":"6","key":"16_CR108","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1137\/S009753979122370X","volume":"24","author":"AO Mendelzon","year":"1995","unstructured":"A.O. Mendelzon, P.T. Wood, Finding regular simple paths in graph databases. SIAM J. Comput. 24(6), 1235\u20131258 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"16_CR109","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1142\/S021972001000477X","volume":"8","author":"M Mongiov\u00ec","year":"2010","unstructured":"M. Mongiov\u00ec, R.D. Natale, R. Giugno, A. Pulvirenti, A. Ferro, R. Sharan, Sigma: a set-cover-based inexact graph matching algorithm. J. Bioinform. Comput. Biol. 8(2), 199\u2013218 (2010)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"16_CR110","doi-asserted-by":"crossref","unstructured":"D.\u00a0Mottin, M.\u00a0Lissandrini, Y.\u00a0Velegrakis, T.\u00a0Palpanas, Exemplar queries: give me an example of what you need, in VLDB (2014)","DOI":"10.14778\/2732269.2732273"},{"key":"16_CR111","doi-asserted-by":"crossref","unstructured":"D.G. Murray, F.\u00a0McSherry, R.\u00a0Isaacs, M.\u00a0Isard, P.\u00a0Barham, M.\u00a0Abadi, Naiad: a timely dataflow system, in SOSP (2013)","DOI":"10.1145\/2517349.2522738"},{"key":"16_CR112","unstructured":"Neo4j, https:\/\/neo4j.com\/"},{"issue":"1","key":"16_CR113","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00778-009-0165-y","volume":"19","author":"T Neumann","year":"2010","unstructured":"T. Neumann, G. Weikum, The RDF-3X engine for scalable management of RDF data. VLDB J. 19(1), 91\u2013113 (2010)","journal-title":"VLDB J."},{"key":"16_CR114","unstructured":"S.\u00a0Nijssen, J.N. Kok, The gaston tool for frequent subgraph mining, in Proceedings of the International Workshop on Graph-Based Tools (2004)"},{"key":"16_CR115","unstructured":"M.T. \u00d6zsu, A survey of rdf data management systems (2015). http:\/\/arxiv.org\/abs\/1601.00707"},{"key":"16_CR116","doi-asserted-by":"crossref","unstructured":"F.\u00a0Pellegrini, J.\u00a0Roman, SCOTCH: a software package for static mapping by dual recursive bipartitioning of process and architecture graphs, in HPCN (1996)","DOI":"10.1007\/3-540-61142-8_588"},{"key":"16_CR117","unstructured":"E.\u00a0Prud\u2019hommeaux, A.\u00a0Seaborne, SPARQL query language for RDF. W3C Recommendation (2008)"},{"issue":"9","key":"16_CR118","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1002\/minf.201100058","volume":"30","author":"S Ranu","year":"2011","unstructured":"S. Ranu, B.T. Calhoun, A.K. Singh, S.J. Swamidass, Probabilistic substructure mining from small-molecule screens. Mol. Inform. 30(9), 809\u2013815 (2011)","journal-title":"Mol. Inform."},{"key":"16_CR119","doi-asserted-by":"crossref","unstructured":"S.\u00a0Ranu, M.\u00a0Hoang, A.\u00a0Singh, Mining discriminative subgraphs from global-state networks, in KDD (2013)","DOI":"10.1145\/2487575.2487692"},{"key":"16_CR120","doi-asserted-by":"crossref","unstructured":"S.\u00a0Ranu, A.K. Singh, GraphSig: a scalable approach to mining significant subgraphs in large graph databases, in ICDE (2009)","DOI":"10.1109\/ICDE.2009.133"},{"key":"16_CR121","doi-asserted-by":"crossref","first-page":"2537","DOI":"10.1021\/ci900035z","volume":"49","author":"S Ranu","year":"2009","unstructured":"S. Ranu, A.K. Singh, Mining statistically significant molecular substructures for efficient molecular classification. J. Chem. Inf. Model. 49, 2537\u20132550 (2009)","journal-title":"J. Chem. Inf. Model."},{"issue":"4","key":"16_CR122","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/1815948.1815953","volume":"38","author":"S Sakr","year":"2010","unstructured":"S. Sakr, G. Al-Naymat, Relational processing of RDF queries: a survey. SIGMOD Rec. 38(4), 23\u201328 (2010)","journal-title":"SIGMOD Rec."},{"key":"16_CR123","doi-asserted-by":"crossref","unstructured":"S.\u00a0Sakr, S.\u00a0Elnikety, Y.\u00a0He, G-SPARQL: a hybrid engine for querying large attributed graphs, in CIKM (2012)","DOI":"10.1145\/2396761.2396806"},{"key":"16_CR124","doi-asserted-by":"crossref","unstructured":"H.\u00a0Samet, J.\u00a0Sankaranarayanan, H.\u00a0Alborzi, Scalable network distance browsing in spatial databases, in SIGMOD (2008)","DOI":"10.1145\/1376616.1376623"},{"key":"16_CR125","doi-asserted-by":"crossref","unstructured":"M.\u00a0Sarwat, S.\u00a0Elnikety, Y.\u00a0He, M.F. Mokbel, Horton+: a distributed system for processing declarative reachability queries over partitioned graphs, in VLDB (2013)","DOI":"10.14778\/2556549.2556573"},{"key":"16_CR126","doi-asserted-by":"crossref","unstructured":"H.\u00a0Shang, Y.\u00a0Zhang, X.\u00a0Lin, J.\u00a0Yu, Taming verification hardness: an efficient algorithm for testing subgraph isomorphism, in VLDB (2008)","DOI":"10.14778\/1453856.1453899"},{"key":"16_CR127","doi-asserted-by":"crossref","unstructured":"J.\u00a0Shun, G.E. Blelloch, Ligra: a lightweight graph processing framework for shared memory, in PPoPP (2013)","DOI":"10.1145\/2442516.2442530"},{"issue":"35","key":"16_CR128","doi-asserted-by":"crossref","first-page":"12763","DOI":"10.1073\/pnas.0806627105","volume":"105","author":"R Singh","year":"2008","unstructured":"R. Singh, J. Xu, B. Berger, Global alignment of multiple protein interaction networks with application to functional orthology detection. PNAS 105(35), 12763\u201312768 (2008)","journal-title":"PNAS"},{"key":"16_CR129","doi-asserted-by":"crossref","unstructured":"C.\u00a0Sommer, Shortest-path queries in static networks. ACM Comput. Surv. 46(4), 45:1\u201345:31 (2014)","DOI":"10.1145\/2530531"},{"key":"16_CR130","doi-asserted-by":"crossref","unstructured":"H.\u00a0Sun, M.\u00a0Srivatsa, S.\u00a0Tan, Y.\u00a0Li, L.M. Kaplan, S.\u00a0Tao, X.\u00a0Yan, Analyzing expert behaviors in collaborative networks, in KDD (2014)","DOI":"10.1145\/2623330.2623722"},{"key":"16_CR131","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Sun, J.\u00a0Han, X.\u00a0Yan, P.S. Yu, T.\u00a0Wu, PathSim: meta path-based top-K similarity search in heterogeneous information networks, in VLDB (2011)","DOI":"10.14778\/3402707.3402736"},{"key":"16_CR132","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Sun, H.\u00a0Wang, H.\u00a0Wang, B.\u00a0Shao, J.\u00a0Li, Efficient subgraph matching on billion node graphs, in VLDB (2012)","DOI":"10.14778\/2311906.2311907"},{"key":"16_CR133","doi-asserted-by":"crossref","unstructured":"M.\u00a0Thoma, H.\u00a0Cheng, A.\u00a0Gretton, J.\u00a0Han, H.-P. Kriegel, A.\u00a0Smola, L.\u00a0Song, P.S. Yu, X.\u00a0Yan, K.\u00a0Borgwardt, Near-optimal supervised feature selection among frequent subgraphs, in SDM (2009)","DOI":"10.1137\/1.9781611972795.92"},{"key":"16_CR134","doi-asserted-by":"crossref","unstructured":"L.T. Thomas, S.R. Valluri, K.\u00a0Karlapalem, MARGIN: maximal frequent subgraph mining. ACM Trans. Knowl. Discov. Data 4(3), 10:1\u201310:42 (2010)","DOI":"10.1145\/1839490.1839491"},{"issue":"2","key":"16_CR135","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1093\/bioinformatics\/btl571","volume":"23","author":"Y Tian","year":"2006","unstructured":"Y. Tian, R. McEachin, C. Santos, D. States, J. Patel, SAGA: a subgraph matching tool for biological graphs. Bioinformatics 23(2), 232\u2013239 (2006)","journal-title":"Bioinformatics"},{"key":"16_CR136","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Tian, J.M. Patel, TALE: a tool for approximate large graph matching, in ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"16_CR137","doi-asserted-by":"crossref","unstructured":"H.\u00a0Tong, C.-Y. Lin, Non-negative residual matrix factorization with application to graph anomaly detection, in SDM (2011)","DOI":"10.1137\/1.9781611972818.13"},{"key":"16_CR138","doi-asserted-by":"crossref","unstructured":"H.\u00a0Tong, C.\u00a0Faloutsos, B.\u00a0Gallagher, T.\u00a0Eliassi-Rad, Fast best-effort pattern matching in large attributed graphs, in KDD (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"16_CR139","doi-asserted-by":"crossref","unstructured":"S.\u00a0Tri\u00dfl, U.\u00a0Leser, Fast and practical indexing and querying of very large graphs, in SIGMOD (2007)","DOI":"10.1145\/1247480.1247573"},{"key":"16_CR140","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"J.R. Ullmann, An algorithm for subgraph isomorphism. J. ACM 23, 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"16_CR141","unstructured":"N.\u00a0Vanetik, E.\u00a0Gudes, Mining frequent labeled and partially labeled graph patterns, in ICDE (2004)"},{"key":"16_CR142","doi-asserted-by":"crossref","unstructured":"C.\u00a0Vicknair, M.\u00a0Macias, Z.\u00a0Zhao, X.\u00a0Nan, Y.\u00a0Chen, D.\u00a0Wilkins, A comparison of a graph database and a relational database: a data provenance perspective, in ACMSE (2010)","DOI":"10.1145\/1900008.1900067"},{"key":"16_CR143","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"S.V.N. Vishwanathan, N.N. Schraudolph, R. Kondor, K.M. Borgwardt, Graph Kernels. J. Mach. Learn. Res. 11, 1201\u20131242 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"16_CR144","doi-asserted-by":"crossref","unstructured":"R.C. Wang, W.\u00a0Cohen, Language-independent set expansion of named entities using the web, in ICDM (2007)","DOI":"10.1109\/ICDM.2007.104"},{"key":"16_CR145","doi-asserted-by":"crossref","unstructured":"A.\u00a0Wlc, R.\u00a0Raman, Z.\u00a0Wu, S.\u00a0Hong, H.\u00a0Chafi, J.\u00a0Banerjee, Graph analysis: do we have to reinvent the wheel? in GRADES (2013)","DOI":"10.1145\/2484425.2484432"},{"key":"16_CR146","unstructured":"K.\u00a0Wilkinson, C.\u00a0Sayers, H.\u00a0Kuno, D.\u00a0Reynolds, Efficient RDF storage and retrieval in Jena2, in SWDB (2003)"},{"issue":"1","key":"16_CR147","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/2206869.2206879","volume":"41","author":"PT Wood","year":"2012","unstructured":"P.T. Wood, Query languages for graph databases. SIGMOD Rec. 41(1), 50\u201360 (2012)","journal-title":"SIGMOD Rec."},{"key":"16_CR148","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Xu, Y.\u00a0Papakonstantinou, Efficient keyword search for smallest LCAs in XML databases, in SIGMOD (2005)","DOI":"10.1145\/1066157.1066217"},{"key":"16_CR149","unstructured":"X.\u00a0Yan, J.\u00a0Han, gSpan: graph-based substructure pattern mining, in ICDM (2002)"},{"key":"16_CR150","doi-asserted-by":"crossref","unstructured":"X.\u00a0Yan, J.\u00a0Han, Closegraph: mining closed frequent graph patterns, in KDD (2003)","DOI":"10.1145\/956755.956784"},{"key":"16_CR151","doi-asserted-by":"crossref","unstructured":"X.\u00a0Yan, P.S. Yu, J.\u00a0Han, Graph indexing: a frequent structure-based approach, in SIGMOD (2004)","DOI":"10.1145\/1007568.1007607"},{"issue":"4","key":"16_CR152","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1145\/1189769.1189777","volume":"31","author":"X Yan","year":"2006","unstructured":"X. Yan, F. Zhu, P.S. Yu, J. Han, Feature-based similarity search in graph structures. ACM Trans. Database Syst. 31(4), 1418\u20131453 (2006)","journal-title":"ACM Trans. Database Syst."},{"key":"16_CR153","doi-asserted-by":"crossref","unstructured":"X.\u00a0Yan, H.\u00a0Cheng, J.\u00a0Han, P.S. Yu, Mining significant graph patterns by scalable leap search, in SIGMOD (2008)","DOI":"10.1145\/1376616.1376662"},{"key":"16_CR154","doi-asserted-by":"crossref","unstructured":"X.\u00a0Yan, B.\u00a0He, F.\u00a0Zhu, J.\u00a0Han, Top-K aggregation queries over large networks, in ICDE (2010)","DOI":"10.1109\/ICDE.2010.5447863"},{"key":"16_CR155","doi-asserted-by":"crossref","unstructured":"J.\u00a0Yao, B.\u00a0Cui, L.\u00a0Hua, Y.\u00a0Huang, Keyword query reformulation on structured data, in ICDE (2012)","DOI":"10.1109\/ICDE.2012.76"},{"key":"16_CR156","doi-asserted-by":"crossref","unstructured":"S.\u00a0Zhang, S.\u00a0Li, J.\u00a0Yang, GADDI: distance index based subgraph matching in biological networks, in EDBT (2009)","DOI":"10.1145\/1516360.1516384"},{"key":"16_CR157","doi-asserted-by":"crossref","unstructured":"S.\u00a0Zhang, J.\u00a0Yang, S.\u00a0Li, RING: an integrated method for frequent representative subgraph mining, in ICDM (2009)","DOI":"10.1109\/ICDM.2009.96"},{"key":"16_CR158","doi-asserted-by":"crossref","unstructured":"S.\u00a0Zhang, J.\u00a0Yang, W.\u00a0Jin, SAPPER: subgraph indexing and approximate matching in large graphs, in VLDB (2010)","DOI":"10.14778\/1920841.1920988"},{"key":"16_CR159","doi-asserted-by":"crossref","unstructured":"P.\u00a0Zhao, J.\u00a0Han, On graph query optimization in large networks, in VLDB (2010)","DOI":"10.14778\/1920841.1920887"},{"key":"16_CR160","doi-asserted-by":"crossref","unstructured":"Q.\u00a0Zhong, H.\u00a0Li, J.\u00a0Li, G.\u00a0Xie, J.\u00a0Tang, L.\u00a0Zhou, Y.\u00a0Pan, A Gauss function based approach for unbalanced ontology matching, in SIGMOD (2009)","DOI":"10.1145\/1559845.1559915"},{"key":"16_CR161","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Zhu, L.\u00a0Qin, J.\u00a0Yu, H.\u00a0Cheng, Finding top-k similar graphs in graph databases, in EDBT (2012)","DOI":"10.1145\/2247596.2247650"},{"key":"16_CR162","doi-asserted-by":"crossref","unstructured":"L.\u00a0Zou, L.\u00a0Chen, M.T. \u00d6zsu, D.\u00a0Zhao, Dynamic skyline queries in large graphs, in DASFAA (2010)","DOI":"10.1007\/978-3-642-12098-5_5"},{"key":"16_CR163","doi-asserted-by":"crossref","unstructured":"L.\u00a0Zou, J.\u00a0Mo, L.\u00a0Chen, M.T. \u00d6zsu, D.\u00a0Zhao, gStore: answering SPARQL queries via subgraph matching, in VLDB (2011)","DOI":"10.14778\/2002974.2002976"}],"container-title":["Handbook of Big Data Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49340-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,24]],"date-time":"2022-07-24T20:16:00Z","timestamp":1658693760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49340-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319493398","9783319493404"],"references-count":163,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49340-4_16","relation":{},"subject":[],"published":{"date-parts":[[2017]]}}}