iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1007/978-3-642-41335-3_30
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:11:44Z","timestamp":1725732704378},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-41335-3_30","type":"book-chapter","created":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T12:14:14Z","timestamp":1381839254000},"page":"478-493","source":"Crossref","is-referenced-by-count":2,"title":["Personalized Best Answer Computation in Graph Databases"],"prefix":"10.1007","author":[{"given":"Michael","family":"Ovelg\u00f6nne","sequence":"first","affiliation":[]},{"given":"Noseong","family":"Park","sequence":"additional","affiliation":[]},{"given":"V. S.","family":"Subrahmanian","sequence":"additional","affiliation":[]},{"given":"Elizabeth K.","family":"Bowman","sequence":"additional","affiliation":[]},{"given":"Kirk A.","family":"Ogaard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Apache Software Foundation: Apache Jena, http:\/\/jena.apache.org"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Br\u00f6cheler, M., Pugliese, A., Subrahmanian, V.S.: Probabilistic subgraph matching on huge social networks. In: 2011 International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 271\u2013278 (2011)","DOI":"10.1109\/ASONAM.2011.78"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-04930-9_7","volume-title":"The Semantic Web - ISWC 2009","author":"M. Br\u00f6cheler","year":"2009","unstructured":"Br\u00f6cheler, M., Pugliese, A., Subrahmanian, V.S.: DOGMA: A disk-oriented graph matching algorithm for RDF databases. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol.\u00a05823, pp. 97\u2013113. Springer, Heidelberg (2009)"},{"issue":"10","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L. Cordella","year":"2004","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a026(10), 1367\u20131372 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., V.K.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing\u00a020(1), 359\u2013392 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Gallagher, B.: Matching structure and semantics: A survey on graph-based pattern matching. In: 2006 AAAI Fall Symposium on Capturing and Using Patterns for Evidence Detection, pp. 45\u201353 (2006)","DOI":"10.2172\/895418"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multi-level algorithm for partitioning graphs. In: Proceedings of the 1995 ACM\/IEEE Conference on Supercomputing, p. 28 (1995)","DOI":"10.1145\/224170.224228"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/11581116_19","volume-title":"Web Information Systems Engineering \u2013 WISE 2005 Workshops","author":"A. Kiryakov","year":"2005","unstructured":"Kiryakov, A., Ognyanov, D., Manov, D.: OWLIM - a pragmatic semantic repository for OWL. In: Dean, M., Guo, Y., Jun, W., Kaschek, R., Krishnaswamy, S., Pan, Z., Sheng, Q.Z. (eds.) WISE 2005 Workshops. LNCS, vol.\u00a03807, pp. 182\u2013192. Springer, Heidelberg (2005)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-35176-1_22","volume-title":"The Semantic Web \u2013 ISWC 2012","author":"S. Magliacane","year":"2012","unstructured":"Magliacane, S., Bozzon, A., Della Valle, E.: Efficient execution of top-k sparql queries. In: Cudr\u00e9-Mauroux, P., Heflin, J., Sirin, E., Tudorache, T., Euzenat, J., Hauswirth, M., Parreira, J.X., Hendler, J., Schreiber, G., Bernstein, A., Blomqvist, E. (eds.) ISWC 2012, Part I. LNCS, vol.\u00a07649, pp. 344\u2013360. Springer, Heidelberg (2012)"},{"issue":"1","key":"30_CR10","doi-asserted-by":"crossref","first-page":"647","DOI":"10.14778\/1453856.1453927","volume":"1","author":"T. Neumann","year":"2008","unstructured":"Neumann, T., Weikum, G.: Rdf-3x: a risc-style engine for rdf. Proc. VLDB Endow.\u00a01(1), 647\u2013659 (2008)","journal-title":"Proc. VLDB Endow."},{"issue":"12-13","key":"30_CR11","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C. Solnon","year":"2010","unstructured":"Solnon, C.: All different-based filtering for subgraph isomorphism. Artificial Intelligence\u00a0174(12-13), 850\u2013864 (2010)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"30_CR12","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"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T. Washio","year":"2003","unstructured":"Washio, T., Motoda, H.: State of the art of graph-based data mining. SIGKDD Exploration Newsletter\u00a05(1), 59\u201368 (2003)","journal-title":"SIGKDD Exploration Newsletter"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: Gaddi: distance index based subgraph matching in biological networks. In: Proceedings of the 12th International Conference on Extending Database Technology, EDBT 2009, pp. 192\u2013203. ACM (2009)","DOI":"10.1145\/1516360.1516384"},{"issue":"1-2","key":"30_CR15","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.14778\/1920841.1920988","volume":"3","author":"S. Zhang","year":"2010","unstructured":"Zhang, S., Yang, J., Jin, W.: Sapper: subgraph indexing and approximate matching in large graphs. Proc. VLDB Endow.\u00a03(1-2), 1185\u20131194 (2010)","journal-title":"Proc. VLDB Endow."},{"issue":"8","key":"30_CR16","doi-asserted-by":"crossref","first-page":"482","DOI":"10.14778\/2002974.2002976","volume":"4","author":"L. Zou","year":"2011","unstructured":"Zou, L., Mo, J., Chen, L., \u00d6zsu, M.T., Zhao, D.: gStore: answering SPARQL queries via subgraph matching. Proc. VLDB Endow.\u00a04(8), 482\u2013493 (2011)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41335-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T17:31:40Z","timestamp":1564507900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41335-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41335-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}