FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2883287746> ?p ?o ?g. }

• W2883287746 endingPage "316" @default.
• W2883287746 startingPage "299" @default.
• W2883287746 abstract "Purpose This paper aims to propose a new keyword search method on graph data to improve the relevance of search results and reduce duplication of content nodes in the answer trees obtained by previous approaches based on distinct root semantics. The previous approaches are restricted to find answer trees having different root nodes and thus often generate a result consisting of answer trees with low relevance to the query or duplicate content nodes. The method allows limited redundancy in the root nodes of top- k answer trees to produce more effective query results. Design/methodology/approach A measure for redundancy in a set of answer trees regarding their root nodes is defined, and according to the metric, a set of answer trees with limited root redundancy is proposed for the result of a keyword query on graph data. For efficient query processing, an index on the useful paths in the graph using inverted lists and a hash map is suggested. Then, based on the path index, a top- k query processing algorithm is presented to find most relevant and diverse answer trees given a maximum amount of root redundancy allowed for a set of answer trees. Findings The results of experiments using real graph datasets show that the proposed approach can produce effective query answers which are more diverse in the content nodes and more relevant to the query than the previous approach based on distinct root semantics. Originality/value This paper first takes redundancy in the root nodes of answer trees into account to improve the relevance and content nodes redundancy of query results over the previous distinct root semantics. It can satisfy the users’ various information need on a large and complex graph data using a keyword-based query." @default.
• W2883287746 created "2018-08-03" @default.
• W2883287746 creator A5068718592 @default.
• W2883287746 date "2018-08-20" @default.
• W2883287746 modified "2023-09-25" @default.
• W2883287746 title "Effective keyword search on graph data using limited root redundancy of answer trees" @default.
• W2883287746 cites W2019876129 @default.
• W2883287746 cites W2042492403 @default.
• W2883287746 cites W2075398406 @default.
• W2883287746 cites W2135114001 @default.
• W2883287746 cites W2162783807 @default.
• W2883287746 cites W2164858177 @default.
• W2883287746 cites W2666600683 @default.
• W2883287746 doi "https://doi.org/10.1108/ijwis-10-2017-0070" @default.
• W2883287746 hasPublicationYear "2018" @default.
• W2883287746 type Work @default.
• W2883287746 sameAs 2883287746 @default.
• W2883287746 citedByCount "3" @default.
• W2883287746 countsByYear W28832877462020 @default.
• W2883287746 countsByYear W28832877462023 @default.
• W2883287746 crossrefType "journal-article" @default.
• W2883287746 hasAuthorship W2883287746A5068718592 @default.
• W2883287746 hasConcept C111919701 @default.
• W2883287746 hasConcept C124101348 @default.
• W2883287746 hasConcept C132525143 @default.
• W2883287746 hasConcept C152124472 @default.
• W2883287746 hasConcept C23123220 @default.
• W2883287746 hasConcept C38652104 @default.
• W2883287746 hasConcept C41008148 @default.
• W2883287746 hasConcept C80444323 @default.
• W2883287746 hasConcept C99138194 @default.
• W2883287746 hasConceptScore W2883287746C111919701 @default.
• W2883287746 hasConceptScore W2883287746C124101348 @default.
• W2883287746 hasConceptScore W2883287746C132525143 @default.
• W2883287746 hasConceptScore W2883287746C152124472 @default.
• W2883287746 hasConceptScore W2883287746C23123220 @default.
• W2883287746 hasConceptScore W2883287746C38652104 @default.
• W2883287746 hasConceptScore W2883287746C41008148 @default.
• W2883287746 hasConceptScore W2883287746C80444323 @default.
• W2883287746 hasConceptScore W2883287746C99138194 @default.
• W2883287746 hasIssue "3" @default.
• W2883287746 hasLocation W28832877461 @default.
• W2883287746 hasOpenAccess W2883287746 @default.
• W2883287746 hasPrimaryLocation W28832877461 @default.
• W2883287746 hasRelatedWork W1538624230 @default.
• W2883287746 hasRelatedWork W2119214692 @default.
• W2883287746 hasRelatedWork W2144190808 @default.
• W2883287746 hasRelatedWork W2185303849 @default.
• W2883287746 hasRelatedWork W2357241418 @default.
• W2883287746 hasRelatedWork W2366644548 @default.
• W2883287746 hasRelatedWork W2376314740 @default.
• W2883287746 hasRelatedWork W2384888906 @default.
• W2883287746 hasRelatedWork W2909016198 @default.
• W2883287746 hasRelatedWork W3041052722 @default.
• W2883287746 hasVolume "14" @default.
• W2883287746 isParatext "false" @default.
• W2883287746 isRetracted "false" @default.
• W2883287746 magId "2883287746" @default.
• W2883287746 workType "article" @default.