{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:05:38Z","timestamp":1726056338985},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030337513"},{"type":"electronic","value":"9783030337520"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-33752-0_15","type":"book-chapter","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T21:01:49Z","timestamp":1572037309000},"page":"204-221","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Comparison of Approaches for Querying Chemical Compounds"],"prefix":"10.1007","author":[{"given":"Vojt\u011bch","family":"\u0160\u00edpek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irena","family":"Holubov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Svoboda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,23]]},"reference":[{"key":"15_CR1","unstructured":"AMBIT, 19 May 2017. \n                      http:\/\/ambit.sourceforge.net\/"},{"key":"15_CR2","unstructured":"ChEMBL, 2 May 2019. \n                      https:\/\/www.ebi.ac.uk\/chembl\/"},{"key":"15_CR3","unstructured":"Neo4j database, 19 May 2017. \n                      https:\/\/neo4j.com\/"},{"key":"15_CR4","unstructured":"SMILES, 2 May 2019. \n                      http:\/\/www.daylight.com\/dayhtml\/doc\/theory\/theory.smiles.html"},{"key":"15_CR5","unstructured":"The Chemistry Development Kit, 19 May 2017. \n                      https:\/\/github.com\/cdk\/"},{"issue":"12","key":"15_CR6","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1021\/ci200413e","volume":"51","author":"DK Agrafiotis","year":"2011","unstructured":"Agrafiotis, D.K., et al.: Efficient substructure searching of large chemical libraries: the ABCD chemical cartridge. J. Chem. Inf. Model. 51(12), 3113\u20133130 (2011)","journal-title":"J. Chem. Inf. Model."},{"key":"15_CR7","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-319-53480-0_25","volume-title":"Intelligent Systems Design and Applications","author":"M Azaouzi","year":"2017","unstructured":"Azaouzi, M., Ben Romdhane, L.: A minimal rare substructures-based model for graph database indexing. In: Madureira, A.M., Abraham, A., Gamboa, D., Novais, P. (eds.) ISDA 2016. AISC, vol. 557, pp. 250\u2013259. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-53480-0_25"},{"key":"15_CR8","unstructured":"Bauer, U.: Minimum cycle basis algorithms for the chemistry development toolkit (2004)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-16001-1_17","volume-title":"Pattern Recognition in Bioinformatics","author":"V Bonnici","year":"2010","unstructured":"Bonnici, V., Ferro, A., Giugno, R., Pulvirenti, A., Shasha, D.: Enhancing graph database indexing by suffix tree structure. In: Dijkstra, T.M.H., Tsivtsivadze, E., Marchiori, E., Heskes, T. (eds.) PRIB 2010. LNCS, vol. 6282, pp. 195\u2013203. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16001-1_17"},{"issue":"10","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: 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":"15_CR11","doi-asserted-by":"crossref","unstructured":"Dongoran, E.S.S., Saleh, W.K.R., Gozali, A.A.: Analysis and implementation of graph indexing for graph database using GraphGrep algorithm. In: ICoICT 2015, pp. 59\u201364 (2015)","DOI":"10.1109\/ICoICT.2015.7231397"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1186\/1758-2946-4-13","volume":"4","author":"H-C Ehrlich","year":"2012","unstructured":"Ehrlich, H.-C., Rarey, M.: Systematic benchmark of substructure search in molecular graphs - from Ullmann to VF2. J. Cheminform. 4(1), 13 (2012)","journal-title":"J. Cheminform."},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1021\/ci8003013","volume":"49","author":"A Golovin","year":"2009","unstructured":"Golovin, A., Henrick, K.: Chemical substructure search in SQL. J. Chem. Inf. Model. 49(1), 22\u201327 (2009)","journal-title":"J. Chem. Inf. Model."},{"key":"15_CR14","unstructured":"He, H., Singh, A.K.: Closure-tree: an index structure for graph queries. In: ICDE 2006, p. 38 (2006)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: 2008 ACM SIGMOD, pp. 405\u2013418. ACM, New York (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Hoksza, D., Jel\u00ednek, J.: Using Neo4j for mining protein graphs: a case study. In: DEXA 2015, pp. 230\u2013234, September 2015","DOI":"10.1109\/DEXA.2015.59"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, H., Yu, P.S., Zhou, S.: GString: a novel approach for efficient search in graph databases. In: ICDE 2007, pp. 566\u2013575 (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Am. Math. Soc."},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.14778\/2535568.2448946","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee, J., Han, W.-S., Kasperovics, R., Lee, J.-H.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. VLDB Endow. 6(2), 133\u2013144 (2012)","journal-title":"VLDB Endow."},{"key":"15_CR20","unstructured":"May, J.: Substructure search face-off: are the slowest queries the same between tools? NextMove Software (2015), 19 May 2017"},{"key":"15_CR21","unstructured":"Microsoft: Windows Subsystem for Linux Documentation, 25 April 2019. \n                      https:\/\/docs.microsoft.com\/en-us\/windows\/wsl\/about"},{"key":"15_CR22","unstructured":"Oracle: An Introduction to Graph: Database, Analytics, and Cloud Services, 25 April 2019. \n                      https:\/\/www.slideshare.net\/JeanIhm\/an-introduction-to-graph-database-analytics-and-cloud-services"},{"key":"15_CR23","unstructured":"Oracle: Parallel Graph AnalytiX (PGX), 25 April 2019"},{"key":"15_CR24","unstructured":"Oracle: PGQL - Property Graph Query Language, 25 April 2019"},{"issue":"1","key":"15_CR25","doi-asserted-by":"publisher","first-page":"364","DOI":"10.14778\/1453856.1453899","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. VLDB Endow. 1(1), 364\u2013375 (2008)","journal-title":"VLDB Endow."},{"issue":"1","key":"15_CR26","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"15_CR27","unstructured":"Vajda, K.: JChem Cartridge for Oracle. ChemAxon Ltd. (2015), 19 May 2017"},{"key":"15_CR28","unstructured":"\u0160\u00edpek, V.: Comparison of approaches for querying of chemical compounds. Master thesis, Charles University, Prague, Czech Republic (2019). \n                      http:\/\/www.ksi.mff.cuni.cz\/~holubova\/dp\/Sipek.pdf"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Williams, D.W., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE 2007, pp. 976\u2013985 (2007)","DOI":"10.1109\/ICDE.2007.368956"},{"key":"15_CR30","unstructured":"Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: ICDM 2002, pp. 721\u2013724 (2002)"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: 2004 ACM SIGMOD, pp. 335\u2013346. ACM, New York (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"15_CR32","unstructured":"Zaharevitz, D.: AIDS Antiviral Screen Data. NIH\/NCI (2015), 19 May 2017"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: GADDI: distance index based subgraph matching in biological networks. In: EDBT 2009, pp. 192\u2013203. ACM, New York (2009)","DOI":"10.1145\/1516360.1516384"},{"issue":"1\u20132","key":"15_CR34","doi-asserted-by":"publisher","first-page":"340","DOI":"10.14778\/1920841.1920887","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. VLDB Endow. 3(1\u20132), 340\u2013351 (2010)","journal-title":"VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Heterogeneous Data Management, Polystores, and Analytics for Healthcare"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33752-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T21:10:16Z","timestamp":1572037816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33752-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030337513","9783030337520"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33752-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DMAH","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"VLDB Workshop on Data Management and Analytics for Medicine and Healthcare","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dmah2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/site\/vldbdmah2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}