{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:04:32Z","timestamp":1730199872826,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/bigdata.2017.8257940","type":"proceedings-article","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T22:47:28Z","timestamp":1516056448000},"page":"319-324","source":"Crossref","is-referenced-by-count":2,"title":["External memory pipelining made easy with TPIE"],"prefix":"10.1109","author":[{"given":"Lars","family":"Arge","sequence":"first","affiliation":[]},{"given":"Mathias","family":"Rav","sequence":"additional","affiliation":[]},{"given":"Svend C.","family":"Svendsen","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Truelsen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/spe.844"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-8141-3_17"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972894.9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2367574.2367579"},{"key":"ref14","article-title":"External memory algorithms and data structures: Dealing with massive data","volume":"33","author":"scott vitter","year":"2001","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"ref15","article-title":"Spark: Cluster computing with working sets","author":"matei","year":"2010","journal-title":"HotCloud 10(10–10)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0357-y"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973198.3"},{"journal-title":"External Memory Pipelining Made Easy With TPIE","year":"2017","author":"lars","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840603"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161001"},{"key":"ref2","article-title":"Breadth first search on massive graphs","author":"ajwani","year":"2006","journal-title":"9th DIMACS Impl Challenge Workshop Shortest Paths"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"}],"event":{"name":"2017 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2017,12,11]]},"location":"Boston, MA","end":{"date-parts":[[2017,12,14]]}},"container-title":["2017 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8241556\/8257893\/08257940.pdf?arnumber=8257940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,20]],"date-time":"2018-02-20T00:01:00Z","timestamp":1519084860000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8257940\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2017.8257940","relation":{},"subject":[],"published":{"date-parts":[[2017,12]]}}}