{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:32:32Z","timestamp":1729643552526,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/bigdata.2014.7004250","type":"proceedings-article","created":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T20:04:23Z","timestamp":1421179463000},"page":"335-344","source":"Crossref","is-referenced-by-count":6,"title":["Estimating pairwise distances in large graphs"],"prefix":"10.1109","author":[{"given":"Maria","family":"Christoforaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Suel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/380752.380798","article-title":"Approximate distance oracles","author":"thorup","year":"2001","journal-title":"STOC"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"journal-title":"Learning to Estimate Pairwise Distances in Large Graphs","year":"2014","author":"christoforaki","key":"36"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"33","first-page":"237","article-title":"Hopi: An efficient connection index for complex xml document collections","volume":"2992","author":"schenkel","year":"2004","journal-title":"EDBT"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"34","first-page":"1899","article-title":"Learning a distance metric from a network","author":"shaw","year":"2011","journal-title":"NIPS"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213887"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30162-4_181"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516418"},{"key":"11","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","author":"goldberg","year":"2005","journal-title":"SODA"},{"key":"12","first-page":"88","article-title":"Point-to-point shortest path algorithms with preprocessing","volume":"4362","author":"goldberg","year":"2007","journal-title":"SOFSEM"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761110"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/BF02776078"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.011"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1137\/060670511"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.4108\/icst.collaboratecom.2011.247162"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.11.001"},{"key":"27","first-page":"745","article-title":"Graph distances in the streaming model: The value of space","author":"feigenbaum","year":"2005","journal-title":"SODA"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.253"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063834"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187891"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"10","article-title":"Reach for a: Effcient point-to-point shortest path algorithms","author":"goldberg","year":"2005","journal-title":"Microsoft Research CA"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458274"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22351-8_16"},{"key":"32","first-page":"845","article-title":"Fast and practical indexing and querying of very large graphs","author":"tri\ufffdl","year":"2007","journal-title":"SIGMOD Conference"},{"key":"5","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/1321440.1321520","article-title":"Efficient search ranking in social networks","author":"vieira","year":"2007","journal-title":"CIKM"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.14778\/2536206.2536217"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"8","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/1718487.1718537","article-title":"A sketchbased distance oracle for web-scale graphs","author":"sarma","year":"2010","journal-title":"WSDM"}],"event":{"name":"2014 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2014,10,27]]},"location":"Washington, DC, USA","end":{"date-parts":[[2014,10,30]]}},"container-title":["2014 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6973861\/7004197\/07004250.pdf?arnumber=7004250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T22:01:22Z","timestamp":1690840882000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7004250\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2014.7004250","relation":{},"subject":[],"published":{"date-parts":[[2014,10]]}}}