{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:06:19Z","timestamp":1725822379264},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319188171"},{"type":"electronic","value":"9783319188188"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18818-8_13","type":"book-chapter","created":{"date-parts":[[2015,5,20]],"date-time":"2015-05-20T07:26:09Z","timestamp":1432106769000},"page":"205-220","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Compact In-Memory Dictionary for RDF Data"],"prefix":"10.1007","author":[{"given":"Hamid R.","family":"Bazoobandi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"de Rooij","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacopo","family":"Urbani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annette","family":"ten Teije","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"van Harmelen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henri","family":"Bal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,21]]},"reference":[{"key":"13_CR1","unstructured":"java.sizeof. \n                      http:\/\/sizeof.sourceforge.net\/"},{"key":"13_CR2","unstructured":"Askitis, N., Sinha, R.: Hat-trie: a cache-conscious trie-based data structure for strings. In: Proceedings of the Thirtieth Australasian Conference on Computer Science, vol. 62, pp. 97\u2013105. Australian Computer Society Inc (2007)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/978-3-540-76298-0_52","volume-title":"The Semantic Web","author":"S Auer","year":"2007","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.G.: DBpedia: a nucleus for a web of open data. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L.J.B., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., Cudr\u00e9-Mauroux, P. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol. 4825, pp. 722\u2013735. Springer, Heidelberg (2007)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Binnig, C., Hildenbrand, S., F\u00e4rber, F.: Dictionary-based order-preserving string compression for main memory column stores. In: SIGMOD. ACM (2009)","DOI":"10.1145\/1559845.1559877"},{"key":"13_CR5","unstructured":"Cheng, L., Malik, A., Kotoulas, S., Ward, T.E., Theodoropoulos, G.: Efficient parallel dictionary encoding for RDF data"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"JG Cleary","year":"1984","unstructured":"Cleary, J.G., Witten, I.: Data compression using adaptive coding and partial string matching. IEEE Trans. Commun. 32(4), 396\u2013402 (1984)","journal-title":"IEEE Trans. Commun."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"De La Briandais, R.: File searching using variable length keys. In: Papers Presented at the 3\u20135 March 1959, Western Joint Computer Conference. ACM (1959)","DOI":"10.1145\/1457838.1457895"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Erling, O., Mikhailov, I.: RDF support in the Virtuoso DBMS. In: Networked Knowledge-Networked Media, pp. 7\u201324. Springer (2009)","DOI":"10.1007\/978-3-642-02184-8_2"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, J.D., Gutierrez, C., Mart\u00ednez-Prieto, M.A.: RDF compression: basic approaches. In: WWW, pp. 1091\u20131092. ACM (2010)","DOI":"10.1145\/1772690.1772819"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-17746-0_13","volume-title":"The Semantic Web \u2013 ISWC 2010","author":"JD Fern\u00e1ndez","year":"2010","unstructured":"Fern\u00e1ndez, J.D., Mart\u00ednez-Prieto, M.A., Gutierrez, C.: Compact representation of large RDF data sets for publishing and exchange. In: Patel-Schneider, P.F., Pan, Y., Hitzler, P., Mika, P., Zhang, L., Pan, J.Z., Horrocks, I., Glimm, B. (eds.) ISWC 2010, Part I. LNCS, vol. 6496, pp. 193\u2013208. Springer, Heidelberg (2010)"},{"issue":"9","key":"13_CR11","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie memory. Commun. ACM 3(9), 490\u2013499 (1960)","journal-title":"Commun. ACM"},{"key":"13_CR12","unstructured":"Google. Freebase data dumps. \n                      http:\/\/download.freebase.com\/datadumps"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/506309.506312","volume":"20","author":"S Heinz","year":"2002","unstructured":"Heinz, S., Zobel, J., Williams, H.E.: Burst tries: a fast, efficient data structure for string keys. ACM TOIS 20(2), 192\u2013223 (2002)","journal-title":"ACM TOIS"},{"key":"13_CR14","unstructured":"K\u00e4fer, T., Harth, A.: Billion triples challenge data set (2014). Downloaded from \n                      http:\/\/km.aifb.kit.edu\/projects\/btc-2014\/"},{"key":"13_CR15","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 3: Sorting and Searching. International Monetary Fund (1998)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Kotoulas, S., Oren, E., Van Harmelen, F.: Mind the data skew: distributed inferencing by speeddating in elastic regions. In: WWW. ACM (2010)","DOI":"10.1145\/1772690.1772745"},{"key":"13_CR17","unstructured":"Lassila, O., Swick, R.R.: Resource description framework (RDF) model and syntax specification (1999)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: ARTful indexing for main-memory databases. In: 2013 IEEE 29th International Conference on ICDE, pp. 38\u201349. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544812"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/2340416.2340422","volume":"12","author":"MA Mart\u00ednez-Prieto","year":"2012","unstructured":"Mart\u00ednez-Prieto, M.A., Fern\u00e1ndez, J.D., C\u00e1novas, R.: Querying RDF dictionaries in compressed space. ACM SIGAPP 12(2), 64\u201377 (2012)","journal-title":"ACM SIGAPP"},{"issue":"4","key":"13_CR20","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"DR Morrison","year":"1968","unstructured":"Morrison, D.R.: PATRICIA-practical algorithm to retrieve information coded in alphanumeric. JACM 15(4), 514\u2013534 (1968)","journal-title":"JACM"},{"issue":"1","key":"13_CR21","first-page":"647","volume":"1","author":"T Neumann","year":"2008","unstructured":"Neumann, T., Weikum, G.: RDF-3X: a RISC-style engine for RDF. VLDB 1(1), 647\u2013659 (2008)","journal-title":"VLDB"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"W170","DOI":"10.1093\/nar\/gkp440","volume":"37","author":"NF Noy","year":"2009","unstructured":"Noy, N.F., Shah, N.H., Whetzel, P.L., Dai, B., Dorf, M., Griffith, N., Jonquet, C., Rubin, D.L., Storey, M.-A., Chute, C.G., et al.: Bioportal: ontologies and integrated data resources at the click of a mouse. Nucleic Acids Res. 37, W170\u2013W173 (2009)","journal-title":"Nucleic Acids Res."},{"issue":"5","key":"13_CR23","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1145\/366552.366600","volume":"6","author":"EH Sussenguth Jr","year":"1963","unstructured":"Sussenguth Jr., E.H.: Use of tree structures for processing files. Commun. ACM 6(5), 272\u2013279 (1963)","journal-title":"Commun. ACM"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Urbani, J., Maassen, J., Bal, H.: Massive semantic web data compression with MapReduce. In: HPDC, pp. 795\u2013802. ACM (2010)","DOI":"10.1145\/1851476.1851591"},{"issue":"7","key":"13_CR25","first-page":"517","volume":"6","author":"P Yuan","year":"2013","unstructured":"Yuan, P., Liu, P., Wu, B., Jin, H., Zhang, W., Liu, L.: TripleBit: a fast and compact system for large scale RDF data. VLDB 6(7), 517\u2013528 (2013)","journal-title":"VLDB"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web. Latest Advances and New Domains"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18818-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T00:04:00Z","timestamp":1589155440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18818-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319188171","9783319188188"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18818-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"21 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}