Finding isomorphism between RDF graphs
Call Number: AIT Thesis no.CS-03-04 Material type:
SeriesSeries: Asian Institute of Technology. Thesis ; no. CS-03-04Publication details: Pathum Thani, Thailand : Asian Institute of Technology, 2003Description: 36 pSubject(s): Online resources: Dissertation note: Thesis (M.Sc.) - Asian Institute of Technology, 2003 Summary: 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.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no.CS-03-04 (Browse shelf(Opens below)) | 1 | Available | 30050120607881 | |||||||||||||
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no.CS-03-04 (Browse shelf(Opens below)) | 2 | Available | 30050120607899 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no.CS-03-04 (Browse shelf(Opens below)) | Available | 30050120354047 |
A thesis study submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Advanced Technologies
Thesis (M.Sc.) - Asian Institute of Technology, 2003
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.
There are no comments on this title.

AI Search