{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T10:34:41Z","timestamp":1725964481108},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169335"},{"type":"electronic","value":"9783642169342"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16934-2_28","type":"book-chapter","created":{"date-parts":[[2010,11,5]],"date-time":"2010-11-05T14:15:39Z","timestamp":1288966539000},"page":"402-409","source":"Crossref","is-referenced-by-count":27,"title":["Efficient and Accurate Retrieval of Business Process Models through Indexing"],"prefix":"10.1007","author":[{"given":"Tao","family":"Jin","sequence":"first","affiliation":[]},{"given":"Jianmin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Nianhua","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Marcello","family":"La Rosa","sequence":"additional","affiliation":[]},{"given":"Arthur H. M.","family":"ter Hofstede","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and Applications of Tree and Graph Searching. In: PODS, pp. 39\u201352 (2002)","DOI":"10.1145\/543613.543620"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph Indexing: A Frequent Structure-based Approach. In: SIGMOD, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: TreePi: A Novel Graph Indexing Method. In: ICDE, pp. 966\u2013975 (2007)","DOI":"10.1109\/ICDE.2007.368955"},{"key":"28_CR4","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, pp. 857\u2013872 (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Williams, D.W., Huan, J., Wang, W.: Graph Database Indexing Using Structured Graph Decomposition. In: ICDE, pp. 976\u2013985 (2007)","DOI":"10.1109\/ICDE.2007.368956"},{"key":"28_CR6","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph Indexing: Tree + Delta >\u2009= Graph. In: VLDB, pp. 938\u2013949 (2007)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-78568-2_13","volume-title":"Database Systems for Advanced Applications","author":"L. Zou","year":"2008","unstructured":"Zou, L., Chen, L., Zhang, H., Lu, Y., Lou, Q.: Summarization Graph Indexing: Beyond Frequent Structure-Based Approach. In: Haritsa, J.R., Kotagiri, R., Pudi, V. (eds.) DASFAA 2008. LNCS, vol.\u00a04947, pp. 141\u2013155. Springer, Heidelberg (2008)"},{"issue":"1","key":"28_CR8","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\u00a023(1), 31\u201342 (1976)","journal-title":"Journal of the ACM"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-00899-3_3","volume":"2","author":"N. Lohmann","year":"2009","unstructured":"Lohmann, N., Verbeek, E., Dijkman, R.M.: Petri Net Transformations for Business Processes - A Survey. Transactions on Petri Nets and Other Models of Concurrency\u00a02, 46\u201363 (2009)","journal-title":"Transactions on Petri Nets and Other Models of Concurrency"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Jin, T., Wang, J., Wu, N., La Rosa, M., ter Hofstede, A.H.M.: Efficient and accurate retrieval of business process models through indexing. Technical report, Tsinghua University (2010)","DOI":"10.1007\/978-3-642-16934-2_28"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-44895-0_23","volume-title":"Business Process Management","author":"P. Chrzastowski-Wachtel","year":"2003","unstructured":"Chrzastowski-Wachtel, P., Benatallah, B., Hamadi, R., O\u2019Dell, M., Susanto, A.: A Top-Down Petri Net-Based Approach for Dynamic Workflow Modeling. In: van der Aalst, W.M.P., ter Hofstede, A.H.M., Weske, M. (eds.) BPM 2003. LNCS, vol.\u00a02678, pp. 336\u2013353. Springer, Heidelberg (2003)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-30204-9_21","volume-title":"Advances in Databases and Information Systems","author":"M. Momotko","year":"2004","unstructured":"Momotko, M., Subieta, K.: Process Query Language: A Way to Make Workflow Processes More Flexible. In: Bencz\u00far, A.A., Demetrovics, J., Gottlob, G. (eds.) ADBIS 2004. LNCS, vol.\u00a03255, pp. 306\u2013321. Springer, Heidelberg (2004)"},{"key":"28_CR13","unstructured":"Awad, A.: BPMN-Q: A Language to Query Business Processes. In: EMISA, pp. 115\u2013128 (2007)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Di Francescomarino, C., Tonella, P.: Crosscutting Concern Documentation by Visual Query of Business Processes. In: Business Process Management Workshops, pp. 18\u201331 (2008)","DOI":"10.1007\/978-3-642-00328-8_3"},{"key":"28_CR15","unstructured":"Hornung, T., Koschmider, A., Oberweis, A.: A Recommender System for Business Process Models. In: Proceedings of the 17th Workshop on Information Technologies and Systems (2007)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Mahleko, B., Wombacher, A.: Indexing business processes based on annotated finite state automata. In: ICWS, pp. 303\u2013311 (2006)","DOI":"10.1109\/ICWS.2006.74"}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems: OTM 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16934-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T02:58:58Z","timestamp":1559789938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16934-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169335","9783642169342"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16934-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}