{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:02:20Z","timestamp":1760598140554,"version":"build-2065373602"},"reference-count":37,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T00:00:00Z","timestamp":1648252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>The explosive volume of semantic data published in the Resource Description Framework (RDF) data model demands efficient management and compression with better compression ratio and runtime. Although extensive work has been carried out for compressing the RDF datasets, they do not perform well in all dimensions. However, these compressors rarely exploit the graph patterns and structural regularities of real-world datasets. Moreover, there are a variety of existing approaches that reduce the size of a graph by using a grammar-based graph compression algorithm. In this study, we introduce a novel approach named gRDF (graph repair for RDF) that uses gRePair, one of the most efficient grammar-based graph compression schemes, to compress the RDF dataset. In addition to that, we have improved the performance of HDT (header-dictionary-triple), an efficient approach for compressing the RDF datasets based on structural properties, by introducing modified HDT (M-HDT). It can detect the frequent graph pattern by employing the data-structure-oriented approach in a single pass from the dataset. In our proposed system, we use M-HDT for indexing the nodes and edge labels. Then, we employ gRePair algorithm for identifying the grammar from the RDF graph. Afterward, the system improves the performance of k2-trees by introducing a more efficient algorithm to create the trees and serialize the RDF datasets. Our experiments affirm that the proposed gRDF scheme can substantially achieve at approximately 26.12%, 13.68%, 6.81%, 2.38%, and 12.76% better compression ratio when compared with the most prominent state-of-the-art schemes such as HDT, HDT++, k2-trees, RDF-TR, and gRePair in the case of real-world datasets. Moreover, the processing efficiency of our proposed scheme also outperforms others.<\/jats:p>","DOI":"10.3390\/s22072545","type":"journal-article","created":{"date-parts":[[2022,3,27]],"date-time":"2022-03-27T21:31:25Z","timestamp":1648416685000},"page":"2545","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["gRDF: An Efficient Compressor with Reduced Structural Regularities That Utilizes gRePair"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3896-5591","authenticated-orcid":false,"given":"Tangina","family":"Sultana","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Kyung Hee University, Global Campus, Yongin-si 17104, Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2314-5395","authenticated-orcid":false,"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Kyung Hee University, Global Campus, Yongin-si 17104, Korea"}]}],"member":"1968","published-online":{"date-parts":[[2022,3,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"He, H., Balakrishnan, A., Eric, M., and Liang, P. (2017). Learning symmetric collaborative dialogue agents with dynamic knowledge graph embeddings. arXiv.","DOI":"10.18653\/v1\/P17-1162"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Young, T., Cambria, E., Chaturvedi, I., Zhou, H., Biswas, S., and Huang, M. (2018, January 2\u20137). Augmenting end-to-end dialogue systems with commonsense knowledge. Proceedings of the AAAI Conference on Artificial Intelligence, New Orleans, LA, USA.","DOI":"10.1609\/aaai.v32i1.11923"},{"key":"ref_3","unstructured":"Berant, J., Chou, A., Frostig, R., and Liang, P. (2013, January 18\u201321). Semantic parsing on freebase from question-answer pairs. Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, Seattle, WA, USA."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.websem.2013.05.006","article-title":"Evaluating question answering over linked data","volume":"21","author":"Lopez","year":"2013","journal-title":"J. Web Semant."},{"key":"ref_5","unstructured":"Singhal, A. (2022, February 16). Introducing the Knowledge Graph: Things, Not Strings. Official Google Blog, Available online: https:\/\/blog.google\/products\/search\/introducing-knowledge-graph-things-not\/."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, J.D., Gutierrez, C., and Mart\u00ednez-Prieto, M.A. (2010, January 26\u201330). RDF compression: Basic approaches. Proceedings of the 19th International Conference on World Wide Web, Raleigh, NC, USA.","DOI":"10.1145\/1772690.1772819"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, J.D., Mart\u00ednez-Prieto, M.A., and Gutierrez, C. (2010). Compact representation of large RDF data sets for publishing and exchange. The Semantic Web\u2014ISWC 2010, Proceedings of the International Semantic Web Conference, Shanghai, China, 7\u201311 November 2010, Springer.","DOI":"10.1007\/978-3-642-17746-0_13"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.ins.2019.08.081","article-title":"RDF-TR: Exploiting structural redundancies to boost RDF compression","volume":"508","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_9","unstructured":"\u00c1lvarez-Garc\u00eda, S., Brisaboa, N.R., Fern\u00e1ndez, J.D., and Mart\u00ednez-Prieto, M.A. (2011). Compressed k2-triples for full-in-memory RDF engines. arXiv."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Iannone, L., Palmisano, I., and Redavid, D. (2005). Optimizing RDF storage removing redundancies: An Algorithm. Innovations in Applied Artificial Intelligence, Proceedings of the International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, Bari, Italy, 22\u201324 June 2005, Springer.","DOI":"10.1007\/11504894_101"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Joshi, A.K., Hitzler, P., and Dong, G. (2013). Logical linked data compression. The Semantic Web: Semantics and Big Data, Proceedings of the Extended Semantic Web Conference, Montpellier, France, 26\u201330 May 2013, Springer.","DOI":"10.1007\/978-3-642-38288-8_12"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Sultana, T., and Lee, Y.K. (2021, January 17\u201320). Expressive Rule Pattern Based Compression with Ranking in Horn Rules on RDF Style KB. Proceedings of the 2021 IEEE International Conference on Big Data and Smart Computing (BigComp), Jeju Island, Korea.","DOI":"10.1109\/BigComp51126.2021.00012"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Grimm, S., and Wissmann, J. (2011). Elimination of redundancy in ontologies. The Semantic Web: Research and Applications, Proceedings of the Extended Semantic Web Conference, Crete, Greece, 29 May\u20132 June 2011, Springer.","DOI":"10.1007\/978-3-642-21034-1_18"},{"key":"ref_14","first-page":"1","article-title":"RDF\/XML syntax specification (revised)","volume":"10","author":"Beckett","year":"2004","journal-title":"W3C Recomm."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"517","DOI":"10.14778\/2536349.2536352","article-title":"TripleBit: A fast and compact system for large scale RDF data","volume":"6","author":"Yuan","year":"2013","journal-title":"Proc. Vldb Endow."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/2340416.2340422","article-title":"Querying RDF dictionaries in compressed space","volume":"12","year":"2012","journal-title":"ACM SIGAPP Appl. Comput. Rev."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.websem.2013.01.002","article-title":"Binary RDF representation for publication and exchange (HDT)","volume":"19","author":"Polleres","year":"2013","journal-title":"J. Web Semant."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Hern\u00e1ndez-Illera, A., Mart\u00ednez-Prieto, M.A., and Fern\u00e1ndez, J.D. (2015, January 7\u20139). Serializing RDF in compressed space. Proceedings of the 2015 Data Compression Conference, Snowbird, UT, USA.","DOI":"10.1109\/DCC.2015.16"},{"key":"ref_19","unstructured":"Sultana, T., Qudus, U., Umair, M., Kim, T., Morshed, M.G., and Lee, Y.K. (2021, January 2\u20134). Efficient Frequent Pattern Management and Compression System in Multiple Named Graphs. Proceedings of the KIISE Korea Computer Congress 2020 (KCC 2020), Busan, Korea."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Brisaboa, N.R., Ladra, S., and Navarro, G. (2009). k2-trees for compact web graph representation. String Processing and Information Retrieval, Proceedings of the International Symposium on String Processing and Information Retrieval, Saariselk\u00e4, Finland, 25\u201327 August 2009, Springer.","DOI":"10.1007\/978-3-642-03784-9_3"},{"key":"ref_21","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":"Inf. Syst."},{"key":"ref_22","unstructured":"Sultana, T., and Lee, Y.K. (2021, January 12\u201313). Employing Graph Compression Technique for Efficiently Compressing RDF Knowledge Graphs. Proceedings of the Korean Database Conference 2021 (KDBC 2021), Daejeon, Korea."},{"key":"ref_23","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":"Brisaboa","year":"2015","journal-title":"Knowl. Inf. Syst."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Prieto, M.A., Fern\u00e1ndez, J.D., and C\u00e1novas, R. (2012, January 26\u201330). Compression of RDF dictionaries. Proceedings of the 27th Annual ACM Symposium on Applied Computing, Trento, Italy.","DOI":"10.1145\/2245276.2245343"},{"key":"ref_25","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":"Inf. Syst."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Brisaboa, N.R., Cerdeira-Pena, A., Farina, A., and Navarro, G. (2015). A compact RDF store using suffix arrays. String Processing and Information Retrieval, Proceedings of the International Symposium on String Processing and Information Retrieval, London, UK, 1\u20134 September 2015, Springer.","DOI":"10.1007\/978-3-319-23826-5_11"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Swacha, J., and Grabowski, S. (2015). OFR: An Efficient Representation of RDF Datasets. International Symposium on Languages, Applications and Technologies, Springer.","DOI":"10.1007\/978-3-319-27653-3_22"},{"key":"ref_28","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. Algorithms"},{"key":"ref_29","unstructured":"Salomon, D. (2004). Data Compression: The complete Reference, Springer Science & Business Media."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Meier, M. (2008). Towards rule-based minimization of RDF graphs under constraints. Web Reasoning and Rule Systems, Proceedings of the International Conference on Web Reasoning and Rule Systems, Karlsruhe, Germany, 31 October 31\u20131 November 2008, Springer.","DOI":"10.1007\/978-3-540-88737-9_8"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Pichler, R., Polleres, A., Skritek, S., and Woltran, S. (2010). Redundancy elimination on RDF graphs in the presence of rules, constraints, and queries. Web Reasoning and Rule Systems, Proceedings of the International Conference on Web Reasoning and Rule Systems, Bressanone\/Brixen, Italy, 22\u201324 September 2010, Springer.","DOI":"10.1007\/978-3-642-15918-3_11"},{"key":"ref_32","unstructured":"Pan, J.Z., P\u00e9rez, J.M.G., Ren, Y., Wu, H., Wang, H., and Zhu, M. (2014). Graph pattern based RDF data compression. Semantic Technology, Proceedings of the Joint International Semantic Technology Conference, Chiang Mai, Thailand, 9\u201311 November 2014, Springer."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Gayathri, V., and Kumar, P.S. (2015, January 13\u201317). Horn-rule based compression technique for RDF data. Proceedings of the 30th Annual ACM Symposium on Applied Computing, Salamanca, Spain.","DOI":"10.1145\/2695664.2695858"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Guang, T., Gu, J., and Huang, L. (2016). Detect redundant rdf data by rules. Database Systems for Advanced Applications, Proceedings of the International Conference on Database Systems for Advanced Applications, Dallas, TX, USA, 16\u201319 April 2016, Springer.","DOI":"10.1007\/978-3-319-32055-7_30"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Ding, L., and Finin, T. (2006). Characterizing the semantic web on the web. The Semantic Web\u2014ISWC 2006, Proceedings of the International Semantic Web Conference, Athens, GA, USA, 5\u20139 November 2006, Springer.","DOI":"10.1007\/11926078_18"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1109\/TKDE.2007.190735","article-title":"On graph features of semantic web schemas","volume":"20","author":"Theoharis","year":"2008","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, N., Arias, J., S\u00e1nchez, L., Fuentes-Lorenzo, D., and Corcho, \u00d3. (2014). RDSZ: An approach for lossless RDF stream compression. The Semantic Web: Trends and Challenges, Proceedings of the European Semantic Web Conference, Crete, Greece, 25\u201329 May 2014, Springer.","DOI":"10.1007\/978-3-319-07443-6_5"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/7\/2545\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:43:49Z","timestamp":1760136229000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/7\/2545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,26]]},"references-count":37,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,4]]}},"alternative-id":["s22072545"],"URL":"https:\/\/doi.org\/10.3390\/s22072545","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2022,3,26]]}}}