{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,5]],"date-time":"2026-09-05T15:32:40Z","timestamp":1788622360871,"version":"build-2803163510"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,9,15]],"date-time":"2012-09-15T00:00:00Z","timestamp":1347667200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s00778-012-0284-8","type":"journal-article","created":{"date-parts":[[2012,9,15]],"date-time":"2012-09-15T02:31:59Z","timestamp":1347676319000},"page":"229-252","source":"Crossref","is-referenced-by-count":25,"title":["Lindex: a lattice-based index for graph databases"],"prefix":"10.1007","volume":"22","author":[{"given":"Dayu","family":"Yuan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prasenjit","family":"Mitra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,9,15]]},"reference":[{"key":"284_CR1","first-page":"532","volume":"33","author":"J. Barnard","year":"1993","unstructured":"Barnard J.: Substructure searching methods: old and new. J. CIM 33, 532\u2013538 (1993)","journal-title":"J. CIM"},{"key":"284_CR2","unstructured":"Chen, C., Yan, X., Yu, P.S., Han, J., Zhang, D.Q., Gu, X.: Towards graph containment search and indexing. In: VLDB. VLDB Endowment (2007)"},{"key":"284_CR3","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00778-010-0212-8","volume":"20","author":"J. Cheng","year":"2011","unstructured":"Cheng J., Ke Y., Fu A.W.C., Yu J.X.: Fast graph query processing with a low-cost index. VLDB J. 20, 521\u2013539 (2011)","journal-title":"VLDB J."},{"key":"284_CR4","doi-asserted-by":"crossref","first-page":"2:1","DOI":"10.1145\/1508857.1508859","volume":"34","author":"J. Cheng","year":"2009","unstructured":"Cheng J., Ke Y., Ng W.: Efficient query processing on graph databases. ACM Trans. Database Syst. 34, 2:1\u20132:48 (2009)","journal-title":"ACM Trans. Database Syst."},{"key":"284_CR5","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 (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"284_CR6","doi-asserted-by":"crossref","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Graph matching applications in pattern recognition and image processing. In: ICIP (2003)","DOI":"10.1109\/ICIP.2003.1246606"},{"key":"284_CR7","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"1","key":"284_CR8","first-page":"83","volume":"35","author":"M. El-Mehalawi","year":"2003","unstructured":"El-Mehalawi M., Miller R.A.: A database system of mechanical components based on geometric and topological similarity. J. CAD 35(1), 83\u201394 (2003)","journal-title":"J. CAD"},{"key":"284_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.14778\/1920841.1920901","volume":"3","author":"W.S. Han","year":"2010","unstructured":"Han W.S., Lee J., Pham M.D., Yu J.X.: igraph: a framework for comparisons of disk-based graph indexing techniques. Proceedings of the VLDB Endowment 3, 449\u2013459 (2010)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"284_CR10","unstructured":"He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE, p. 38 (2006)"},{"key":"284_CR11","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, H., Yu, P., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: ICDE, pp. 566\u2013575 (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"key":"284_CR12","unstructured":"Leach, A.R., Gillet, V.J.: Substructure searching. In: An introduction to chemoinformatics, pp. 10\u201312"},{"key":"284_CR13","doi-asserted-by":"crossref","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)","DOI":"10.14778\/1453856.1453899"},{"key":"284_CR14","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS (2002)","DOI":"10.1145\/543613.543620"},{"key":"284_CR15","doi-asserted-by":"crossref","unstructured":"Sun, B., Mitra, P., Giles, C.L.: Irredundant informative subgraph mining for graph search on the web. In: CIKM (2009)","DOI":"10.1145\/1645953.1646026"},{"key":"284_CR16","volume-title":"Chemical Graph Theory. Vol. 1, 2","author":"N. Trinajstic","year":"1992","unstructured":"Trinajstic N.: Chemical Graph Theory. Vol. 1, 2. 2nd edn. CRC Press, Boca Raton (1992)","edition":"2"},{"key":"284_CR17","doi-asserted-by":"crossref","unstructured":"Williams, D.W., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.368956"},{"key":"284_CR18","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: ICDM, p. 721 (2002)"},{"key":"284_CR19","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: SIGMOD (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"284_CR20","unstructured":"Yuan, D., Mitra, P.: Lattice-based graph index for subgraph search. In: WebDB (2011)"},{"key":"284_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. ICDE pp. 966\u2013975 (2007)","DOI":"10.1109\/ICDE.2007.368955"},{"key":"284_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, J., Gao, H., Zou, Z.: A novel approach for efficient supergraph query processing on graph databases. In: EDBT, pp. 204\u2013215 (2009)","DOI":"10.1145\/1516360.1516385"},{"key":"284_CR23","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: tree + delta \u2264\u00a0 graph. In: VLDB, pp. 938\u2013949 (2007)"},{"key":"284_CR24","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT, pp. 181\u2013192 (2008)","DOI":"10.1145\/1353343.1353369"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0284-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-012-0284-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0284-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T22:57:39Z","timestamp":1562194659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-012-0284-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,15]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1007\/s00778-012-0284-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,15]]}}}