|Title||rho-Queries: Enabling Querying for Semantic Associations on the Semantic Web|
|Publication Type||Conference Paper|
|Year of Publication||2003|
|Authors||Amit Sheth, Kemafor Anyanwu|
|Conference Name||12th International World Wide Web Conference|
|Conference Location||Budapest, Hungary|
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as similarity of entities based on a specific notion of similarity called P-isomorphism. It formalizes these notions for the RDF data model, by introducing a notion of a Property Sequence as a type. In the context of a graph model such as that for RDF, Semantic Associations amount to specific certain graph signatures. Specifically, they refer to sequences (i.e. directed paths) here called Property Sequences, between entities, networks of Property Sequences (i.e. undirected paths), or subgraphs of P-isomorphic Property Sequences. The ability to query about the existence of such relationships is fundamental to tasks in analytical domains such as national security and business intelligence, where tasks often focus on finding complex yet meaningful and obscured relationships between entities. However, support for such queries is lacking in contemporary query systems, including those for RDF. This paper discusses how querying for Semantic Associations might be enabled on the Semantic Web, through the use of an operator P. It also discusses two approaches for processing P- queries on available persistent RDF stores and memory resident RDF data graphs, thereby building on current RDF query languages.
|Full Text|| |
Kemafor Anyanwu and Amit P. Sheth, 'rho-Queries: Enabling Querying for Semantic Associations on the Semantic Web,'in proceedings, 12th International World Wide Web Conference, Budapest, Hungary, May 20-24, 2003, New York: ACM Press, 2003, pp. 690-699.