{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T07:14:33Z","timestamp":1654154073083},"reference-count":0,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,7,1]]},"abstract":"<p>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.<\/p>","DOI":"10.4018\/jdm.2015070102","type":"journal-article","created":{"date-parts":[[2016,2,8]],"date-time":"2016-02-08T16:28:23Z","timestamp":1454948903000},"page":"21-40","source":"Crossref","is-referenced-by-count":1,"title":["Considering User Intention in Differential Graph Queries"],"prefix":"10.4018","volume":"26","author":[{"given":"Elena","family":"Vasilyeva","sequence":"first","affiliation":[{"name":"SAP SE, Dresden, Germany"}]},{"given":"Maik","family":"Thiele","sequence":"additional","affiliation":[{"name":"Database Technology Group, Technische Universit\u00e4t Dresden, Dresden, Germany"}]},{"given":"Christof","family":"Bornh\u00f6vd","sequence":"additional","affiliation":[{"name":"SAP Labs, LLC, Palo Alto, CA, USA"}]},{"given":"Wolfgang","family":"Lehner","sequence":"additional","affiliation":[{"name":"Database Technology Group, Technische Universit\u00e4t Dresden, Dresden, Germany"}]}],"member":"2432","container-title":["Journal of Database Management"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=145869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:08:54Z","timestamp":1654096134000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/JDM.2015070102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jdm.2015070102","relation":{},"ISSN":["1063-8016","1533-8010"],"issn-type":[{"value":"1063-8016","type":"print"},{"value":"1533-8010","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}