Acknowledgement
This work was supported by Electronics and Telecommunications Research Institute(ETRI) grant funded by the Korean government. [21ZS1100, Core Technology Research for Self-Improving Integrated Artificial Intelligence System]
References
- T. R. Gruber, A translation approach to portable ontology specifications, Knowl. Acquis. 5 (1993), no. 2, 199-220. https://doi.org/10.1006/knac.1993.1008
- Wikipedia, Available from: https://en.wikipedia.org/wiki/DBpedia
- Wikipedia, Available from: https://en.wikipedia.org/wiki/Freebase_(database)
- F. M. Suchanek, G. Kasneci, and G. Weikum, Yago: A core of semantic knowledge unifying WordNet and Wikipedia, in Proc. Int. World Wide Web Conf. (WWW), (Banff, Canada), May 2007, pp. 697-706.
- Gene Ontology, Available from: http://geneontology.org/docs/ontology-documentation
- Wikipedia, Available from: https://en.wikipedia.org/wiki/Semantic_Web
- A. Bouziane et al., Question answering systems: Survey and trends, Proc. Comput. Sci. 73 (2015), 366-375. https://doi.org/10.1016/j.procs.2015.12.005
- Z. Zhu et al., Mucko: Multi-layer cross-modal knowledge reasoning for fact-based visual question answering, in Proc. Int. Joint Conf. Artif. Intell. (IJCAI), June 2020, pp. 1097-1103.
- D. A. Hudson and C. D. Manning, GQA: A new dataset for real-world visual reasoning and compositional question answering, in Proc. IEEE/CVF Conf. Comput. Vis. Pattern Recognit. (CVPR), (Long Beach, CA, USA), June 2019, pp. 6700-6709.
- Apache Jena, Available from: https://jena.apache.org
- E. Sirin et al., Pellet: A practical OWL-DL reasoner, J. Web Semant. 5 (2007), no. 2, 51-53. https://doi.org/10.1016/j.websem.2007.03.004
- D. Tsarkov and I. Horrocks, Fact++ description logic reasoner: System description, in Automated Reasoning, vol. 4130, Springer, Berlin, Heidelberg, Germany, 2006, pp. 292-297.
- B. Motik, Reasoning in description logics using resolution and deductive databases, Ph.D. dissertation, Universitat Karlsruhe, Karlsruhe, Germany, 2006.
- Y. A. Ameur et al., Ontologies in engineering: The OntoDB/OntoQL platform, Soft Comput. 21 (2017), no. 2, 369-389. https://doi.org/10.1007/s00500-015-1633-5
- H. Dehainsala, G. Pierra, and L. Bellatreche, Ontodb: An ontology-based database for data intensive applications, in Advances in Databases: Concepts, Systems and Applications, vol. 4443, Springer, Berlin, Heidelberg, Germany, 2007, pp. 497-508.
- S. Jean, Y. A. Ameur, and G. Pierra, Querying ontology based databases-The Ontoql proposal, in Proc. Int. Conf. Softw. Engi. Knowl. Eng. (SEKE'2006), (San Francisco, CA, USA), July 2006, pp. 166-171.
- M.-J. Lee et al., Ontoms2: An efficient and scalable ontology management system with an incremental reasoning, in Proc. Int. Semant. Web Conf. (Posters & Demos), (Sydney, Australia), Oct. 2013, pp. 153-156.
- M.-J. Park et al., An efficient and scalable management of ontology, in Advances in Databases: Concepts, Systems and Applications, vol. 4443, Berlin, Heidelberg, Germany, 2007, pp. 975-980.
- Wikipedia, Available from: https://en.wikipedia.org/wiki/Web_Ontology_Language
- A. ALAmri, The relational database layout to store ontology knowledge base, in Proc. Int. Conf. Inf. Retr. Knowl. Manag. (Kuala Lumpur, Malaysia), Mar. 2012, pp. 74-81.
- F. Zhang, Z. M. Ma, and W. Li, Storing, OWL ontologies in object-oriented databases, Knowl.-Based Syst. 76 (2015), 240-255. https://doi.org/10.1016/j.knosys.2014.12.020
- Wikipedia, Available from: https://en.wikipedia.org/wiki/Graph_database
- C. Buragohain et al., A1: A distributed in-memory graph database, in Proc. ACM SIGMOD Int. Conf. Manag. Data (Portland, OR, USA), June 2020, pp. 329-344.
- N. Francis et al., Cypher: An evolving query language for property graphs, in Proc. Int. Conf. Manag. Data (Houston, TX, USA), June 2018, pp. 1433-1445.
- A. Green et al., Updating graph databases with cypher, Proc. VLDB Endowment 12 (2019), no. 12, 2242-2253. https://doi.org/10.14778/3352063.3352139
- C. Kankanamge et al., Graphflow: An active graph database, in Proc. ACM Int. Conf. Manag. Data (Chicago, IL, USA), May 2017, pp. 1695-1698.
- C. Wang et al., FERRARI: Aan efficient framework for visual exploratory subgraph search in graph databases, VLDB J. 29 (2020), no. 5, 973-998. https://doi.org/10.1007/s00778-020-00601-0
- M. Elbattah et al., Large-scale ontology storage and query using graph database-oriented approach: the case of freebase, in Proc. IEEE Int. Conf. Intell. Comput. Inf. Syst. (ICICIS), (Cairo, Egypt), Dec. 2015, pp. 39-43.
- S. Pai and L. Costabello, Learning embeddings from knowledge graphs with numeric edge attributes, in Proc. Int. Joint Conf. Artif. Intell. (IJCAI), Aug. 2021, pp. 2869-2875.
- T. Trouillon et al., Complex embeddings for simple link prediction, in Proc. Int. Conf. Mach. Learn. (ICML), (New York, NY, USA), June 2016, pp. 2071-2080.
- J. Xu et al., Knowledge graph representation with jointly structural and textual encoding, in Proc. Int. Joint Conf. Artif. Intell. (IJCAI), (Melbourne, Australia), Aug. 2017, pp. 1318-1324.
- R. Agrawal, A. Borgida, and H. V. Jagadish, Efficient management of transitive relationships in large data and knowledge bases, ACM SIGMOD Record 18 (1989), no. 2, 253-262. https://doi.org/10.1145/66926.66950
- E. Cohen et al., Reachability and distance queries via 2-hop labels, in Proc. Annu. ACM-SIAM Symp. Discret. Algorithms (SODA), (San Francisco, CA, USA), Jan. 2002, pp. 937-946.
- M. Du et al., HT: A novel labeling scheme for k-hop reachability queries on dags, IEEE Access 7 (2019), 172110-172122. https://doi.org/10.1109/ACCESS.2019.2956557
- R. Jin et al., Efficiently answering reachability queries on very large directed graphs, in Proc. ACM SIGMOD Int. Conf. Manag. Data (Vancouver, Canada), June 2008, pp. 595-608.
- J. Su et al., Reachability querying: Can it be even faster?, IEEE Trans. Knowl. Data Eng. 29 (2017), no. 3, 683-697. https://doi.org/10.1109/TKDE.2016.2631160
- H. Wang et al., Dual labeling: Answering graph reachability queries in constant time, in Proc. Int. Conf. Data Eng. (ICDE), (Atlanta, GA, USA), Apr. 2006, pp. 75-75.
- H. Wei et al., Reachability querying: An independent permutation labeling approach, Proc. VLDB Endowment 7 (2014), no. 12, 1191-1202. https://doi.org/10.14778/2732977.2732992
- H. Wei et al., Reachability querying: An independent permutation labeling approach, VLDB J. 27 (2018), no. 1, 1-26. https://doi.org/10.1007/s00778-017-0468-3
- Neo4j, Available from: https://neo4j.com/
- J.-K. Min, J. Lee, and C.-W. Chung, An efficient encoding and labeling for dynamic XML data, in International Conference on Database Systems for Advanced Applications, vol. 4443, Springer, Berlin, Heidelberg, Germany, 2007, pp. 715-726.
- C. Zhang et al., On supporting containment queries in relational database management system, in Proc. ACM SIGMOD Int. Conf. Manag. Data (Santa Barbara, CA, USA), May 2001, pp. 425-436.