Finding isomorphism between RDF graphs | |
| Author | Sithu Naing |
| Call Number | AIT Thesis no.CS-03-04 |
| Subject(s) | Isomorphisms (Mathematics) Metadata |
| Note | A thesis study submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Advanced Technologies |
| Publisher | Asian Institute of Technology |
| Series Statement | Thesis ; no. CS-03-04 |
| Abstract | Resource Description Framework (RDF) recommended by the World Wide Web Consortium, is to model meta-data about the resources of the web. RDF is a fundamental lower layer of the semantic web. It describes graphs of statements about resources. Within RDF graphs, anonymous resources are considered as unlabelled in a graph. In this thesis, find out the equality of RDF graphs and traditional graphs. And show that Interactive vertex classification algorithm which is a standard graph isomorphism algorithm can be applied to check the isomorphic between RDF graphs effectively. |
| Year | 2003 |
| Corresponding Series Added Entry | Asian Institute of Technology. Thesis ; no. CS-03-04 |
| Type | Thesis |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Sadananda, R.; |
| Examination Committee(s) | Guha, Sumanta;Aekavut Sujarae; |
| Scholarship Donor(s) | Partial Scholarship Asian Institute of Technology; |
| Degree | Thesis (M.Sc.) - Asian Institute of Technology, 2003 |