{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:18:20Z","timestamp":1777889900548,"version":"3.51.4"},"reference-count":25,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SW"],"published-print":{"date-parts":[[2020,2,5]]},"DOI":"10.3233\/sw-180335","type":"journal-article","created":{"date-parts":[[2018,11,9]],"date-time":"2018-11-09T17:15:01Z","timestamp":1541783701000},"page":"337-359","source":"Crossref","is-referenced-by-count":5,"title":["HDT crypt : Compression and encryption of RDF datasets"],"prefix":"10.1177","volume":"11","author":[{"given":"Javier\u00a0D.","family":"Fern\u00e1ndez","sequence":"first","affiliation":[{"name":"Institute for Information Business, Vienna University of Economics and Business, Austria. E-mails:\u00a0javier.fernandez@wu.ac.at,\u00a0sabrina.kirrane@wu.ac.at,\u00a0axel.polleres@wu.ac.at,\u00a0simon.steyskal@wu.ac.at"},{"name":"Complexity Science Hub Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabrina","family":"Kirrane","sequence":"additional","affiliation":[{"name":"Institute for Information Business, Vienna University of Economics and Business, Austria. E-mails:\u00a0javier.fernandez@wu.ac.at,\u00a0sabrina.kirrane@wu.ac.at,\u00a0axel.polleres@wu.ac.at,\u00a0simon.steyskal@wu.ac.at"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Polleres","sequence":"additional","affiliation":[{"name":"Institute for Information Business, Vienna University of Economics and Business, Austria. E-mails:\u00a0javier.fernandez@wu.ac.at,\u00a0sabrina.kirrane@wu.ac.at,\u00a0axel.polleres@wu.ac.at,\u00a0simon.steyskal@wu.ac.at"},{"name":"Complexity Science Hub Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Steyskal","sequence":"additional","affiliation":[{"name":"Institute for Information Business, Vienna University of Economics and Business, Austria. E-mails:\u00a0javier.fernandez@wu.ac.at,\u00a0sabrina.kirrane@wu.ac.at,\u00a0axel.polleres@wu.ac.at,\u00a0simon.steyskal@wu.ac.at"},{"name":"CT RDA BAM CON-AT, Siemens AG, Austria. E-mail:\u00a0simon.steyskal@siemens.com"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"2","key":"10.3233\/SW-180335_ref1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10115-014-0770-y","article-title":"Compressed vertical partitioning for efficient RDF management","volume":"44","author":"\u00c1lvarez-Garc\u00eda","year":"2015","journal-title":"Knowl. Inf. Syst."},{"key":"10.3233\/SW-180335_ref2","doi-asserted-by":"crossref","unstructured":"W.\u00a0Beek, L.\u00a0Rietveld, H.R.\u00a0Bazoobandi, J.\u00a0Wielemaker and S.\u00a0Schlobach, LOD laundromat: A uniform way of publishing other people\u2019s dirty data, in: Proc. of ISWC, LNCS, Vol.\u00a08796, Springer, 2014, pp.\u00a0213\u2013228.","DOI":"10.1007\/978-3-319-11964-9_14"},{"key":"10.3233\/SW-180335_ref3","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, A.\u00a0Boldyreva and A.\u00a0O\u2019Neill, Deterministic and efficiently searchable encryption, in: Proc. of CRYPTO, Springer, 2007, pp.\u00a0535\u2013552.","DOI":"10.1007\/978-3-540-74143-5_30"},{"key":"10.3233\/SW-180335_ref5","doi-asserted-by":"crossref","unstructured":"O.\u00a0Cur\u00e9, G.\u00a0Blin, D.\u00a0Revuz and D.C.\u00a0Faye, WaterFowl: A\u00a0compact, self-indexed and inference-enabled immutable RDF store, in: Proc. of ESWC, LNCS, Vol.\u00a08465, 2014, pp.\u00a0302\u2013316.","DOI":"10.1007\/978-3-319-07443-6_21"},{"key":"10.3233\/SW-180335_ref6","doi-asserted-by":"crossref","unstructured":"R.\u00a0Curtmola, J.\u00a0Garay, S.\u00a0Kamara and R.\u00a0Ostrovsky, Searchable symmetric encryption: Improved definitions and efficient constructions, in: Proc. of CSS, ACM, 2006, pp.\u00a079\u201388.","DOI":"10.1145\/1180405.1180417"},{"key":"10.3233\/SW-180335_ref7","unstructured":"J.\u00a0Daemen and V.\u00a0Rijmen, The Design of Rijndael: AES\u00a0\u2013 the Advanced Encryption Standard, Springer, 2013. ISBN 3540425802."},{"key":"10.3233\/SW-180335_ref8","doi-asserted-by":"crossref","unstructured":"J.D.\u00a0Fern\u00e1ndez, S.\u00a0Kirrane, A.\u00a0Polleres and S.\u00a0Steyskal, Self-enforcing access control for encrypted RDF, in: Proc. of ESWC, 2017.","DOI":"10.1007\/978-3-319-58068-5_37"},{"key":"10.3233\/SW-180335_ref10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.websem.2013.01.002","article-title":"Binary RDF representation for publication and exchange","volume":"19","author":"Fern\u00e1ndez","year":"2013","journal-title":"J.\u00a0Web Semant."},{"key":"10.3233\/SW-180335_ref11","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, Fully homomorphic encryption using ideal lattices., in: Proc. of STOC, Vol.\u00a09, ACM, 2009, pp.\u00a0169\u2013178.","DOI":"10.1145\/1536414.1536440"},{"key":"10.3233\/SW-180335_ref12","doi-asserted-by":"crossref","unstructured":"S.\u00a0Gerbracht, Possibilities to encrypt an RDF-graph, in: Proc. of ICTTA, IEEE, 2008, pp.\u00a01\u20136.","DOI":"10.1109\/ICTTA.2008.4530288"},{"key":"10.3233\/SW-180335_ref13","doi-asserted-by":"crossref","unstructured":"M.\u00a0Giereth, On partial encryption of RDF-graphs., in: Proc. of ISWC, LNCS, Vol.\u00a03729, Springer, 2005, pp.\u00a0308\u2013322, http:\/\/dblp.uni-trier.de\/db\/conf\/semweb\/iswc2005.html#Giereth05. ISBN 3-540-29754-5.","DOI":"10.1007\/11574620_24"},{"issue":"3","key":"10.3233\/SW-180335_ref14","first-page":"216","article-title":"PRE4J\u00a0\u2013 a\u00a0partial RDF encryption API for Jena","volume":"70","author":"Giereth","year":"2006","journal-title":"ACAD MED"},{"issue":"2","key":"10.3233\/SW-180335_ref15","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","article-title":"LUBM: A\u00a0benchmark for OWL knowledge base systems","volume":"3","author":"Guo","year":"2005","journal-title":"JWS"},{"key":"10.3233\/SW-180335_ref16","first-page":"520","article-title":"Foundations of semantic web databases","volume":"77","author":"Guti\u00e9rrez","year":"2011","journal-title":"JCSS"},{"key":"10.3233\/SW-180335_ref17","unstructured":"S.\u00a0Harris and A.\u00a0Seaborne, SPARQL 1.1 Query Language, W3C Recomm., W3C, 2013."},{"key":"10.3233\/SW-180335_ref18","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2015.16"},{"key":"10.3233\/SW-180335_ref19","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.websem.2014.06.004","article-title":"Everything you always wanted to know about blank nodes","author":"Hogan","year":"2014","journal-title":"Journal of Web Semantics (JWS)"},{"key":"10.3233\/SW-180335_ref20","doi-asserted-by":"crossref","unstructured":"A.\u00a0Joshi, P.\u00a0Hitzler and G.\u00a0Dong, Logical linked data compression, in: Proc. of ESWC, LNCS, Vol.\u00a07882, Springer, 2013, pp.\u00a0170\u2013184.","DOI":"10.1007\/978-3-642-38288-8_12"},{"key":"10.3233\/SW-180335_ref21","unstructured":"A.\u00a0Kasten, A.\u00a0Scherp, F.\u00a0Armknecht and M.\u00a0Krause, Towards search on encrypted graph data, in: Proc. of PrivOn\u201914, Vol.\u00a01121, CEUR-WS.org, 2013, pp.\u00a046\u201357."},{"key":"10.3233\/SW-180335_ref22","first-page":"1","article-title":"Predicate encryption supporting disjunctions, polynomial equations, and inner products","author":"Katz","year":"2013","journal-title":"J.\u00a0Cryptology"},{"key":"10.3233\/SW-180335_ref23","doi-asserted-by":"publisher","DOI":"10.1186\/s13326-017-0112-6"},{"key":"10.3233\/SW-180335_ref24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.is.2018.03.002","article-title":"Grammar-based graph compression","volume":"76","author":"Maneth","year":"2018","journal-title":"Information Systems"},{"key":"10.3233\/SW-180335_ref25","doi-asserted-by":"crossref","unstructured":"M.A.\u00a0Mart\u00ednez-Prieto, M.\u00a0Arias and J.D.\u00a0Fern\u00e1ndez, Exchange and consumption of huge RDF data, in: Proc. of ESWC, LNCS, Vol.\u00a07295, Springer, 2012, pp.\u00a0437\u2013452.","DOI":"10.1007\/978-3-642-30284-8_36"},{"issue":"2","key":"10.3233\/SW-180335_ref26","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/2340416.2340422","article-title":"Querying RDF dictionaries in compressed space","volume":"12","author":"Mart\u00ednez-Prieto","year":"2012","journal-title":"SIGAPP Appl. Comput. Rev."},{"key":"10.3233\/SW-180335_ref28","doi-asserted-by":"crossref","unstructured":"R.\u00a0Pichler, A.\u00a0Polleres, S.\u00a0Skritek and S.\u00a0Woltran, Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries, SWJ 4(4) (2013).","DOI":"10.3233\/SW-2012-0076"}],"container-title":["Semantic Web"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SW-180335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:24:18Z","timestamp":1777613058000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SW-180335"}},"subtitle":[],"editor":[{"given":"Ruben","family":"Verborgh","sequence":"additional","affiliation":[{"name":"Ghent University\u00a0\u2013 imec, Belgium"}],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,2,5]]},"references-count":25,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/sw-180335","relation":{},"ISSN":["2210-4968","1570-0844"],"issn-type":[{"value":"2210-4968","type":"electronic"},{"value":"1570-0844","type":"print"}],"subject":[],"published":{"date-parts":[[2020,2,5]]}}}