{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:31Z","timestamp":1750307551018,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T00:00:00Z","timestamp":1269216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,3,22]]},"DOI":"10.1145\/1774088.1774382","type":"proceedings-article","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T12:45:48Z","timestamp":1272372348000},"page":"1373-1380","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["External sorting for index construction of large semantic web databases"],"prefix":"10.1145","author":[{"given":"Sven","family":"Groppe","sequence":"first","affiliation":[{"name":"University of L\u00fcbeck, L\u00fcbeck, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinghua","family":"Groppe","sequence":"additional","affiliation":[{"name":"University of L\u00fcbeck, L\u00fcbeck, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,3,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"VLDB","author":"Abadi D. J.","year":"2007","unstructured":"Abadi , D. J. , Marcus , A. , Madden , S. R. , and Hollenbach , K . Scalable Semantic Web Data Management Using Vertical Partitioning , VLDB , Vienna, Austria , 2007 . Abadi, D. J., Marcus, A., Madden, S. R., and Hollenbach, K. Scalable Semantic Web Data Management Using Vertical Partitioning, VLDB, Vienna, Austria, 2007."},{"key":"e_1_3_2_1_2_1","first-page":"173","volume":"1","author":"Rudolf Bayer M.","year":"1972","unstructured":"Rudolf Bayer and Edward M. McCreight , Organization and Maintenance of Large Ordered Indices. Acta Informatica 1 : 173 -- 189 , 1972 . Rudolf Bayer and Edward M. McCreight, Organization and Maintenance of Large Ordered Indices. Acta Informatica 1: 173--189, 1972.","journal-title":"Organization and Maintenance of Large Ordered Indices. Acta Informatica"},{"key":"e_1_3_2_1_3_1","volume-title":"W3C Recommendation, 10th","author":"Beckett D.","year":"2004","unstructured":"Beckett , D. (editor), RDF\/XML Syntax Specification (Revised) , W3C Recommendation, 10th February 2004 . Beckett, D. (editor), RDF\/XML Syntax Specification (Revised), W3C Recommendation, 10th February 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_2_1_5_1","first-page":"281","volume-title":"International Journal of Parallel, Emergent and Distributed Systems","author":"Sajal K.","year":"1994","unstructured":"Sajal K. Das , Wen-Bing Horng, Gyo S. Moon , An efficient algorithm for managing a Parallel Heap , International Journal of Parallel, Emergent and Distributed Systems , Volume 4 , Issue 3 and 4, pages 281 -- 299 , 1994 . Sajal K. Das, Wen-Bing Horng, Gyo S. Moon, An efficient algorithm for managing a Parallel Heap, International Journal of Parallel, Emergent and Distributed Systems, Volume 4, Issue 3 and 4, pages 281--299, 1994."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00128644"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/320831.320833"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS'02)","author":"Minsoo Jeon","year":"2002","unstructured":"Minsoo Jeon and Dongseung Kim, Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers , Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS'02) , 2002 . Minsoo Jeon and Dongseung Kim, Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers, Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS'02), 2002."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529560"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.06.005"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/LAWEB.2005.25"},{"key":"e_1_3_2_1_12_1","unstructured":"D. E. \n      Knuth Sorting and Searching Volume \n  3\n   of \n  The Art of Computer Programming 2\n  nd edition Reading Mass\n  .: \n  Addison-Wesley 1998\n  .   D. E. Knuth Sorting and Searching Volume 3 of The Art of Computer Programming 2 nd edition Reading Mass.: Addison-Wesley 1998."},{"key":"e_1_3_2_1_13_1","unstructured":"Ley M. The DBLP Computer Science Bibliography http:\/\/www.informatik.uni-trier.de\/~ley\/db\/ 2008.  Ley M. The DBLP Computer Science Bibliography http:\/\/www.informatik.uni-trier.de\/~ley\/db\/ 2008."},{"key":"e_1_3_2_1_14_1","volume-title":"IBM Research Rep. RC 6505","author":"Miller R.","year":"1977","unstructured":"Miller , R. , Pippenger , N. , Rosenberg , A. , Snyder , L. Optimal 2--3 trees , IBM Research Rep. RC 6505 , IBM Research Lab , Yorktown Heights, N.Y. , 1977 . Miller, R., Pippenger, N., Rosenberg, A., Snyder, L. Optimal 2--3 trees, IBM Research Rep. RC 6505, IBM Research Lab, Yorktown Heights, N.Y., 1977."},{"key":"e_1_3_2_1_15_1","unstructured":"MIT Libraries Barton Catalog Data. http:\/\/simile.mit.edu\/rdf-test-data\/barton\/.  MIT Libraries Barton Catalog Data. http:\/\/simile.mit.edu\/rdf-test-data\/barton\/."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 34th International Conference on Very Large Data Bases (VLDB)","author":"Thomas Neumann","year":"2008","unstructured":"Thomas Neumann , Gerhard Weikum, RDF3X : a RISCstyle Engine for RDF , Proceedings of the 34th International Conference on Very Large Data Bases (VLDB) , Auckland, New Zealand , 2008 . Thomas Neumann, Gerhard Weikum, RDF3X: a RISCstyle Engine for RDF, Proceedings of the 34th International Conference on Very Large Data Bases (VLDB), Auckland, New Zealand, 2008."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/165231.165247"},{"key":"e_1_3_2_1_18_1","volume-title":"W3C Candidate Recommendation","author":"Prud'hommeaux E.","year":"2007","unstructured":"Prud'hommeaux E. , Seaborne A. SPARQL Query Language for RDF , W3C Candidate Recommendation , 14 June 2007 . Prud'hommeaux E., Seaborne A. SPARQL Query Language for RDF, W3C Candidate Recommendation, 14 June 2007."},{"key":"e_1_3_2_1_19_1","unstructured":"Semantic web challenge 2008. billion triples track. http:\/\/challenge.semanticweb.org\/.  Semantic web challenge 2008. billion triples track. http:\/\/challenge.semanticweb.org\/."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.28"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"e_1_3_2_1_22_1","unstructured":"Uniprot RDF. http:\/\/dev.isb-sib.ch\/projects\/uniprot-rdf\/.  Uniprot RDF. http:\/\/dev.isb-sib.ch\/projects\/uniprot-rdf\/."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453965"},{"issue":"6","key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"Williams","year":"1964","unstructured":"J. W. J. Williams : Algorithm 232 : Heapsort. Communications of the ACM 7 ( 6 ) ( 1964 ), 347 -- 348 . J. W. J. Williams: Algorithm 232: Heapsort. Communications of the ACM 7 (6) (1964), 347--348.","journal-title":"Heapsort. Communications of the ACM"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/319057.319072"}],"event":{"name":"SAC'10: The 2010 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Sierre Switzerland","acronym":"SAC'10"},"container-title":["Proceedings of the 2010 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774382","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1774088.1774382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:37Z","timestamp":1750249417000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,22]]},"references-count":25,"alternative-id":["10.1145\/1774088.1774382","10.1145\/1774088"],"URL":"https:\/\/doi.org\/10.1145\/1774088.1774382","relation":{},"subject":[],"published":{"date-parts":[[2010,3,22]]},"assertion":[{"value":"2010-03-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}