乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T18:50:36Z","timestamp":1744138236066},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s11704-020-0360-y","type":"journal-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T15:03:11Z","timestamp":1632754991000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["A subgraph matching algorithm based on subgraph index for knowledge graph"],"prefix":"10.1007","volume":"16","author":[{"given":"Yunhao","family":"Sun","sequence":"first","affiliation":[]},{"given":"Guanyu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jingjing","family":"Du","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Ning","sequence":"additional","affiliation":[]},{"given":"Heng","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"issue":"5","key":"360_CR1","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TKDE.2017.2766634","volume":"30","author":"S Hu","year":"2018","unstructured":"Hu S, Zou L, Yu J X, Wang H, Zhao D. Answering natural language questions by subgraph matching over knowledge graphs. IEEE Transactions on Knowledge and Data Engineering, 2018, 30(5): 824\u2013837","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"360_CR2","doi-asserted-by":"crossref","unstructured":"Xu Q, Wang X, Li J, Gan Y, Chai L, Wang J. StarMR: an efficient star-decomposition based query processor for SPARQL basic graph patterns using MapReduce. In: proceedings of Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data. 2018, 415\u2013430","DOI":"10.1007\/978-3-319-96890-2_34"},{"key":"360_CR3","doi-asserted-by":"crossref","unstructured":"Cai T, Li J, Mian A S, Sellis T, Yu J X. Target-aware holistic influence maximization in spatial social networks. IEEE Transactions on Knowledge and Data Engineering, 2020","DOI":"10.1109\/TKDE.2020.3003047"},{"key":"360_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17885-1","volume-title":"Encyclopedia of GIS: Resource Description Framework(RDF)","author":"S Shekhar","year":"2017","unstructured":"Shekhar S, Xiong H, Zhou X. Encyclopedia of GIS: Resource Description Framework(RDF). 1st ed. Cham: Springer International Publishing, 2017","edition":"1st ed."},{"key":"360_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M R Garey","year":"1979","unstructured":"Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1st ed. New York: W. H. Freeman, 1979","edition":"1st ed."},{"issue":"11","key":"360_CR6","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.14778\/2809974.2809985","volume":"8","author":"J Kim","year":"2015","unstructured":"Kim J, Shin H, Han W H, Hong S, Chafi H. Taming subgraph isomorphism for RDF query processing. Proceedings of the VLDB Endowment, 2015, 8(11): 1238\u20131249","journal-title":"Proceedings of the VLDB Endowment"},{"key":"360_CR7","unstructured":"Ingalalli V, Ienco D, Poncelet P, Villata S. Querying RDF data using a multigraph-based approach. In: Proceedings of the 19th International Conference on Extending Database Technology. 2016, 245\u2013256"},{"issue":"10","key":"360_CR8","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.14778\/3339490.3339501","volume":"12","author":"H Ma","year":"2019","unstructured":"Ma H, Langouri M A, Wu Y, Chiang F, Pi J. Ontology-based entity matching in attributed graphs. Proceedings of the VLDB Endowment, 2019, 12(10): 1195\u20131207","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"10","key":"360_CR9","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L P Cordella","year":"2014","unstructured":"Cordella L P, Foggia P, Sansone C, Vento M. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2014, 26(10): 1367\u20131372","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"360_CR10","doi-asserted-by":"crossref","unstructured":"He H, Singh A K. Graphs-at-a-time: query language and accessmethods for graph databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2008, 405\u2013418","DOI":"10.1145\/1376616.1376660"},{"issue":"1","key":"360_CR11","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. Proceedings of the VLDB Endowment, 2010, 3(1): 340\u2013351","journal-title":"Proceedings of the VLDB Endowment"},{"key":"360_CR12","unstructured":"Han W, Lee J, Lee J H. Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2013, 337\u2013348"},{"key":"360_CR13","doi-asserted-by":"crossref","unstructured":"Bi F, Chang L, Lin X, Qin L, Zhang W. Efficient subgraph matching by postponing cartesian products. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2016, 1199\u20131214","DOI":"10.1145\/2882903.2915236"},{"issue":"1","key":"360_CR14","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. Proceedings of the VLDB Endowment, 2008, 1(1): 364\u2013375","journal-title":"Proceedings of the VLDB Endowment"},{"key":"360_CR15","doi-asserted-by":"crossref","unstructured":"Kim K, Seo I, Han W S, Hong S, Chafi H, Shin H, Jeong G. Turboflux: A fast continuous subgraph matching system for streaming graph data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2018, 411\u2013426","DOI":"10.1145\/3183713.3196917"},{"issue":"1","key":"360_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J R Ullmann","year":"1976","unstructured":"Ullmann J R. An algorithm for subgraph isomorphism. Journal of the ACM, 1976, 23(1): 31\u201342","journal-title":"Journal of the ACM"},{"key":"360_CR17","doi-asserted-by":"crossref","unstructured":"Jin X, Lai L. MPMatch: A Multi-core Parallel Subgraph Matching Algorithm. In: Proceedings of IEEE 35th International Conference on Data Engineering Workshops. 2019, 241\u2013248","DOI":"10.1109\/ICDEW.2019.000-6"},{"key":"360_CR18","doi-asserted-by":"crossref","unstructured":"Bhattarai B, Liu H, Huang H. CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2019, 1447\u20131462","DOI":"10.1145\/3299869.3300086"},{"issue":"5","key":"360_CR19","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1007\/s11704-016-5522-6","volume":"12","author":"P Peng","year":"2017","unstructured":"Peng P, Zou L, Du Z, Zhao D. Using partial evaluation in holistic subgraph search. Frontiers of Computer Science, 2017, 12(5): 966\u2013983","journal-title":"Frontiers of Computer Science"},{"issue":"1","key":"360_CR20","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10707-019-00381-y","volume":"24","author":"Y Ma","year":"2020","unstructured":"Ma Y, Yuan Y, Liu M, Wang G, Wang Y. Graph simulation on large scale temporal graphs. GeoInformatica, 2020, 24(1): 199\u2013220","journal-title":"GeoInformatica"},{"key":"360_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s41019-018-0082-4","volume":"3","author":"P Lin","year":"2018","unstructured":"Lin P, Song Q, Wu Y. Fact checking in knowledge graphs with ontological subgraph patterns. Data Science and Engineering, 2018, 3: 341\u2013358","journal-title":"Data Science and Engineering"},{"key":"360_CR22","doi-asserted-by":"crossref","unstructured":"Xu Y, Tong Y, Shi Y, Tao Q, Xu Ke, Li W. An Efficient Insertion Operator in Dynamic RideSharing Services. In: Proceedings of IEEE 35th International Conference on Data Engineering. 2019, 1022\u20131033","DOI":"10.1109\/ICDE.2019.00095"},{"issue":"4","key":"360_CR23","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00778-013-0337-7","volume":"23","author":"L Zou","year":"2014","unstructured":"Zou L, \u00d6zsu M T, Chen L, Shen X, Huang R, Zhao D. gStore: a graph-based SPARQL query engine. The VLDB Journal, 2014, 23(4): 565\u2013590","journal-title":"The VLDB Journal"},{"issue":"4","key":"360_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-018-7212-z","volume":"12","author":"L Zeng","year":"2018","unstructured":"Zeng L, Zou L. Redesign of the gStore system. Frontiers of Computer science, 2018, 12(4): 1\u201319","journal-title":"Frontiers of Computer science"},{"key":"360_CR25","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s41019-019-0090-z","volume":"4","author":"X Wang","year":"2019","unstructured":"Wang X, Chai Le, Xu Q, Yang Y, Li J, Wang J, Chai Y. Efficient subgraph matching on large RDF graphs using MapReduce. Data Science and Engineering, 2019, 4: 24\u201343","journal-title":"Data Science and Engineering"},{"key":"360_CR26","doi-asserted-by":"publisher","first-page":"116453","DOI":"10.1109\/ACCESS.2019.2936465","volume":"7","author":"Q Xu","year":"2019","unstructured":"Xu Q, Wang X, Li J, Zhang Q, Chai L. Distributed subgraph matching on big knowledge graphs using pregel. IEEE Access, 2019, 7: 116453\u2013116464","journal-title":"IEEE Access"},{"key":"360_CR27","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern M H, Bik, A J C, Dehnert J C. Pregel: A system for large-scale graph processing. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2010, 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"360_CR28","doi-asserted-by":"publisher","first-page":"101522","DOI":"10.1016\/j.is.2020.101522","volume":"92","author":"J Li","year":"2020","unstructured":"Li J, Cai T, Deng K, Wang X, Sellis T, Xia F. Community-diversified influence maximization in social networks. Information Systems, 2020, 92: 101522","journal-title":"Information Systems"},{"issue":"1","key":"360_CR29","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/s12559-019-09680-w","volume":"12","author":"Y Ma","year":"2020","unstructured":"Ma Y, Yuan Y, Wang G, Bi X, Wang Z, Wang Y. Rising star evaluation based on extreme learning machine in geo-social networks. Cognitive Computation, 2020, 12(1): 296\u2013308","journal-title":"Cognitive Computation"},{"key":"360_CR30","doi-asserted-by":"crossref","unstructured":"Wang Y, Tong Y, Long C, Xu P, Xu K, Lv W. Adaptive dynamic bipartite graph matching: a reinforcement learning approach. In: Proceedings of IEEE 35th International Conference on Data Engineering, 2019, 1478\u20131489","DOI":"10.1109\/ICDE.2019.00133"},{"issue":"11","key":"360_CR31","doi-asserted-by":"publisher","first-page":"840","DOI":"10.14778\/2983200.2983201","volume":"9","author":"W Zheng","year":"2016","unstructured":"Zheng W, Zou L, Peng W, Yan X, Song S, Zhao D. Semantic SPARQL similarity search over RDF knowledge graphs. Proceedings of the VLDB Endowment, 2016, 9(11): 840\u2013851","journal-title":"Proceedings of the VLDB Endowment"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-020-0360-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-020-0360-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-020-0360-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T21:04:23Z","timestamp":1689887063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-020-0360-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,27]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["360"],"URL":"https:\/\/doi.org\/10.1007\/s11704-020-0360-y","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,27]]},"assertion":[{"value":"22 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"163606"}}