{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:53:55Z","timestamp":1760709235810},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,1,18]],"date-time":"2017-01-18T00:00:00Z","timestamp":1484697600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s41019-016-0023-z","type":"journal-article","created":{"date-parts":[[2017,1,18]],"date-time":"2017-01-18T18:02:56Z","timestamp":1484762576000},"page":"2-21","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Distance-Aware Selective Online Query Processing Over Large Distributed Graphs"],"prefix":"10.1007","volume":"2","author":[{"given":"Xiaofei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,18]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/S0895480103433409","volume":"19","author":"S Alstrup","year":"2005","unstructured":"Alstrup S, Bille P, Rauhe T (2005) Labeling schemes for small distances in trees. SIAM J Discrete Math 19(2):448\u2013462","journal-title":"SIAM J Discrete Math"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bader DA, Madduri K (2006) Parallel algorithms for evaluating centrality indices in real-world networks. In: ICPP, pp 539\u2013550","DOI":"10.1109\/ICPP.2006.57"},{"key":"23_CR3","unstructured":"Bader DA, Madduri K (2008) Snap, small-world network analysis and partitioning: an open-source parallel graph framework for the exploration of large-scale networks. In: IPDPS, pp 1\u201312"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bader DA, Kintali S, Madduri K, Mihail M (2007) Approximating betweenness centrality. In: WAW, pp 124\u2013137","DOI":"10.1007\/978-3-540-77004-6_10"},{"issue":"3","key":"23_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1504\/IJWBC.2010.033750","volume":"6","author":"PB Brandtz\u00e6g","year":"2010","unstructured":"Brandtz\u00e6g PB, Heim J, Kaare BH (2010) Bridging and bonding in social network sites\u2014investigating family-based capital. IJWBC 6(3):231\u2013253","journal-title":"IJWBC"},{"issue":"2","key":"23_CR6","first-page":"161","volume":"8","author":"Y Bu","year":"2014","unstructured":"Bu Y, Borkar VR, Jia J, Carey MJ, Condie T (2014) Pregelix: big(ger) graph analytics on a dataflow engine. PVLDB 8(2):161\u2013172","journal-title":"PVLDB"},{"key":"23_CR7","unstructured":"Castro M et al (2003) Future directions in distributed computing. In: Topology-aware routing in structured peer-to-peer overlay networks, pp 103\u2013107"},{"issue":"7","key":"23_CR8","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1109\/TKDE.2010.169","volume":"23","author":"J Cheng","year":"2011","unstructured":"Cheng J, Yu JX, Yu PS (2011) Graph pattern matching: a join\/semijoin approach. IEEE Trans Knowl Data Eng 23(7):1006\u20131021","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"23_CR9","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen E, Halperin E, Kaplan H, Zwick U (2003) Reachability and distance queries via 2-hop labels. SIAM J Comput 32(5):1338\u20131355","journal-title":"SIAM J Comput"},{"issue":"6","key":"23_CR10","first-page":"457","volume":"6","author":"AW Fu","year":"2013","unstructured":"Fu AW, Wu H, Cheng J, Wong RC (2013) IS-LABEL: an independent-set based labeling scheme for point-to-point distance querying. PVLDB 6(6):457\u2013468","journal-title":"PVLDB"},{"issue":"10","key":"23_CR11","first-page":"893","volume":"7","author":"S Funke","year":"2014","unstructured":"Funke S, Nusser A, Storandt S (2014) On k-path covers and their applications. PVLDB 7(10):893\u2013902","journal-title":"PVLDB"},{"issue":"1","key":"23_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C Gavoille","year":"2004","unstructured":"Gavoille C, Peleg D, P\u00e9rennes S, Raz R (2004) Distance labeling in graphs. J Algorithms 53(1):85\u2013112","journal-title":"J Algorithms"},{"issue":"2","key":"23_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/2503792.2503797","volume":"42","author":"A Guille","year":"2013","unstructured":"Guille A, Hacid H, Favre C, Zighed DA (2013) Information diffusion in online social networks: a survey. SIGMOD Rec 42(2):17\u201328","journal-title":"SIGMOD Rec"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Jin W, Yang J (2011) A flexible graph pattern matching framework via indexing. In: SSDBM, pp 293\u2013311","DOI":"10.1007\/978-3-642-22351-8_18"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Kang U, Tong H, Sun J, Lin CY, Faloutsos C (2011) Gbase: a scalable and general graph management system. In: KDD, pp 1091\u20131099","DOI":"10.1145\/2020408.2020580"},{"issue":"1","key":"23_CR16","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G et al (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Kleinberg JM, Slivkins A, Wexler T (2004) Triangulation and embedding using small sets of beacons. In: FOCS 17\u201319, pp 444\u2013453","DOI":"10.1109\/FOCS.2004.70"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, Moon SB (2010) What is twitter, a social network or a news media? In: WWW, pp 591\u2013600","DOI":"10.1145\/1772690.1772751"},{"key":"23_CR19","unstructured":"Low Y, et al (2010) Graphlab: a new framework for parallel machine learning. In: UAI, pp 340\u2013349"},{"issue":"1","key":"23_CR20","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1142\/S0129626407002843","volume":"17","author":"A Lumsdaine","year":"2007","unstructured":"Lumsdaine A, Gregor D, Hendrickson B, Berry JW (2007) Challenges in parallel graph processing. Parallel Process Lett 17(1):5\u201320","journal-title":"Parallel Process Lett"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Madduri K, et al (2009) A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets. In: IPDPS, pp 1\u20138","DOI":"10.2172\/951102"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Malewicz G, et al (2010) Pregel: a system for large-scale graph processing. In: SIGMOD, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Meusel R, et al (2014) Graph structure in the web - revisited: a trick of the heavy tail. In: WWW, pp 427\u2013432","DOI":"10.1145\/2567948.2576928"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Najork M, et al (2012) Of hammers and nails: an empirical comparison of three paradigms for processing large graphs. In: WSDM, pp 103\u2013112","DOI":"10.1145\/2124295.2124310"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Ng TSE, Zhang H (2002) Predicting internet network distance with coordinates-based approaches. In: INFOCOM","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Potamias M, Bonchi F, Castillo C, Gionis A (2009a) Fast shortest path distance estimation in large networks. CIKM, pp 867\u2013876","DOI":"10.1145\/1645953.1646063"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Potamias M, Bonchi F, Castillo C, Gionis A (2009b) Fast shortest path distance estimation in large networks. In: CIKM, pp 867\u2013876","DOI":"10.1145\/1645953.1646063"},{"issue":"1","key":"23_CR28","first-page":"61","volume":"7","author":"Z Qi","year":"2013","unstructured":"Qi Z, Xiao Y, Shao B, Wang H (2013) Toward a distance oracle for billion-node graphs. PVLDB 7(1):61\u201372","journal-title":"PVLDB"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Qiao M, Cheng H, Yu JX (2011) Querying shortest path distance with bounded errors in large graphs. In: SSDBM, pp 255\u2013273","DOI":"10.1007\/978-3-642-22351-8_16"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Ruan N, Jin R, Huang Y (2011) Distance preserving graph simplification. In: ICDM, pp 1200\u20131205","DOI":"10.1109\/ICDM.2011.57"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Shao B, Wang H, Li Y (2012) The trinity graph engine. Technical Report 161291, Microsoft Research","DOI":"10.1145\/2463676.2467799"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Tao Y, Sheng C, Pei J (2011) On k-skip shortest paths. In: SIGMOD, pp 421\u2013432","DOI":"10.1145\/1989323.1989368"},{"issue":"3","key":"23_CR33","first-page":"193","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian Y, Balmin A, Corsten SA, Tatikonda S, McPherson J (2013) From \u201cthink like a vertex\u201d to \u201cthink like a graph\u201d. PVLDB 7(3):193\u2013204","journal-title":"PVLDB"},{"key":"23_CR34","unstructured":"Yan D, Cheng J, Ng W, Liu S (2013) Finding distance-preserving subgraphs in large road networks. In: ICDE, pp 625\u2013636"},{"issue":"14","key":"23_CR35","first-page":"1981","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan D, Cheng J, Lu Y, Ng W (2014) Blogel: a block-centric framework for distributed computation on real-world graphs. PVLDB 7(14):1981\u20131992","journal-title":"PVLDB"},{"issue":"3","key":"23_CR36","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1109\/TKDE.2014.2345383","volume":"27","author":"X Zhang","year":"2015","unstructured":"Zhang X, Chen L, Wang M (2015a) Efficient parallel processing of distance join queries over distributed graphs. IEEE Trans Knowl Data Eng 27(3):740\u2013754","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"12","key":"23_CR37","first-page":"1418","volume":"8","author":"X Zhang","year":"2015","unstructured":"Zhang X, Cheng H, Chen L (2015b) Bonding vertex sets over distributed graph: a betweenness aware approach. PVLDB 8(12):1418\u20131429","journal-title":"PVLDB"},{"issue":"1","key":"23_CR38","first-page":"886","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou L, Chen L, \u00d6zsu MT (2009) Distancejoin: pattern match query in a large graph database. PVLDB 2(1):886\u2013897","journal-title":"PVLDB"},{"issue":"4","key":"23_CR39","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s00778-013-0337-7","volume":"23","author":"L Zou","year":"2014","unstructured":"Zou L, \u00d6zsu MT, Chen L, Shen X, Huang R, Zhao D (2014) gstore: a graph-based SPARQL query engine. VLDB J 23(4):565\u2013590","journal-title":"VLDB J"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-016-0023-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-016-0023-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-016-0023-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T20:29:48Z","timestamp":1692649788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-016-0023-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,18]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["23"],"URL":"https:\/\/doi.org\/10.1007\/s41019-016-0023-z","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,18]]}}}