We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...
Roy Goldman, Narayanan Shivakumar, Suresh Venkatas...
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...