{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:33:11Z","timestamp":1771025591186,"version":"3.50.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T00:00:00Z","timestamp":1572048000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T00:00:00Z","timestamp":1572048000000},"content-version":"vor","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":[[2019,12]]},"DOI":"10.1007\/s00778-019-00579-4","type":"journal-article","created":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T17:02:45Z","timestamp":1572109365000},"page":"987-1012","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient community discovery with user engagement and similarity"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0548-0130","authenticated-orcid":false,"given":"Fan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,26]]},"reference":[{"key":"579_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gollapudi, S., Halverson, A., Ieong, S.: Diversifying search results. In: WSDM, pp. 5\u201314 (2009)","DOI":"10.1145\/1498759.1498766"},{"key":"579_CR2","doi-asserted-by":"crossref","unstructured":"Angel, A., Koudas, N.: Efficient diversity-aware search. In: SIGMOD, pp. 781\u2013792 (2011)","DOI":"10.1145\/1989323.1989405"},{"issue":"13\u201314","key":"579_CR3","doi-asserted-by":"publisher","first-page":"1901","DOI":"10.1016\/j.dam.2012.04.005","volume":"160","author":"G Ausiello","year":"2012","unstructured":"Ausiello, G., Boria, N., Giannakos, A., Lucarelli, G., Paschos, V.T.: Online maximum k-coverage. Discrete Appl. Math. 160(13\u201314), 1901\u20131913 (2012)","journal-title":"Discrete Appl. Math."},{"key":"579_CR4","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: KDD, pp. 671\u2013680 (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"579_CR5","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. In: CoRR, cs.DS\/0310049 (2003)"},{"issue":"3","key":"579_CR6","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1137\/14097032X","volume":"29","author":"K Bhawalkar","year":"2015","unstructured":"Bhawalkar, K., Kleinberg, J.M., Lewi, K., Roughgarden, T., Sharma, A.: Preventing unraveling in social networks: the anchored k-core problem. SIAM J. Discrete Math. 29(3), 1452\u20131475 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"579_CR7","doi-asserted-by":"crossref","unstructured":"Bird, C., Gourley, A., Devanbu, P.\u00a0T., Gertz, M., Swaminathan, A.: Mining email social networks. In: MSR, pp. 137\u2013143 (2006)","DOI":"10.1145\/1137983.1138033"},{"key":"579_CR8","doi-asserted-by":"crossref","unstructured":"Borodin, A., Lee, H.C., Ye, Y.: Max-sum diversification, monotone submodular functions and dynamic updates. In: PODS, pp. 155\u2013166 (2012)","DOI":"10.1145\/2213556.2213580"},{"issue":"9","key":"579_CR9","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"key":"579_CR10","doi-asserted-by":"crossref","unstructured":"Chang, L.: Efficient maximum clique computation over large sparse graphs. In: SIGKDD, pp. 529\u2013538 (2019)","DOI":"10.1145\/3292500.3330986"},{"issue":"1","key":"579_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00453-012-9632-8","volume":"66","author":"L Chang","year":"2013","unstructured":"Chang, L., Yu, J.X., Qin, L.: Fast maximal cliques enumeration in sparse graphs. Algorithmica 66(1), 173\u2013186 (2013)","journal-title":"Algorithmica"},{"key":"579_CR12","doi-asserted-by":"crossref","unstructured":"Chen, K., Lei, C.: Network game design: hints and implications of player interaction. In: NETGAMES, p. 17 (2006)","DOI":"10.1145\/1230040.1230083"},{"issue":"10","key":"579_CR13","first-page":"1233","volume":"11","author":"L Chen","year":"2018","unstructured":"Chen, L., Liu, C., Zhou, R., Li, J., Yang, X., Wang, B.: Maximum co-located community search in large scale social networks. PVLDB 11(10), 1233\u20131246 (2018)","journal-title":"PVLDB"},{"key":"579_CR14","doi-asserted-by":"crossref","unstructured":"Cheng, J., Zhu, L., Ke, Y., Chu, S.: Fast algorithms for maximal clique enumeration with limited memory. In: KDD, pp. 1240\u20131248 (2012)","DOI":"10.1145\/2339530.2339724"},{"issue":"1\u20133","key":"579_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"issue":"8","key":"579_CR16","first-page":"577","volume":"6","author":"T Deng","year":"2013","unstructured":"Deng, T., Fan, W.: On the complexity of query result diversification. PVLDB 6(8), 577\u2013588 (2013)","journal-title":"PVLDB"},{"issue":"1","key":"579_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1860702.1860709","volume":"39","author":"M Drosou","year":"2010","unstructured":"Drosou, M., Pitoura, E.: Search result diversification. SIGMOD Rec. 39(1), 41\u201347 (2010)","journal-title":"SIGMOD Rec."},{"key":"579_CR18","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. In: SEA, pp. 364\u2013375 (2011)","DOI":"10.1007\/978-3-642-20662-7_31"},{"key":"579_CR19","unstructured":"Facebook. How does facebook suggest groups for me? https:\/\/www.facebook.com\/help\/382485908586472?helpref=uf_permalink . Accessed 16 Sep 2019"},{"issue":"13","key":"579_CR20","first-page":"1510","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan, W., Wang, X., Wu, Y.: Diversified top-k graph pattern matching. PVLDB 6(13), 1510\u20131521 (2013)","journal-title":"PVLDB"},{"issue":"6","key":"579_CR21","first-page":"709","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. PVLDB 10(6), 709\u2013720 (2017)","journal-title":"PVLDB"},{"issue":"12","key":"579_CR22","first-page":"1233","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. PVLDB 9(12), 1233\u20131244 (2016)","journal-title":"PVLDB"},{"issue":"5","key":"579_CR23","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1177\/0165551514541614","volume":"40","author":"Y Fang","year":"2014","unstructured":"Fang, Y., Zhang, H., Ye, Y., Li, X.: Detecting hot topics from twitter: a multiview approach. J. Inf. Sci. 40(5), 578\u2013593 (2014)","journal-title":"J. Inf. Sci."},{"issue":"4","key":"579_CR24","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"579_CR25","doi-asserted-by":"crossref","unstructured":"Ferrara, E., JafariAsbagh, M., Varol, O., Qazvinian, V., Menczer, F., Flammini, A.: Clustering memes in social media. In: ASONAM, pp. 548\u2013555 (2013)","DOI":"10.1145\/2492517.2492530"},{"issue":"1","key":"579_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/321921.321926","volume":"23","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S.: The complexity of near-optimal graph coloring. JACM 23(1), 43\u201349 (1976)","journal-title":"JACM"},{"key":"579_CR27","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H Freeman, New York (1979)"},{"key":"579_CR28","doi-asserted-by":"crossref","unstructured":"Goldberg, M.K., Kelley, S., Magdon-Ismail, M., Mertsalov, K., Wallace, A.: Finding overlapping communities in social networks. In: SocialCom\/PASSAT, pp. 104\u2013113 (2010)","DOI":"10.1109\/SocialCom.2010.24"},{"key":"579_CR29","unstructured":"Gupta, R., Walrand, J., Goldschmidt, O.: Maximal cliques in unit disk graphs: polynomial approximation. In: Proceedings INOC, vol. 2005. Citeseer (2005)"},{"key":"579_CR30","doi-asserted-by":"crossref","unstructured":"Hristova, D., Musolesi, M., Mascolo, C.: Keep your friends close and your facebook friends closer: A multiplex network approach to the analysis of offline and online social ties. In: ICWSM (2014)","DOI":"10.1609\/icwsm.v8i1.14544"},{"key":"579_CR31","doi-asserted-by":"crossref","unstructured":"Huang, X., Lu, W., Lakshmanan, L.V.S.: Truss decomposition of probabilistic graphs: Semantics and algorithms. In: SIGMOD, pp. 77\u201390 (2016)","DOI":"10.1145\/2882903.2882913"},{"key":"579_CR32","doi-asserted-by":"crossref","unstructured":"Pfeiffer, J.J III., Moreno, S., Fond, T.L., Neville, J., Gallagher, B.: Attributed graph models: modeling network structure with correlated attributes. In: WWW, pp. 831\u2013842 (2014)","DOI":"10.1145\/2566486.2567993"},{"issue":"3","key":"579_CR33","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1587\/transinf.2014FCP0018","volume":"98\u2013D","author":"T Izumi","year":"2015","unstructured":"Izumi, T., Suzuki, D.: Faster enumeration of all maximal cliques in unit disk graphs using geometric structure. IEICE Trans. 98\u2013D(3), 490\u2013496 (2015)","journal-title":"IEICE Trans."},{"issue":"11","key":"579_CR34","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888\u2013893 (2010)","journal-title":"Nat. Phys."},{"key":"579_CR35","doi-asserted-by":"crossref","unstructured":"Lee, P., Lakshmanan, L.V.S., Milios, E.E.: CAST: a context-aware story-teller for streaming social content. In: CIKM, pp. 789\u2013798 (2014)","DOI":"10.1145\/2661829.2661859"},{"key":"579_CR36","doi-asserted-by":"crossref","unstructured":"Lin, X., Yuan, Y., Zhang, Q., Zhang, Y.: Selecting stars: the k most representative skyline operator. In: ICDE, pp. 86\u201395 (2007)","DOI":"10.1109\/ICDE.2007.367854"},{"issue":"2","key":"579_CR37","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s12525-012-0085-3","volume":"22","author":"Y Liu","year":"2012","unstructured":"Liu, Y., Sutanto, J.: Buyers purchasing time and herd behavior on deal-of-the-day group-buying websites. Electron. Mark. 22(2), 83\u201393 (2012)","journal-title":"Electron. Mark."},{"key":"579_CR38","first-page":"833","volume-title":"Advances in Human Factors, Business Management, Training and Education","author":"Margaret Meiling Luo","year":"2016","unstructured":"Luo, M.M., Chea, S.: The effect of social rewards and perceived effectiveness of e-commerce institutional mechanisms on intention to group buying. In: Advances in Human Factors, Business Management, Training and Education, pp. 833\u2013840. Springer, Berlin (2017)"},{"issue":"2","key":"579_CR39","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1509\/jm.12.0422","volume":"78","author":"X Luo","year":"2014","unstructured":"Luo, X., Andrews, M., Song, Y., Aspara, J.: Group-buying deal popularity. J. Mark. 78(2), 20\u201333 (2014)","journal-title":"J. Mark."},{"key":"579_CR40","doi-asserted-by":"crossref","unstructured":"Malliaros, F.D., Vazirgiannis, M.: To stay or not to stay: modeling engagement dynamics in social graphs. In: CIKM, pp. 469\u2013478 (2013)","DOI":"10.1145\/2505515.2505561"},{"key":"579_CR41","doi-asserted-by":"crossref","unstructured":"Minack, E., Siberski, W., Nejdl, W.: Incremental diversification for very large sets: a streaming-based approach. In: SIGIR, pp. 585\u2013594 (2011)","DOI":"10.1145\/2009916.2009996"},{"issue":"1","key":"579_CR42","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/s13278-014-0216-2","volume":"4","author":"F Mitzlaff","year":"2014","unstructured":"Mitzlaff, F., Atzm\u00fcller, M., Hotho, A., Stumme, G.: The social distributional hypothesis: a pragmatic proxy for homophily in online social networks. Soc. Netw. Anal. Min. 4(1), 216 (2014)","journal-title":"Soc. Netw. Anal. Min."},{"key":"579_CR43","unstructured":"PokemonGo. Developer insights: Inside the philosophy of friends and trading. https:\/\/pokemongolive.com\/en\/post\/jundevupdate-trading\/ . Accessed 16 Sep 2019"},{"issue":"11","key":"579_CR44","first-page":"1124","volume":"5","author":"L Qin","year":"2012","unstructured":"Qin, L., Yu, J.X., Chang, L.: Diversifying top-k results. PVLDB 5(11), 1124\u20131135 (2012)","journal-title":"PVLDB"},{"issue":"3","key":"579_CR45","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"579_CR46","first-page":"35","volume":"44","author":"P Sharma","year":"2016","unstructured":"Sharma, P., Govindan, S.: Information seeking behavior of expats in asia on facebook open groups. Singap. J. Libr. Inf. Manag. 44, 35 (2016)","journal-title":"Singap. J. Libr. Inf. Manag."},{"key":"579_CR47","doi-asserted-by":"crossref","unstructured":"Singla, P., Richardson, M.: Yes, there is a correlation\u2014from social networks to personal behavior on the web. In: WWW, pp. 655\u2013664 (2008)","DOI":"10.1145\/1367497.1367586"},{"key":"579_CR48","unstructured":"Statista. Number of active users of pokemon go worldwide from 2016 to 2020, by region (in millions). https:\/\/www.statista.com\/statistics\/665640 . Accessed 16 Sep 2019"},{"issue":"16","key":"579_CR49","doi-asserted-by":"publisher","first-page":"5962","DOI":"10.1073\/pnas.1116502109","volume":"109","author":"J Ugander","year":"2012","unstructured":"Ugander, J., Backstrom, L., Marlow, C., Kleinberg, J.: Structural diversity in social contagion. PNAS 109(16), 5962\u20135966 (2012)","journal-title":"PNAS"},{"key":"579_CR50","doi-asserted-by":"crossref","unstructured":"Vieira, M.R., Razente, H.L., Barioni, M.C.N., Hadjieleftheriou, M., Srivastava, D., Traina, Jr. C., Tsotras, V.J.: On query result diversification. In: ICDE, pp. 1163\u20131174 (2011)","DOI":"10.1109\/ICDE.2011.5767846"},{"key":"579_CR51","doi-asserted-by":"crossref","unstructured":"Wang, J., Cheng, J., Fu, A.W.: Redundancy-aware maximal cliques. In: KDD, pp. 122\u2013130 (2013)","DOI":"10.1145\/2487575.2487689"},{"key":"579_CR52","doi-asserted-by":"crossref","unstructured":"Wang, K., Cao, X., Lin, X., Zhang, W., Qin, L.: Efficient computing of radius-bounded k-cores. In: ICDE, pp. 233\u2013244 (2018)","DOI":"10.1109\/ICDE.2018.00030"},{"issue":"10","key":"579_CR53","first-page":"1139","volume":"12","author":"K Wang","year":"2019","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Vertex priority based butterfly counting for large-scale bipartite networks. PVLDB 12(10), 1139\u20131152 (2019)","journal-title":"PVLDB"},{"key":"579_CR54","doi-asserted-by":"crossref","unstructured":"Wen, D., Qin, L., Zhang, Y., Lin, X., Yu, J.X.: I\/O efficient core graph decomposition at web scale. In: ICDE, pp. 133\u2013144 (2016)","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"579_CR55","doi-asserted-by":"crossref","unstructured":"Wu, S., Sarma, A.D., Fabrikant, A., Lattanzi, S., Tomkins, A.: Arrival and departure dynamics in social networks. In: WSDM, pp. 233\u2013242 (2013)","DOI":"10.1145\/2433396.2433425"},{"key":"579_CR56","doi-asserted-by":"crossref","unstructured":"Wu, Y., Jin, R., Zhu, X., Zhang, X.: Finding dense and connected subgraphs in dual networks. In: ICDE, pp. 915\u2013926 (2015)","DOI":"10.1109\/ICDE.2015.7113344"},{"key":"579_CR57","doi-asserted-by":"crossref","unstructured":"Xu, Z., Ke, Y., Wang, Y., Cheng, H., Cheng, J.: A model-based approach to attributed graph clustering. In: SIGMOD, pp. 505\u2013516 (2012)","DOI":"10.1145\/2213836.2213894"},{"key":"579_CR58","doi-asserted-by":"crossref","unstructured":"Yang, J., McAuley, J.J., Leskovec, J.: Community detection in networks with node attributes. In: ICDM, pp. 1151\u20131156 (2013)","DOI":"10.1109\/ICDM.2013.167"},{"key":"579_CR59","doi-asserted-by":"crossref","unstructured":"Yu, H., Yuan, D.: Set coverage problems in a one-pass data stream. In: SDM, pp. 758\u2013766 (2013)","DOI":"10.1137\/1.9781611972832.84"},{"key":"579_CR60","doi-asserted-by":"crossref","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: Diversified top-k clique search. In: ICDE, pp. 387\u2013398 (2015)","DOI":"10.1109\/ICDE.2015.7113300"},{"key":"579_CR61","unstructured":"Yuan, Q., Zhao, S., Chen, L., Liu, Y., Ding, S., Zhang, X., Zheng, W.: Augmenting collaborative recommender by fusing explicit social relationships. In: Recsys Workshop (2009)"},{"key":"579_CR62","doi-asserted-by":"crossref","unstructured":"Zhang, F., Yuan, L., Zhang, Y., Qin, L., Lin, X., Zhou, A.: Discovering strong communities with user engagement and tie strength. In: DASFAA, pp. 425\u2013441 (2018)","DOI":"10.1007\/978-3-319-91452-7_28"},{"issue":"6","key":"579_CR63","first-page":"649","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, W., Zhang, Y., Qin, L., Lin, X.: OLAK: an efficient algorithm to prevent unraveling in social networks. PVLDB 10(6), 649\u2013660 (2017)","journal-title":"PVLDB"},{"key":"579_CR64","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: Finding critical users for social network engagement: the collapsed k-core problem. In: AAAI, pp. 245\u2013251 (2017)","DOI":"10.1609\/aaai.v31i1.10482"},{"issue":"10","key":"579_CR65","first-page":"998","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: When engagement meets similarity: efficient (k, r)-core computation on social networks. PVLDB 10(10), 998\u20131009 (2017)","journal-title":"PVLDB"},{"key":"579_CR66","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: Efficiently reinforcing social networks over user engagement and tie strength. In: ICDE, pp. 557\u2013568 (2018)","DOI":"10.1109\/ICDE.2018.00057"},{"key":"579_CR67","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Qin, L., Zhang, F., Zhang, W.: Hierarchical decomposition of big graphs. In: ICDE, pp. 2064\u20132067 (2019)","DOI":"10.1109\/ICDE.2019.00240"},{"key":"579_CR68","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Zhang, F., Lin, X., Zhang, W., Chen, C.: K-core maximization: An edge addition approach. In: IJCAI, pp. 4867\u20134873 (2019)","DOI":"10.24963\/ijcai.2019\/676"},{"issue":"5","key":"579_CR69","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s00778-017-0473-6","volume":"26","author":"Q Zhu","year":"2017","unstructured":"Zhu, Q., Hu, H., Xu, C., Xu, J., Lee, W.: Geo-social group queries with minimum acquaintance constraints. VLDB J. 26(5), 709\u2013727 (2017)","journal-title":"VLDB J."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00579-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00579-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00579-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T05:03:50Z","timestamp":1695359030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00579-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,26]]},"references-count":69,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["579"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00579-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,26]]},"assertion":[{"value":"7 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}