{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:04:36Z","timestamp":1725530676982},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642011115"},{"type":"electronic","value":"9783642011122"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-01112-2_39","type":"book-chapter","created":{"date-parts":[[2009,4,16]],"date-time":"2009-04-16T07:00:58Z","timestamp":1239865258000},"page":"379-392","source":"Crossref","is-referenced-by-count":3,"title":["Storing and Querying Graph Data Using Efficient Relational Processing Techniques"],"prefix":"10.1007","author":[{"given":"Sherif","family":"Sakr","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"DBLP XML Records, \n \n http:\/\/dblp.uni-trier.de\/xml\/"},{"key":"39_CR2","unstructured":"Aboulnaga, A., Alameldeen, A., Naughton, J.: Estimating the Selectivity of XML Path Expressions for Internet Scale Applications. In: VLDB (2001)"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Zhang, S., et al.: TreePi: A Novel Graph Indexing Method. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.368955"},{"key":"39_CR4","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":"39_CR5","doi-asserted-by":"crossref","unstructured":"Huan, J., et al.: Mining protein family specific residue packing patterns from protein structure graphs. In: Computational Molecular Biology (2004)","DOI":"10.1145\/974614.974655"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Yoshikawa, M., et al.: XRel: a path-based approach to storage and retrieval of XML documents using relational databases. TOIT\u00a01(1) (2001)","DOI":"10.1145\/383034.383038"},{"key":"39_CR7","unstructured":"Zhao, P., et al.: Graph indexing: tree + delta = graph. In: VLDB (2007)"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, S., et al.: Scientific formats for object-relational database systems: a study of suitability and performance. SIGMOD Record\u00a035(2) (2006)","DOI":"10.1145\/1147376.1147378"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Botea, V., et al.: PIST: An Efficient and Practical Indexing Technique for Historical Spatio-Temporal Point Data. GeoInformatica\u00a012(2) (2008)","DOI":"10.1007\/s10707-007-0030-3"},{"key":"39_CR10","unstructured":"Giugno, R., Shasha, D.: GraphGrep: A Fast and Universal Method for Querying Graphs. In: International Conference in Pattern recognition (2002)"},{"key":"39_CR11","unstructured":"Graefe, G.: Sorting And Indexing With Partitioned B-Trees. In: CIDR (2003)"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Grust, T., Rittinger, J., Teubner, J.: Why Off-The-Shelf RDBMSs are Better at XPath Than You Might Expect. In: SIGMOD (2007)","DOI":"10.1145\/1247480.1247591"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Grust, T., Sakr, S., Teubner, J.: XQuery on SQL Hosts. In: VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50025-5"},{"key":"39_CR14","unstructured":"Klinger, S., Austin, J.: Chemical similarity searching using a neural graph matcher. In: European Symposium on Artificial Neural Networks (2005)"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P., Han, J.: Graph indexing: a frequent structure-based approach. In: SIGMOD (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"39_CR16","unstructured":"Zhang, N., \u00d6zsu, T., Ilyas, I., Aboulnaga, A.: FIX: Feature-based Indexing Technique for XML Documents. In: VLDB (2006)"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Xu Yu, J., Lu, Y.: GString: A novel spectral coding in a large graph database. In: EDBT (2008)","DOI":"10.1145\/1352431.1352457"}],"container-title":["Lecture Notes in Business Information Processing","Information Systems: Modeling, Development, and Integration"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01112-2_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T18:31:12Z","timestamp":1558377072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01112-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642011115","9783642011122"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01112-2_39","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2009]]}}}