DOI : https://doi.org/10.18517/ijaseit.13.5.18438

The Formal Graph of APRDF

Dewi Wardani (1), Maria Ulfah Siregar (2), Ardhi Wijayanto (3), Yessi Yunitasari (4)
(1) Informatics Department, Universitas Sebelas Maret, Jl. Ir Sutami 36 A, Surakarta, 57126, Indonesia
(2) Information Technology Department, UIN Sunan Kalijaga, Jl. Marsda Adisucipto, Yogyakarta, 55282, Indonesia
(3) Informatics Department, Universitas Sebelas Maret, Jl. Ir Sutami 36 A, Surakarta, 57126, Indonesia
(4) Information Technology Department, Universitas PGRI Madiun, Jl. Setia Budi No. 85, Madiun, 63118, Indonesia
Fulltext View | Download
How to cite (IJASEIT) :
Wardani, Dewi, et al. “The Formal Graph of APRDF”. International Journal on Advanced Science, Engineering and Information Technology, vol. 13, no. 5, Oct. 2023, pp. 1615-21, doi:10.18517/ijaseit.13.5.18438.
Citation Format :
A new alternative model for expressing more complex knowledge has been proposed as an attributed predicate RDF (APRDF). By handling attributes that represent any additional triples of the main triple, APRDF serves as a predicate. Therefore, the formal graph model of APRDF must be defined. Lastly, this work recommends that the APRDF's conventional diagram is a digraph-hypergraph mix. The previous formal graph of RDF is a hypergraph even though, visually intuitively, it is a digraph. It also contains inconsistency. The other new serialization needs to describe its formal model. Eventually, this work can provide the formal graph model of APRDF and maintain consistency. There have been a few definitions proposed. The direct impact of this formal model is that APRDF outperformed the other model significantly when retrieving complex queries within its formal graph. In querying, the initial implementation of the proposed formal graph takes an average of 62 milliseconds. Compared to the other graph models, the proposed formal graph can reduce query time by an average of 90,7 milliseconds on the BF-arch graph and 121,05 milliseconds on the naive/default graph. As the formal graph model is preserved, the attributed predicate of APRDF assumed will drive a new model in the retrieving process that more in using a predicate formed as a link in a graph. It will also be impacted in the mining process by more elaborate links/edges (link mining).

D. Wardani, “Complete W3C-Semantic’s Interpretations of AP-RDF.,” IAENG International Journal of Computer Science, vol. 49, no. 3, 2022

G. Carothers, “RDF 1.1 N-Quads: A line-based syntax for RDF datasets,” W3C Recomm., 2014.

J. J. Carroll, C. Bizer, P. Hayes, and P. Stickler, “Named Graphs, Provenance and Trust,” in Proceedings of the 14th International Conference on World Wide Web, New York, NY, USA, 2005, pp. 613-622.

J. Tang, Y. Pan, Z. Wang, and L. Zhu, “Ontology Optimization Algorithm for Similarity Measuring and Ontology Mapping Using Adjoint Graph Framework.,” Eng. Lett., vol. 26, no. 3, 2018.

L. Gonzí¡lez and A. Hogan, “Modelling dynamics in semantic web knowledge graphs with formal concept analysis,” in Proceedings of the 2018 World Wide Web Conference, 2018, pp. 1175-1184.

P. Monnin, M. Lezoche, A. Napoli, and A. Coulet, “Using formal concept analysis for checking the structure of an ontology in LOD: Example of DBpedia,” in International Symposium on Methodologies for Intelligent Systems, 2017, pp. 674-683.

M. í. RodrıÌguez-GarcıÌa and R. Hoehndorf, “Inferring ontology graph structures using OWL reasoning,” BMC Bioinformatics, vol. 19, no. 1, p. 7, 2018.

D. T. Santosh and B. V. Vardhan, “Feature and sentiment based edgeed instance rdf data towards ontology based review categoriza- tion,” in Proceedings of the World Congress on Engineering, 2015, vol. 1. A. Chebotko, J. Abraham, P. Brazier, A. Piazza, A. Kashlev, and S. Lu, “Storing, Indexing and Querying Large Provenance Data Sets as RDF Graphs in Apache HBase,” in Services (SERVICES), 2013 IEEE Ninth World Congress on, 2013, pp. 1-8, doi: 10.1109/SERVICES.2013.32.

M. H. Kermani, Z. Guessoum, and Z. Boufaida, “A Two-Step Methodology for Dynamic Construction of a Protein Ontology.,” IAENG Int. J. Comput. Sci., vol. 46, no. 1, 2019.

J. Hayes and C. Gutierrez, “Bipartite Graphs as Intermediate Model for RDF,” in The Semantic Web - ISWC 2004, vol. 3298, SheilaA. McIlraith, D. Plexousakis, and F. van Harmelen, Eds. Springer Berlin Heidelberg, 2004, pp. 47-61.

R. Soussi, “SPIDER-Graph: A Model for Heterogeneous Graphs Extracted from a Relational Database,” in Conceptual Modeling, vol. 7532, P. Atzeni, D. Cheung, and S. Ram, Eds. Springer Berlin Heidelberg, 2012, pp. 543-552. S. Das, J. Srinivasan, M. Perry, E. I. Chong, and J. Banerjee, “A Tale of Two Graphs: Property Graphs as RDF in Oracle.,” in EDBT, 2014, pp. 762-773.

B. Wang and J. Li, “Edge-magic Total Labeling Algorithm of Unicyclic Graphs,” structure, vol. 2, p. 2, 2021. K. A. Bhat, G. Sudhakara, and others, “Antichain Graphs.,” IAENG International Journal of Applied Mathematics, vol. 51, no. 3, 2021.

C. Qi and J. Diao, “A Bio-Inspired Algorithm for Maximum Matching in Bipartite Graphs.,” IAENG International Journal of Computer Science, vol. 47, no. 1, 2020.

L. Lin, M. Zhang, and L. Ma, “Solving the Telecommunication Network Problem using Vague Graph.,” Engineering Letters, vol. 28, no. 4, 2020.

P. Kaur and P. Nand, “Towards Transparent Governance by Unifying Open Data.,” IAENG International Journal of Computer Science, vol. 48, no. 4, 2021.

G. Gallo, G. Longo, S. Pallottino, and S. Nguyen, “Directed hypergraphs and applications,” Discrete Appl. Math., vol. 42, no. 2-3, pp. 177-201, 1993.

Y. Sun and J. Han, “Mining Heterogeneous Information Networks: A Structural Analysis Approach,” SIGKDD Explor Newsl, vol. 14, no. 2, pp. 20-28, Apr. 2013.

Y. Li, C. Shi, PhilipS. Yu, and Q. Chen, “HRank: A Path Based Ranking Method in Heterogeneous Information Network,” in Web-Age Information Management, vol. 8485, F. Li, G. Li, S. Hwang, B. Yao, and Z. Zhang, Eds. Springer International Publishing, 2014, pp. 553-565.

Z. Zheng, Y. Ding, Z. Wang, and Z. Wang, “A novel method of keyword query for RDF data based on bipartite graph,” in 2016 IEEE 22nd International Conference on Parallel and Distributed Systems (ICPADS), 2016, pp. 466-473.

L. Nagy, T. Ruppert, and J. Abonyi, “Ontology-Based Analysis of Manufacturing Processes: Lessons Learned from the Case Study of Wire Harness Production,” Complexity, vol. 2021.

L. Zhao, Z. Liu, and J. Mbachu, “Highway alignment optimization: an integrated BIM and GIS approach,” ISPRS International Journal of Geo-Information, vol. 8, no. 4, p. 172, 2019.

Y. Li, Z. Jianhui, J. Liu, and Y. Hou, “Matching large scale ontologies based on filter and verification,” Mathematical Problems in Engineering, vol. 2020.

G. Honti and J. Abonyi, “Frequent Itemset Mining and Multi-Layer Network-Based Analysis of RDF Databases,” Mathematics, vol. 9, no. 4, p. 450, 2021.

A. A. Desouki, M. Rí¶der, and A.-C. Ngonga Ngomo, “Ranking on Very Large Knowledge Graphs,” in Proceedings of the 30th ACM Conference on Hypertext and Social Media, 2019, pp. 163-171.

J. Rouces, G. De Melo, and K. Hose, “Addressing structural and linguistic heterogeneity in the Web,” AI Communications, vol. 31, no. 1, pp. 3-18, 2018.

B. Makni and J. Hendler, “Deep learning for noise-tolerant RDFS reasoning,” Semantic Web, vol. 10, no. 5, pp. 823-862, 2019.

H. Liu, D. Dou, R. Jin, P. Lependu, and N. Shah, “Mining Biomedical Ontologies and Data Using RDF Hypergraphs,” in Machine Learning and Applications (ICMLA), 2013 12th International Conference on, Dec. 2013, vol. 1, pp. 141-146. doi: 10.1109/ICMLA.2013.31.

G. Wu, J.-Z. Li, J.-Q. Hu, and K.-H. Wang, “System Ï€: A native RDF repository based on the hypergraph representation for RDF data model,” Journal of Computer Science and Technology, vol. 24, no. 4, pp. 652-664, 2009

G. Gallo, G. Longo, S. Pallottino, and S. Nguyen, “Directed hypergraphs and applications,” Discrete Appl. Math., vol. 42, no. 2-3,pp. 177-201, 1993.

Y. Sun and J. Han, “Mining Heterogeneous Information Networks: A Structural Analysis Approach,” SIGKDD Explor Newsl, vol.14, no. 2, pp. 20-28, Apr. 2013.

Y. Li, C. Shi, PhilipS. Yu, and Q. Chen, “HRank: A Path Based Ranking Method in Heterogeneous Information Network,” in WebAge Information Management, vol. 8485, F. Li, G. Li, S. Hwang, B. Yao, and Z. Zhang, Eds. Springer International Publishing, 2014, pp. 553-565.

Y. Zhou and L. Liu, “Activity-edge Centric Multi-label Classification for Mining Heterogeneous Information Networks,” in Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, 2014, pp. 1276-1285.

P. Hayes and P. F. Patel-Schneider, “RDF 1.1 Semantics,” W3C Recomm., vol. 25, 2014.

D. Wardani, “The Evaluation of Semantic Mapping,” Journal of Physics: Conference Series, vol. 1500, p. 012101, Apr. 2020, doi:10.1088/1742-6596/1500/1/012101.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
    2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
    3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).