{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:03Z","timestamp":1742914083576,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642290374"},{"type":"electronic","value":"9783642290381"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29038-1_5","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T07:57:38Z","timestamp":1333612658000},"page":"33-47","source":"Crossref","is-referenced-by-count":10,"title":["A Relational-Based Approach for Aggregated Search in Graph Databases"],"prefix":"10.1007","author":[{"given":"Thanh-Huy","family":"Le","sequence":"first","affiliation":[]},{"given":"Haytham","family":"Elghazel","sequence":"additional","affiliation":[]},{"given":"Mohand-Sa\u00edd","family":"Hacid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/s00778-003-0113-1","volume":"14","author":"A. Balmin","year":"2005","unstructured":"Balmin, A., Papakonstantinou, Y.: Storing and querying xml data using denormalized relational databases. The VLDB Journal\u00a014(1), 30\u201349 (2005)","journal-title":"The VLDB Journal"},{"key":"5_CR2","unstructured":"Bonstrom, V., Hinze, A., Schweppe, H.: Storing rdf as a graph"},{"key":"5_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11564126_44","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"D. Cai","year":"2005","unstructured":"Cai, D., Shao, Z., He, X., Yan, X., Han, J.: Community Mining from Multi-Relational Networks. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 445\u2013452. Springer, Heidelberg (2005)"},{"key":"5_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: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 857\u2013872 (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"5_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/11875604_38","volume-title":"Foundations of Intelligent Systems","author":"F. Dau","year":"2006","unstructured":"Dau, F.: RDF as Graph-Based, Diagrammatic Logic. In: Esposito, F., Ra\u015b, Z.W., Malerba, D., Semeraro, G. (eds.) ISMIS 2006. LNCS (LNAI), vol.\u00a04203, pp. 332\u2013337. Springer, Heidelberg (2006)"},{"key":"5_CR6","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-20844-7_10","volume-title":"Graph-Based Representations in Pattern Recognition","author":"H. Elghazel","year":"2011","unstructured":"Elghazel, H., Hacid, M.-S.: Aggregated Search in Graph Databases: Preliminary Results. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS (LNAI), vol.\u00a06658, pp. 92\u2013101. Springer, Heidelberg (2011)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Giugno, R., Shasha, D.: Graphgrep: A fast and universal method for querying graphs. In: Proceedings of the International Conference on Pattern Recognition, pp. 112\u2013115 (2002)","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"5_CR8","unstructured":"Kopliku, A., Pinel-Sauvagnat, K., Boughanem, M.: Aggregated search: potential, issues and evaluation. Technical Report RT2009-4FR, IRIT (2009), http:\/\/www.irit.fr\/PERSONNEL\/SIG\/kopliku\/"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TSMCB.2005.846635","volume":"35","author":"M. Neuhaus","year":"2005","unstructured":"Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Transactions on Systems, Man, and Cybernetics, Part B\u00a035(3), 503\u2013514 (2005)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"M. Neuhaus","year":"2007","unstructured":"Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Information Sciences\u00a0177(1), 239\u2013247 (2007)","journal-title":"Information Sciences"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1109\/69.599932","volume":"9","author":"E.G.M. Petrakis","year":"1997","unstructured":"Petrakis, E.G.M., Faloutsos, C.: Similarity searching in medical image databases. IEEE Transactions on Knowledge and Data Engineering\u00a09(3), 435\u2013447 (1997)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1093\/comjnl\/45.6.631","volume":"45","author":"J.W. Raymond","year":"2002","unstructured":"Raymond, J.W., Gardiner, E.J., Willett, P.: Calculation of graph similarity using maximum common edge subgraphs. The Computer Journal\u00a045, 631\u2013644 (2002)","journal-title":"The Computer Journal"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Riesen, K., Jiang, X., Bunke, H.: Exact and inexact graph matching: Methodology and applications. In: Aggarwal, C.C., Wang, H. (eds.) Managing and Mining Graph Data, pp. 217\u2013247. Springer, US (2010)","DOI":"10.1007\/978-1-4419-6045-0_7"},{"key":"5_CR14","series-title":"LNBIP","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-642-01112-2_39","volume-title":"Information Systems: Modeling, Development, and Integration","author":"S. Sakr","year":"2009","unstructured":"Sakr, S.: Storing and Querying Graph Data using Efficient Relational Processing Techniques. In: Yang, J., Ginige, A., Mayr, H.C., Kutsche, R.-D. (eds.) Information Systems: Modeling, Development, and Integration. LNBIP, vol.\u00a020, pp. 379\u2013392. Springer, Heidelberg (2009)"},{"issue":"6","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1007\/s11390-010-9402-5","volume":"25","author":"S. Sakr","year":"2010","unstructured":"Sakr, S., Al-Naymat, G.: Efficient relational techniques for processing graph queries. Journal of Computer Science and Technology\u00a025(6), 1237\u20131255 (2010)","journal-title":"Journal of Computer Science and Technology"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1145\/1772690.1772906","volume-title":"Proceedings of the 19th International Conference on World Wide Web (WWW)","author":"S. Sakr","year":"2010","unstructured":"Sakr, S., Awad, A.: A framework for querying graph-based business process models. In: Proceedings of the 19th International Conference on World Wide Web (WWW), pp. 1297\u20131300. ACM, New York (2010)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In: Proceedings of the International Conference on Very Large Data Bases, pp. 364\u2013375 (2008)","DOI":"10.14778\/1453856.1453899"},{"key":"5_CR18","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 Twenty-First ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 39\u201352 (2002)","DOI":"10.1145\/543613.543620"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Tatarinov, I., Viglas, S.D., Beyer, K., Shanmugasundaram, J., Shekita, E., Zhang, C.: Storing and querying ordered xml using a relational database system. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pp. 204\u2013215 (2002)","DOI":"10.1145\/564712.564715"},{"issue":"1","key":"5_CR20","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 ACM\u00a023(1), 31\u201342 (1976)","journal-title":"Journal of ACM"},{"issue":"6","key":"5_CR21","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1021\/ci9800211","volume":"38","author":"P. Willett","year":"1998","unstructured":"Willett, P., Barnard, J.M., Downs, G.M.: Chemical similarity searching. Journal of Chemical Information and Computer Sciences\u00a038(6), 983\u2013996 (1998)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"5_CR22","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, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 766\u2013777 (2005)","DOI":"10.1145\/1066157.1066244"},{"issue":"1","key":"5_CR24","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1089\/cmb.2006.0076","volume":"14","author":"Q. Yang","year":"2007","unstructured":"Yang, Q., Sze, S.-H.: Path matching and graph matching in biological networks. Journal of Computational Biology\u00a014(1), 56\u201367 (2007)","journal-title":"Journal of Computational Biology"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: Proceedings of the International Conference on Data Engineering, pp. 966\u2013975 (2007)","DOI":"10.1109\/ICDE.2007.368955"},{"key":"5_CR26","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: Tree + delta >= graph. In: Proceedings of the International Conference on Very Large Data Bases, pp. 938\u2013949 (2007)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29038-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:09:32Z","timestamp":1742911772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29038-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290374","9783642290381"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29038-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}