{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:40:00Z","timestamp":1740112800686,"version":"3.37.3"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003329","name":"MINECO","doi-asserted-by":"publisher","award":["TIN2016-78011-C4-1-R"],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["731601"],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004955","name":"Austrian Research Promotion Agency","doi-asserted-by":"publisher","award":["861213"],"id":[{"id":"10.13039\/501100004955","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1016\/j.ins.2019.08.081","type":"journal-article","created":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T16:22:46Z","timestamp":1567095766000},"page":"234-259","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"special_numbering":"C","title":["RDF-TR: Exploiting structural redundancies to boost RDF compression"],"prefix":"10.1016","volume":"508","author":[{"given":"Antonio","family":"Hern\u00e1ndez-Illera","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4418-561X","authenticated-orcid":false,"given":"Miguel A.","family":"Mart\u00ednez-Prieto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2683-827X","authenticated-orcid":false,"given":"Javier D.","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ins.2019.08.081_bib0001","doi-asserted-by":"crossref","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":"2014","journal-title":"Knowl. Inform. Syst."},{"key":"10.1016\/j.ins.2019.08.081_bib0002","series-title":"Proceedings of the International Conference on World Wide Web (WWW)","first-page":"41","article-title":"Matrix \u201cBit\u201d loaded: A scalable lightweight join query processor for RDF data","author":"Atre","year":"2010"},{"key":"10.1016\/j.ins.2019.08.081_bib0003","series-title":"Proceedings of the International Semantic Web Conference (ISWC)","first-page":"11","article-title":"DBpedia: A nucleus for a web of open data","author":"Auer","year":"2007"},{"key":"10.1016\/j.ins.2019.08.081_bib0004","article-title":"Shape expressions (ShEx) primer","author":"Baker","year":"2017","journal-title":"Draft Commun. Group Rep. 14 July 2017"},{"year":"2014","series-title":"RDF 1.1 N-Triples","author":"Beckett","key":"10.1016\/j.ins.2019.08.081_sbref0005"},{"year":"2014","series-title":"RDF 1.1 Turtle","author":"Beckett","key":"10.1016\/j.ins.2019.08.081_sbref0006"},{"key":"10.1016\/j.ins.2019.08.081_bib0007","unstructured":"P.A. Bonatti, M. Cochez, S. Decker, A. Polleres, V. Presutti (Eds.), Knowledge graphs: new directions for knowledge representation on the semantic web, Schloss Dagstuhl, Germany, 2018. To appear, http:\/\/polleres.net\/bona-etal-DagstuhlReport18371.pdf."},{"key":"10.1016\/j.ins.2019.08.081_bib0008","series-title":"Proceedings of the International Symposium on String Processing and Information Retrieval (SPIRE)","first-page":"103","article-title":"A compact RDF store using suffix arrays","author":"Brisaboa","year":"2015"},{"issue":"1","key":"10.1016\/j.ins.2019.08.081_bib0009","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.is.2013.08.003","article-title":"Compact representation of web graphs with extended functionality","volume":"39","author":"Brisaboa","year":"2014","journal-title":"Inform. Syst."},{"year":"1997","series-title":"Compact PAT trees","author":"Clark","key":"10.1016\/j.ins.2019.08.081_bib0010"},{"key":"10.1016\/j.ins.2019.08.081_bib0011","series-title":"Proceedings of the Extended Semantic Web Conference (ESWC)","first-page":"302","article-title":"WaterFowl: A compact, self-indexed and inference-enabled immutable RDF store","author":"Cur\u00e9","year":"2014"},{"key":"10.1016\/j.ins.2019.08.081_bib0012","series-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","first-page":"145","article-title":"Apples and oranges: a comparison of RDF benchmarks and real RDF datasets","author":"Duan","year":"2011"},{"issue":"2","key":"10.1016\/j.ins.2019.08.081_bib0013","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","article-title":"Universal codeword sets and representations of the integers","volume":"IT-21","author":"Elias","year":"1975","journal-title":"IEEE Trans. Inform. Theo."},{"key":"10.1016\/j.ins.2019.08.081_bib0014","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.scs.2018.02.019","article-title":"Managing big RDF data in clouds: challenges, opportunities, and solutions","author":"Elzein","year":"2018","journal-title":"Sustain. Cities Soc."},{"year":"2011","series-title":"Binary RDF representation for publication and exchange (HDT)","author":"Fern\u00e1ndez","key":"10.1016\/j.ins.2019.08.081_sbref0014"},{"key":"10.1016\/j.ins.2019.08.081_bib0016","doi-asserted-by":"crossref","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. Web Semant."},{"issue":"2","key":"10.1016\/j.ins.2019.08.081_bib0017","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1177\/0165551516677945","article-title":"Characterizing RDF datasets","volume":"44","author":"Fern\u00e1ndez","year":"2018","journal-title":"J. Inform. Sci."},{"key":"10.1016\/j.ins.2019.08.081_bib0018","series-title":"Proceedings of the Database Systems for Advanced Applications (DASFAA) International Workshops","first-page":"362","article-title":"Detect redundant RDF data by rules","author":"Guang","year":"2016"},{"key":"10.1016\/j.ins.2019.08.081_bib0019","series-title":"Proceedings of Semantic Web Evaluation Challenge (SemWebEval)","first-page":"170","article-title":"SemStim at the LOD-RecSys 2014 challenge","author":"Heitmann","year":"2014"},{"key":"10.1016\/j.ins.2019.08.081_bib0020","series-title":"Proceedings of the Data Compression Conference (DCC)","first-page":"363","article-title":"Serializing RDF in compressed space","author":"Hern\u00e1ndez-Illera","year":"2015"},{"key":"10.1016\/j.ins.2019.08.081_bib0021","series-title":"Proceedings of the International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA\/AIE)","first-page":"732","article-title":"Optimizing RDF storage removing redundancies: an algorithm","author":"Iannone","year":"2005"},{"key":"10.1016\/j.ins.2019.08.081_bib0022","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.websem.2018.02.002","article-title":"Impact analysis of data placement strategies on query efforts in distributed RDF stores","volume":"50","author":"Janke","year":"2018","journal-title":"J. Web Semant."},{"key":"10.1016\/j.ins.2019.08.081_bib0023","series-title":"Proceedings of the Extended Semantic Web Conference (ESWC)","first-page":"170","article-title":"Logical linked data compression","author":"Joshi","year":"2013"},{"key":"10.1016\/j.ins.2019.08.081_bib0024","series-title":"Proceedings of the Joint International Conference on Semantic Technology (JIST)","first-page":"73","article-title":"Alignment aware linked data compression","author":"Joshi","year":"2016"},{"issue":"6","key":"10.1016\/j.ins.2019.08.081_bib0025","doi-asserted-by":"crossref","first-page":"853","DOI":"10.3233\/SW-160238","article-title":"A systematic analysis of term reuse and term overlap across biomedical ontologies","volume":"8","author":"Kamdar","year":"2017","journal-title":"Semantic Web"},{"key":"10.1016\/j.ins.2019.08.081_bib0026","article-title":"Shapes constraint language (SHACL)","author":"Knublauch","year":"2017","journal-title":"W3C Recommendation"},{"key":"10.1016\/j.ins.2019.08.081_bib0027","series-title":"Proceedings of the Symposium on Applied Computing (SAC)","first-page":"1960","article-title":"Measuring structural similarity between RDF graphs","author":"Maillot","year":"2018"},{"key":"10.1016\/j.ins.2019.08.081_bib0028","doi-asserted-by":"crossref","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":"Inform. Syst."},{"year":"2004","series-title":"RDF primer","author":"Manola","key":"10.1016\/j.ins.2019.08.081_sbref0028"},{"key":"10.1016\/j.ins.2019.08.081_bib0030","series-title":"Proceedings of the Extended Semantic Web Conference (ESWC)","first-page":"437","article-title":"Exchange and consumption of huge RDF data","author":"Mart\u00ednez-Prieto","year":"2012"},{"key":"10.1016\/j.ins.2019.08.081_bib0031","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.is.2015.08.008","article-title":"Practical compressed string dictionaries","volume":"56","author":"Mart\u00ednez-Prieto","year":"2016","journal-title":"Inform. Syst."},{"key":"10.1016\/j.ins.2019.08.081_bib0032","series-title":"ACM International Symposium on Applied Computing (SAC)","first-page":"1841","article-title":"Compression of RDF dictionaries","author":"Mart\u00ednez-Prieto","year":"2012"},{"key":"10.1016\/j.ins.2019.08.081_bib0033","series-title":"Encyclopedia of Big Data Technologies","article-title":"RDF compression","author":"Mart\u00ednez-Prieto","year":"2018"},{"key":"10.1016\/j.ins.2019.08.081_bib0034","series-title":"Proceedings of the International Conference on Web Reasoning and Rule Systems (RR)","first-page":"89","article-title":"Towards rule-based minimization of RDF graphs under constraints","author":"Meier","year":"2008"},{"key":"10.1016\/j.ins.2019.08.081_sbref0034","series-title":"Proc. of The Web Conference","article-title":"SaGe: web preemption for public SPARQL query services","author":"Minier","year":"2019"},{"year":"2012","series-title":"OWL 2 web ontology language profiles","author":"Motik","key":"10.1016\/j.ins.2019.08.081_sbref0035"},{"year":"2016","series-title":"Compact data structures \u2013 a practical approach","author":"Navarro","key":"10.1016\/j.ins.2019.08.081_bib0037"},{"key":"10.1016\/j.ins.2019.08.081_bib0038","series-title":"Proceedings of the International Conference on Data Engineering","first-page":"984","article-title":"Characteristic sets: accurate cardinality estimation for RDF queries with multiple joins","author":"Neumann","year":"2011"},{"key":"10.1016\/j.ins.2019.08.081_bib0039","series-title":"Proceedings of the Joint International Conference on Semantic Technology (JIST)","first-page":"239","article-title":"Graph pattern based RDF data compression","author":"Pan","year":"2015"},{"key":"10.1016\/j.ins.2019.08.081_sbref0039","series-title":"Technical Report","article-title":"SSP: compressing RDF data by summarisation, serialisation and predictive encoding","author":"Pan","year":"2014"},{"key":"10.1016\/j.ins.2019.08.081_bib0041","series-title":"Proceedings of the International Conference on Web Reasoning and Rule Systems (RR)","first-page":"133","article-title":"Towards rule-based minimization of RDF graphs under constraints","author":"Pichler","year":"2010"},{"issue":"2","key":"10.1016\/j.ins.2019.08.081_bib0042","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/S0196-6774(03)00087-7","article-title":"New text indexing functionalities of the compressed suffix arrays","volume":"48","author":"Sadakane","year":"2003","journal-title":"J. Algorithm."},{"year":"2007","series-title":"Data compression: the complete reference","author":"Salomon","key":"10.1016\/j.ins.2019.08.081_bib0043"},{"year":"2007","series-title":"Variable-length codes for data compression","author":"Salomon","key":"10.1016\/j.ins.2019.08.081_bib0044"},{"year":"2014","series-title":"RDF 1.1 Primer","author":"Schreiber","key":"10.1016\/j.ins.2019.08.081_sbref0044"},{"key":"10.1016\/j.ins.2019.08.081_bib0046","series-title":"Proceedings of the Symposium on Languages, Applications and Technologies (SLATE)","first-page":"224","article-title":"OFR: an efficient representation of RDF datasets","author":"Swacha","year":"2015"},{"key":"10.1016\/j.ins.2019.08.081_bib0047","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.websem.2018.08.001","article-title":"Triple storage for random-access versioned querying of RDF archives","volume":"54","author":"Taelman","year":"2019","journal-title":"J. Web Semant."},{"key":"10.1016\/j.ins.2019.08.081_bib0048","series-title":"Proceedings of the International Conference on Conceptual Modeling (ER)","first-page":"261","article-title":"Toward RDF normalization","author":"Ticona-Herrera","year":"2015"},{"key":"10.1016\/j.ins.2019.08.081_bib0049","series-title":"Proceedings of the Annual ACM Symposium on Applied Computing (SAC)","first-page":"396","article-title":"Horn-rule based compression technique for RDF data","author":"Venkataraman","year":"2015"},{"key":"10.1016\/j.ins.2019.08.081_bib0050","series-title":"Proceedings of the International Semantic Web Conference (ISWC)","first-page":"180","article-title":"Querying datasets on the web with high availability","author":"Verborgh","year":"2014"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025519308308?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025519308308?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T07:38:16Z","timestamp":1655969896000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025519308308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":50,"alternative-id":["S0020025519308308"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2019.08.081","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2020,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"RDF-TR: Exploiting structural redundancies to boost RDF compression","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2019.08.081","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}