Personalized Best Answer Computation in Graph Databases
نویسندگان
چکیده
Though subgraph matching has been extensively studied as a query paradigm in semantic web and social network data environments, a user can get a large number of answers in response to a query. Just like Google does, these answers can be shown to the user in accordance with an importance ranking. In this paper, we present scalable algorithms to find the top-K answers to a practically important subset of SPARQLqueries, denoted as importance queries, via a suite of pruning techniques. We test our algorithms on multiple real-world graph data sets, showing that our algorithms are efficient even on networks with up to 6M vertices and 15M edges and far more efficient than popular triple stores.
منابع مشابه
HubPPR: Effective Indexing for Approximate Personalized PageRank
Personalized PageRank (PPR) computation is a fundamental operation in web search, social networks, and graph analysis. Given a graphG, a source s, and a target t, the PPR query π(s, t) returns the probability that a random walk on G starting from s terminates at t. Unlike global PageRank which can be effectively pre-computed and materialized, the PPR result depends on both the source and the ta...
متن کاملGraph Walks and Graphical Models
Inference in Markov random fields, and development and evaluation of similarity measures for nodes in graphs, are both active areas of data-mining research. In this paper, we demonstrate a formal connection between inference in tree-structured Markov random fields and personalized PageRank, a widely-used similarity measure for graph nodes based on graphwalks. In particular we show a connection ...
متن کاملKeyword Search in External Memory Graph
Keyword search over relational and XML data has grown in popularity since the advent of Web search engines. Keyword search over relational data is significantly different from web search as the required information is often split across multiple tables as a result of normalization. The algorithms and techniques that are applied to databases, thus produce answer trees from the data graph as oppo...
متن کاملYaanii: Effective Keyword Search over Semantic Dataset
Nowadays data is disseminated in a number of different sources, from databases systems to the Web, from a traditional structured organization (relational) to a semi-structured (XML), up to the unstructured ones (text in Web documents). Although availability of data is constantly increasing, one principal difficulty users have to face is to find and retrieve the information they are looking for....
متن کاملPerformance-Optimized Adaptation of Personalized Web Fragments
Current Web users request for individualized and highly-newsworthy information that is immediately delivered by existing Web applications. Therefore, pre-developed, static Web pages which have been regarded as best-practice over years are deprecated to support these demands. Consequently, more sophisticated approaches are needed. One answer to this dilemma is to consider dynamical Web page gene...
متن کامل