Welcome to the InfoSci Platform
Reference Hub1
Considering User Intention in Differential Graph Queries

Considering User Intention in Differential Graph Queries

Elena Vasilyeva, Maik Thiele, Christof Bornhövd, Wolfgang Lehner
Copyright: © 2015 |Volume: 26 |Issue: 3 |Pages: 20
ISSN: 1063-8016|EISSN: 1533-8010|EISBN13: 9781466675513|DOI: 10.4018/JDM.2015070102
Cite Article Cite Article

MLA

Vasilyeva, Elena, et al. "Considering User Intention in Differential Graph Queries." JDM vol.26, no.3 2015: pp.21-40. http://doi.org/10.4018/JDM.2015070102

APA

Vasilyeva, E., Thiele, M., Bornhövd, C., & Lehner, W. (2015). Considering User Intention in Differential Graph Queries. Journal of Database Management (JDM), 26(3), 21-40. http://doi.org/10.4018/JDM.2015070102

Chicago

Vasilyeva, Elena, et al. "Considering User Intention in Differential Graph Queries," Journal of Database Management (JDM) 26, no.3: 21-40. http://doi.org/10.4018/JDM.2015070102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Empty answers are a major problem by processing pattern matching queries in graph databases. Especially, there can be multiple reasons why a query failed. To support users in such situations, differential queries can be used that deliver missing parts of a graph query. Multiple heuristics are proposed for differential queries, which reduce the search space. Although they are successful in increasing the performance, they can discard query subgraphs relevant to a user. To address this issue, the authors extend the concept of differential queries and introduce top-k differential queries that calculate the ranking based on users' preferences and significantly support the users' understanding of query database management systems. A user assigns relevance weights to elements of a graph query that steer the search and are used for the ranking. In this paper the authors propose different strategies for selection of relevance weights and their propagation. As a result, the search is modelled along the most relevant paths. The authors evaluate their solution and both strategies on the DBpedia data graph.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.