Matches in ScholarlyData for { <https://w3id.org/scholarlydata/inproceedings/iswc2013/proceedings-1/paper-30> ?p ?o. }
Showing items 1 to 7 of
7
with 100 items per page.
- paper-30 type InProceedings.
- paper-30 label "Personalized Best Answer Computation in Graph Databases".
- paper-30 sameAs paper-30.
- paper-30 abstract "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 SPARQL-queries, 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.".
- paper-30 hasAuthorList authorList.
- paper-30 isPartOf proceedings-1.
- paper-30 title "Personalized Best Answer Computation in Graph Databases".