{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T04:39:43Z","timestamp":1768106383547,"version":"3.49.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T00:00:00Z","timestamp":1489708800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00778-017-0460-y","type":"journal-article","created":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T10:55:10Z","timestamp":1489748110000},"page":"467-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["On efficiently finding reverse k-nearest neighbors over uncertain graphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Yunjun","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoye","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiyong","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,17]]},"reference":[{"key":"460_CR1","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Kanellakis, P., Grahne, G.: On the representation and querying of sets of possible worlds. In: SIGMOD, pp. 34\u201348 (1987)","DOI":"10.1145\/38713.38724"},{"issue":"3\u20134","key":"460_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s00450-007-0027-z","volume":"21","author":"E Achtert","year":"2007","unstructured":"Achtert, E., B\u00f6hm, C., Kr\u00f6ger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse $$k$$ k -nearest neighbor estimation. Informatik-Forschung und Entwicklung 21(3\u20134), 179\u2013195 (2007)","journal-title":"Informatik-Forschung und Entwicklung"},{"issue":"2","key":"460_CR3","first-page":"15","volume":"30","author":"E Adar","year":"2007","unstructured":"Adar, E., R\u00e9, C.: Managing uncertainty in social networks. IEEE Data Eng. Bull. 30(2), 15\u201322 (2007)","journal-title":"IEEE Data Eng. Bull."},{"issue":"6","key":"460_CR4","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1101\/gr.2203804","volume":"14","author":"S Asthana","year":"2004","unstructured":"Asthana, S., King, O.D., Gibbons, F.D., Roth, F.P.: Predicting protein complex membership using probabilistic network reliability. Genome Res. 14(6), 1170\u20131175 (2004)","journal-title":"Genome Res."},{"issue":"10","key":"460_CR5","first-page":"669","volume":"4","author":"T Bernecker","year":"2011","unstructured":"Bernecker, T., Emrich, T., Kriegel, H.P., Renz, M., Zankl, S., Z\u00fcfle, A.: Efficient probabilistic reverse nearest neighbor query processing on uncertain data. PVLDB 4(10), 669\u2013680 (2011)","journal-title":"PVLDB"},{"issue":"4","key":"460_CR6","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/TKDE.2009.108","volume":"22","author":"MA Cheema","year":"2010","unstructured":"Cheema, M.A., Lin, X., Wang, W., Zhang, W., Pei, J.: Probabilistic reverse nearest neighbor queries on uncertain data. IEEE Trans. Knowl. Data Eng. 22(4), 550\u2013564 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"460_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00778-011-0235-9","volume":"21","author":"MA Cheema","year":"2012","unstructured":"Cheema, M.A., Zhang, W., Lin, X., Zhang, Y., Li, X.: Continuous reverse $$k$$ k nearest neighbors queries in Euclidean space and in spatial networks. VLDB J. 21(1), 69\u201395 (2012)","journal-title":"VLDB J."},{"issue":"8","key":"460_CR8","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1109\/TKDE.2010.67","volume":"22","author":"L Chen","year":"2010","unstructured":"Chen, L., Wang, C.: Continuous subgraph pattern search over certain and uncertain graph streams. IEEE Trans. Knowl. Data Eng. 22(8), 1093\u20131109 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"460_CR9","first-page":"456","volume":"9","author":"FM Choudhury","year":"2016","unstructured":"Choudhury, F.M., Culpepper, J.S., Sellis, T., Cao, X.: Maximizing bichromatic reverse spatial and textual $$k$$ k nearest neighbor queries. PVLDB 9(6), 456\u2013467 (2016)","journal-title":"PVLDB"},{"key":"460_CR10","doi-asserted-by":"crossref","unstructured":"Emrich, T., Kriegel, H.P., Niedermayer, J., Renz, M., Suhartha, A., Z\u00fcfle, A.: Exploration of Monte-Carlo based probabilistic query processing in uncertain graphs. In: CIKM, pp. 2728\u20132730 (2012)","DOI":"10.1145\/2396761.2398742"},{"key":"460_CR11","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.ins.2015.10.022","volume":"330","author":"Y Gao","year":"2016","unstructured":"Gao, Y., Liu, Q., Miao, X., Yang, J.: Reverse $$k$$ k -nearest neighbor search in the presence of obstacles. Inf. Sci. 330, 274\u2013292 (2016)","journal-title":"Inf. Sci."},{"issue":"9","key":"460_CR12","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1109\/TKDE.2009.113","volume":"21","author":"Y Gao","year":"2009","unstructured":"Gao, Y., Zheng, B., Chen, G., Lee, W.C., Lee, K.C., Li, Q.: Visible reverse $$k$$ k -nearest neighbor query processing in spatial databases. IEEE Trans. Knowl. Data Eng. 21(9), 1314\u20131327 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"460_CR13","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1109\/TKDE.2013.123","volume":"26","author":"Y Gu","year":"2014","unstructured":"Gu, Y., Gao, C., Cong, G., Yu, G.: Effective and efficient clustering methods for correlated probabilistic graphs. IEEE Trans. Knowl. Data Eng. 26(5), 1117\u20131130 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"460_CR14","doi-asserted-by":"crossref","unstructured":"Hung, H.J., Yang, D.N., Lee, W.C.: Social influence-aware reverse nearest neighbor search. In: DSAA, pp. 223\u2013229. IEEE (2014)","DOI":"10.1109\/DSAA.2014.7058077"},{"key":"460_CR15","doi-asserted-by":"crossref","unstructured":"Jin, R., Liu, L., Aggarwal, C.C.: Discovering highly reliable subgraphs in uncertain graphs. In: SIGKDD, pp. 992\u20131000 (2011)","DOI":"10.1145\/2020408.2020569"},{"issue":"9","key":"460_CR16","first-page":"551","volume":"4","author":"R Jin","year":"2011","unstructured":"Jin, R., Liu, L., Ding, B., Wang, H.: Distance-constraint reachability computation in uncertain graphs. PVLDB 4(9), 551\u2013562 (2011)","journal-title":"PVLDB"},{"issue":"2","key":"460_CR17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TKDE.2011.243","volume":"25","author":"G Kollios","year":"2013","unstructured":"Kollios, G., Potamias, M., Terzi, E.: Clustering large probabilistic graphs. IEEE Trans. Knowl. Data Eng. 25(2), 325\u2013336 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"460_CR18","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, pp. 201\u2013212 (2000)","DOI":"10.1145\/342009.335415"},{"issue":"7084","key":"460_CR19","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1038\/nature04670","volume":"440","author":"NJ Krogan","year":"2006","unstructured":"Krogan, N.J., Cagney, G., Yu, H., Zhong, G., Guo, X., Ignatchenko, A., Li, J., Pu, S., Datta, N., Tikuisis, A.P., et al.: Global landscape of protein complexes in the yeast saccharomyces cerevisiae. Nature 440(7084), 637\u2013643 (2006)","journal-title":"Nature"},{"issue":"7","key":"460_CR20","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1109\/TKDE.2008.36","volume":"20","author":"KC Lee","year":"2008","unstructured":"Lee, K.C., Zheng, B., Lee, W.C.: Ranked reverse nearest neighbor search. IEEE Trans. Knowl. Data Eng. 20(7), 894\u2013910 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"460_CR21","doi-asserted-by":"crossref","unstructured":"Levin, R., Kanza, Y.: Stratified-sampling over social networks using mapreduce. In: SIGMOD, pp. 863\u2013874 (2014)","DOI":"10.1145\/2588555.2588577"},{"issue":"8","key":"460_CR22","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1016\/j.is.2010.05.002","volume":"35","author":"G Li","year":"2010","unstructured":"Li, G., Li, Y., Li, J., LihChyun, S., Yang, F.: Continuous reverse $$k$$ k nearest neighbor monitoring on moving objects in road networks. Inf. Syst. 35(8), 860\u2013883 (2010)","journal-title":"Inf. Syst."},{"issue":"6","key":"460_CR23","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s00778-012-0268-8","volume":"21","author":"J Li","year":"2012","unstructured":"Li, J., Zou, Z., Gao, H.: Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. VLDB J. 21(6), 753\u2013777 (2012)","journal-title":"VLDB J."},{"key":"460_CR24","doi-asserted-by":"crossref","unstructured":"Li, R.H., Yu, J.X., Mao, R., Jin, T.: Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling. In: ICDE, pp. 892\u2013903 (2014)","DOI":"10.1109\/ICDE.2014.6816709"},{"issue":"2","key":"460_CR25","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1109\/TKDE.2015.2485212","volume":"28","author":"RH Li","year":"2016","unstructured":"Li, R.H., Yu, J.X., Mao, R., Jin, T.: Recursive stratified sampling: a new framework for query evaluation on uncertain graphs. IEEE Trans. Knowl. Data Eng. 28(2), 468\u2013482 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"460_CR26","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1007\/s00778-008-0123-0","volume":"18","author":"X Lian","year":"2009","unstructured":"Lian, X., Chen, L.: Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data. VLDB J. 18(3), 787\u2013808 (2009)","journal-title":"VLDB J."},{"issue":"5","key":"460_CR27","doi-asserted-by":"crossref","first-page":"1246","DOI":"10.1109\/TKDE.2014.2365791","volume":"27","author":"X Lian","year":"2015","unstructured":"Lian, X., Chen, L., Huang, Z.: Keyword search over probabilistic RDF graphs. IEEE Trans. Knowl. Data Eng. 27(5), 1246\u20131260 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"15","key":"460_CR28","doi-asserted-by":"crossref","first-page":"1891","DOI":"10.1093\/bioinformatics\/btp311","volume":"25","author":"G Liu","year":"2009","unstructured":"Liu, G., Wong, L., Chua, H.N.: Complex discovery from weighted PPI networks. Bioinformatics 25(15), 1891\u20131897 (2009)","journal-title":"Bioinformatics"},{"issue":"1","key":"460_CR29","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11280-012-0200-6","volume":"17","author":"Z Liu","year":"2014","unstructured":"Liu, Z., Wang, C., Wang, J.: Aggregate nearest neighbor queries in uncertain graphs. World Wide Web 17(1), 161\u2013188 (2014)","journal-title":"World Wide Web"},{"key":"460_CR30","unstructured":"Melaniphy, J.C.: The restaurant location guidebook: a comprehensive guide to selecting restaurant & quick service food locations. International Real Estate Location Institute (2007)"},{"key":"460_CR31","doi-asserted-by":"crossref","unstructured":"Moustafa, W.E., Kimmig, A., Deshpande, A., Getoor, L.: Subgraph pattern matching over uncertain graphs with identity linkage uncertainty. In: ICDE, pp. 904\u2013915 (2014)","DOI":"10.1109\/ICDE.2014.6816710"},{"key":"460_CR32","doi-asserted-by":"crossref","unstructured":"Mukherjee, A.P., Xu, P., Tirthapura, S.: Mining maximal cliques from an uncertain graph. In: ICDE, pp. 243\u2013254 (2015)","DOI":"10.1109\/ICDE.2015.7113288"},{"issue":"1","key":"460_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1471-2105-11-505","volume":"11","author":"K Ning","year":"2010","unstructured":"Ning, K., Ng, H.K., Srihari, S., Leong, H.W., Nesvizhskii, A.I.: Examination of the relationship between essential genes in PPI network and hub proteins in reverse nearest neighbor topology. BMC Bioinform. 11(1), 1 (2010)","journal-title":"BMC Bioinform."},{"key":"460_CR34","doi-asserted-by":"crossref","unstructured":"Parchas, P., Gullo, F., Papadias, D., Bonchi, F.: The pursuit of a good possible world: extracting representative instances of uncertain graphs. In: SIGMOD, pp. 967\u2013978 (2014)","DOI":"10.1145\/2588555.2593668"},{"issue":"3","key":"460_CR35","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/2818182","volume":"40","author":"P Parchas","year":"2015","unstructured":"Parchas, P., Gullo, F., Papadias, D., Bonchi, F.: Uncertain graph processing through representative instances. ACM Trans. Database Syst. 40(3), 20 (2015)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"460_CR36","first-page":"997","volume":"3","author":"M Potamias","year":"2010","unstructured":"Potamias, M., Bonchi, F., Gionis, A., Kollios, G.: K-nearest neighbors in uncertain graphs. PVLDB 3(1), 997\u20131008 (2010)","journal-title":"PVLDB"},{"issue":"5","key":"460_CR37","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1109\/TKDE.2014.2365790","volume":"27","author":"M Radovanovic","year":"2015","unstructured":"Radovanovic, M., Nanopoulos, A., Ivanovic, M.: Reverse nearest neighbors in unsupervised distance-based outlier detection. IEEE Trans. Knowl. Data Eng. 27(5), 1369\u20131382 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"460_CR38","unstructured":"Rice, J.: Mathematical statistics and data analysis. Cengage Learning (2006)"},{"issue":"5","key":"460_CR39","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s00530-009-0167-z","volume":"15","author":"M Safar","year":"2009","unstructured":"Safar, M., Ibrahimi, D., Taniar, D.: Voronoi-based reverse nearest neighbor query processing on spatial networks. Multimedia Syst. 15(5), 295\u2013308 (2009)","journal-title":"Multimedia Syst."},{"issue":"5","key":"460_CR40","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1007\/s00778-009-0153-2","volume":"18","author":"P Sen","year":"2009","unstructured":"Sen, P., Deshpande, A., Getoor, L.: PrDB: managing and exploiting rich correlations in probabilistic databases. VLDB J. 18(5), 1065\u20131090 (2009)","journal-title":"VLDB J."},{"key":"460_CR41","unstructured":"Stanoi, I., Agrawal, D., El\u00a0Abbadi, A.: Reverse nearest neighbor queries for dynamic databases. In: SIGMOD, pp. 44\u201353 (2000)"},{"issue":"04","key":"460_CR42","doi-asserted-by":"crossref","first-page":"1450017","DOI":"10.1142\/S0219720014500176","volume":"12","author":"A Suratanee","year":"2014","unstructured":"Suratanee, A., Plaimas, K.: Identification of inflammatory bowel disease-related proteins using a reverse $$k$$ k -nearest neighbor search. J. Bioinf. Comput. Biol. 12(04), 1450017 (2014)","journal-title":"J. Bioinf. Comput. Biol."},{"key":"460_CR43","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Lian, X.: Reverse $$k$$ k NN search in arbitrary dimensionality. In: VLDB, pp. 744\u2013755 (2004)","DOI":"10.1016\/B978-012088469-8.50066-8"},{"issue":"9","key":"460_CR44","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1109\/TKDE.2006.148","volume":"18","author":"Y Tao","year":"2006","unstructured":"Tao, Y., Yiu, M.L., Mamoulis, N.: Reverse nearest neighbor search in metric spaces. IEEE Trans. Knowl. Data Eng. 18(9), 1239\u20131252 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"460_CR45","unstructured":"Wackerly, D., Mendenhall, W., Scheaffer, R.: Mathematical statistics with applications. Nelson Education (2007)"},{"issue":"1","key":"460_CR46","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1093\/comjnl\/bxt115","volume":"58","author":"S Wang","year":"2015","unstructured":"Wang, S., Cheema, M.A., Lin, X.: Efficiently monitoring reverse $$k$$ k -nearest neighbors in spatial networks. Comput. J. 58(1), 40\u201356 (2015)","journal-title":"Comput. J."},{"key":"460_CR47","doi-asserted-by":"crossref","unstructured":"Wang, S., Cheema, M.A., Lin, X., Zhang, Y., Liu, D.: Efficiently computing reverse $$k$$ k furthest neighbors. In: ICDE, pp. 1110\u20131121 (2016)","DOI":"10.1109\/ICDE.2016.7498317"},{"issue":"1","key":"460_CR48","first-page":"1056","volume":"1","author":"W Wu","year":"2008","unstructured":"Wu, W., Yang, F., Chan, C.Y., Tan, K.L.: Finch: Evaluating reverse $$k$$ k -nearest-neighbor queries on location data. PVLDB 1(1), 1056\u20131067 (2008)","journal-title":"PVLDB"},{"key":"460_CR49","doi-asserted-by":"crossref","unstructured":"Xu, C., Gu, Y., Chen, L., Qiao, J., Yu, G.: Interval reverse nearest neighbor queries on uncertain data with markov correlations. In: ICDE, pp. 170\u2013181 (2013)","DOI":"10.1109\/ICDE.2013.6544823"},{"issue":"5","key":"460_CR50","first-page":"605","volume":"8","author":"S Yang","year":"2015","unstructured":"Yang, S., Cheema, M.A., Lin, X., Wang, W.: Reverse $$k$$ k nearest neighbors query processing: experiments and analysis. PVLDB 8(5), 605\u2013616 (2015)","journal-title":"PVLDB"},{"key":"460_CR51","doi-asserted-by":"crossref","unstructured":"Yang, S., Cheema, M.A., Lin, X., Zhang, Y.: Slice: Reviving regions-based pruning for reverse $$k$$ k nearest neighbors queries. In: ICDE, pp. 760\u2013771 (2014)","DOI":"10.1109\/ICDE.2014.6816698"},{"issue":"4","key":"460_CR52","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1109\/TKDE.2006.1599391","volume":"18","author":"ML Yiu","year":"2006","unstructured":"Yiu, M.L., Papadias, D., Mamoulis, N., Tao, Y.: Reverse nearest neighbors in large graphs. IEEE Trans. Knowl. Data Eng. 18(4), 540\u2013553 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"9","key":"460_CR53","first-page":"800","volume":"5","author":"Y Yuan","year":"2012","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient subgraph similarity search on large probabilistic graph databases. PVLDB 5(9), 800\u2013811 (2012)","journal-title":"PVLDB"},{"issue":"12","key":"460_CR54","doi-asserted-by":"crossref","first-page":"2767","DOI":"10.1109\/TKDE.2012.222","volume":"25","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient keyword search on uncertain graph data. IEEE Trans. Knowl. Data Eng. 25(12), 2767\u20132779 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"460_CR55","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s00778-014-0373-y","volume":"24","author":"Y Yuan","year":"2015","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Graph similarity search on large uncertain graph databases. VLDB J. 24(2), 271\u2013296 (2015)","journal-title":"VLDB J."},{"issue":"11","key":"460_CR56","first-page":"876","volume":"4","author":"Y Yuan","year":"2011","unstructured":"Yuan, Y., Wang, G., Wang, H., Chen, L.: Efficient subgraph search over large uncertain graphs. PVLDB 4(11), 876\u2013886 (2011)","journal-title":"PVLDB"},{"key":"460_CR57","doi-asserted-by":"crossref","unstructured":"Zhang, W., Lin, X., Zhang, Y., Zhu, K., Zhu, G.: Efficient probabilistic supergraph search. IEEE Trans. Knowl. Data Eng. 28(4), 965\u2013978 (2016)","DOI":"10.1109\/TKDE.2015.2499201"},{"key":"460_CR58","doi-asserted-by":"crossref","unstructured":"Zou, Z., Li, J., Gao, H., Zhang, S.: Finding top- $$k$$ k maximal cliques in an uncertain graph. In: ICDE, pp. 649\u2013652 (2010)","DOI":"10.1109\/ICDE.2010.5447891"},{"issue":"9","key":"460_CR59","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","volume":"22","author":"Z Zou","year":"2010","unstructured":"Zou, Z., Li, J., Gao, H., Zhang, S.: Mining frequent subgraph patterns from uncertain graph data. IEEE Trans. Knowl. Data Eng. 22(9), 1203\u20131218 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-017-0460-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0460-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0460-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T00:52:57Z","timestamp":1750121577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-017-0460-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,17]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["460"],"URL":"https:\/\/doi.org\/10.1007\/s00778-017-0460-y","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,17]]}}}