{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:40:10Z","timestamp":1746348010611,"version":"3.40.4"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319100722"},{"type":"electronic","value":"9783319100739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10073-9_40","type":"book-chapter","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T03:15:36Z","timestamp":1408504536000},"page":"462-476","source":"Crossref","is-referenced-by-count":0,"title":["Digraph Containment Query Is Like Peeling Onions"],"prefix":"10.1007","author":[{"given":"Jianhua","family":"Lu","sequence":"first","affiliation":[]},{"given":"Ningyun","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Yelei","family":"Xi","sequence":"additional","affiliation":[]},{"given":"Baili","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and Applications of Tree and Graph Searching. In: Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 39\u201352 (June 2002)","key":"40_CR1","DOI":"10.1145\/543619.543620"},{"doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph Indexing: A Frequent Structure Based Approach. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD), pp. 335\u2013346 (June 2004)","key":"40_CR2","DOI":"10.1145\/1007568.1007607"},{"issue":"4","key":"40_CR3","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/1114244.1114248","volume":"30","author":"X. Yan","year":"2005","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph Indexing Based on Discriminative Frequent Structure Analysis. ACM Transactions on Database Systems (TODS)\u00a030(4), 960\u2013993 (2005)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W., et al.: FG-Index: Towards Verification Free Query Processing on Graph Databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 857\u2013872 (June 2007)","key":"40_CR4","DOI":"10.1145\/1247480.1247574"},{"doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: Treepi: A Novel Graph Indexing Method. In: Proceedings of the 23rd International Conference on Data Engineering (ICDE), pp. 966\u2013975 (April 2007)","key":"40_CR5","DOI":"10.1109\/ICDE.2007.368955"},{"unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph Indexing: Tree + Delta >\u2009= Graph. In: Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB), pp. 938\u2013949 (September 2007)","key":"40_CR6"},{"doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, H., Yu, P.S., et al.: Gstring: A Novel Approach for Efficient Search in Graph Databases. In: Proceedings of the 23nd International Conference on Data Engineering (ICDE), pp. 566\u2013575 (April 2007)","key":"40_CR7","DOI":"10.1109\/ICDE.2007.367902"},{"unstructured":"He, H., Singh, A.K.: Closure-tree: An Index Structure for Graph Queries. In: Proceedings of the 22nd International Conference on Data Engineering (ICDE), pp. 38\u201347 (April 2006)","key":"40_CR8"},{"doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: Proceedings of the 11th International Conference on Extending Database Technology (EDBT), pp. 181\u2013192 (March 2008)","key":"40_CR9","DOI":"10.1145\/1353343.1353369"},{"doi-asserted-by":"crossref","unstructured":"Han, W.S., Lee, J., Pham, M.D., et al.: iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques. In: Proceedings of the 36rd International Conference on Very Large Data Bases (VLDB), pp. 449\u2013559 (September 2010)","key":"40_CR10","DOI":"10.14778\/1920841.1920901"},{"doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM), pp. 549\u2013552 (2003)","key":"40_CR11","DOI":"10.1109\/ICDM.2003.1250974"},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2071379.2071382","volume":"8","author":"B. Haeupler","year":"2012","unstructured":"Haeupler, B., Kavitha, T., Mathew, R., Sen, S., Tarjan, R.E.: Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. ACM Transactions on Algorithms\u00a08(1), 3 (2012)","journal-title":"ACM Transactions on Algorithms"},{"unstructured":"Corman, T.H., Leiserson, C.E., Rivest, R.L., et al.: Introduction to Algorithms. The MIT Press (2001)","key":"40_CR13"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10073-9_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:27:31Z","timestamp":1746347251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10073-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319100722","9783319100739"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10073-9_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}