resource identifiers uris and v t is the set of type vertices 108 v w is the set of keyword vertices 106 the division on vertices results in a corresponding division on the rdf predicates i e the edges in a directed graph the rdf graph includes entity entity predicates 112 entity keyword predicates 114 and entity type predicates 116 e r is the set of edges for entity entity predicates i e connecting two vertices in v e e a is the set of edges for entity keyword predicates i e connecting an entity to a keyword and e t is the set of edges for entity type predicates i e connecting an entity to a type the main structure of an rdf graph is captured by the entity entity predicates or edges 112 represented by the set e r using these set representations a given rdf dataset is viewed as an rdf graph g v e where v is the union of disjoint sets v e v t and v w and e is the union of disjoint sets e r e a and e t an alternate view of the rdf dataset is generated by treating a given entity vertex along with its associated type and keyword vertices as a single combined vertex for example the entity vertices uri 5 uri 1 and uri 3 from fig1 along with their types and keywords can be viewed as the combined vertex structure 200.