๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the 2011 international conference - Athens, Greece (2011.06.12-2011.06.16)] Proceedings of the 2011 international conference on Management of data - SIGMOD '11 - Neighborhood based fast graph search in large networks

โœ Scribed by Khan, Arijit; Li, Nan; Yan, Xifeng; Guan, Ziyu; Chakraborty, Supriyo; Tao, Shu

Book ID
125532117
Publisher
ACM Press
Year
2011
Tongue
English
Weight
565 KB
Category
Article
ISBN
1450306616

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[ACM Press the 2011 international confer
[ACM Press the 2011 international conference - Athens, Greece (2011.06.12-2011.06.16)] Proceedings of the 2011 international conference on Management of data - SIGMOD '11 - Neighborhood based fast graph search in large networks
โœ Khan, Arijit; Li, Nan; Yan, Xifeng; Guan, Ziyu; Chakraborty, Supriyo; Tao, Shu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› ACM Press ๐ŸŒ English โš– 565 KB

Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labeled network and a query graph, how to efficiently search the query graph in the target network. The presence of noise and

[ACM Press the 2011 international confer
[ACM Press the 2011 international conference - Athens, Greece (2011.06.12-2011.06.16)] Proceedings of the 2011 international conference on Management of data - SIGMOD '11 - Efficient query answering in probabilistic RDF graphs
โœ Lian, Xiang; Chen, Lei ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› ACM Press ๐ŸŒ English โš– 607 KB

In this paper, we tackle the problem of efficiently answering queries on probabilistic RDF data graphs. Specifically, we model RDF data by probabilistic graphs, and an RDF query is equivalent to a search over subgraphs of probabilistic graphs that have high probabilities to match with a given query