FRINK Linked Data Fragments server

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

• W2153752433 abstract "Sub graph search is a popular query scenario on graph databases. Given a query graph q, the sub graph search algorithm returns all database graphs having q as a sub graph. To efficiently implement a subgraph search, subgraph features are mined in order to index the graph database. Many subgraph feature mining approaches have been proposed. They are all mine-at-once algorithms in which the whole feature set is mined in one run before building a stable graph index. However, due to the change of environments (such as an update of the graph database and the increase of available memory), the index needs to be updated to accommodate such changes. Most of the mine-at-once algorithms involve frequent subgraph or subtree mining over the whole graph database. Also, constructing and deploying a new index involves an expensive disk operation such that it is inefficient to re-mine the features and rebuild the index from scratch. We observe that, under most cases, it is sufficient to update a small part of the graph index. Here we propose an iterative subgraph mining algorithm which iteratively finds one feature to insert into (or remove from) the index. Since the majority of indexing features and the index structure are not changed, the algorithm can be frequently invoked. We define an objective function that guides the feature mining. Next, we propose a basic branch and bound algorithm to mine the features. Finally, we design an advanced search algorithm, which quickly finds a near-optimum subgraph feature and reduces the search space. Experiments show that our feature mining algorithm is 5 times faster than the popular graph indexing algorithm gIndex, and that features mined by our iterative algorithm have a better filtering rate for the subgraph search problem." @default.
• W2153752433 created "2016-06-24" @default.
• W2153752433 creator A5001294898 @default.
• W2153752433 creator A5009542542 @default.
• W2153752433 creator A5051925673 @default.
• W2153752433 creator A5056467002 @default.
• W2153752433 date "2012-04-01" @default.
• W2153752433 modified "2023-10-18" @default.
• W2153752433 title "Iterative Graph Feature Mining for Graph Indexing" @default.
• W2153752433 cites W1542652324 @default.
• W2153752433 cites W1554807050 @default.
• W2153752433 cites W1972832151 @default.
• W2153752433 cites W1975068437 @default.
• W2153752433 cites W2004734764 @default.
• W2153752433 cites W2013497015 @default.
• W2153752433 cites W2027943354 @default.
• W2153752433 cites W2036265926 @default.
• W2153752433 cites W2050137450 @default.
• W2153752433 cites W2071333487 @default.
• W2153752433 cites W2102039273 @default.
• W2153752433 cites W2110034858 @default.
• W2153752433 cites W2110920461 @default.
• W2153752433 cites W2111036405 @default.
• W2153752433 cites W2136593687 @default.
• W2153752433 cites W2140840007 @default.
• W2153752433 cites W2142965177 @default.
• W2153752433 cites W2154553070 @default.
• W2153752433 cites W2164281374 @default.
• W2153752433 cites W2169310183 @default.
• W2153752433 cites W2215622313 @default.
• W2153752433 cites W2091794634 @default.
• W2153752433 doi "https://doi.org/10.1109/icde.2012.11" @default.
• W2153752433 hasPublicationYear "2012" @default.
• W2153752433 type Work @default.
• W2153752433 sameAs 2153752433 @default.
• W2153752433 citedByCount "11" @default.
• W2153752433 countsByYear W21537524332013 @default.
• W2153752433 countsByYear W21537524332014 @default.
• W2153752433 countsByYear W21537524332015 @default.
• W2153752433 countsByYear W21537524332016 @default.
• W2153752433 countsByYear W21537524332017 @default.
• W2153752433 countsByYear W21537524332019 @default.
• W2153752433 countsByYear W21537524332021 @default.
• W2153752433 crossrefType "proceedings-article" @default.
• W2153752433 hasAuthorship W2153752433A5001294898 @default.
• W2153752433 hasAuthorship W2153752433A5009542542 @default.
• W2153752433 hasAuthorship W2153752433A5051925673 @default.
• W2153752433 hasAuthorship W2153752433A5056467002 @default.
• W2153752433 hasBestOaLocation W21537524332 @default.
• W2153752433 hasConcept C11413529 @default.
• W2153752433 hasConcept C124101348 @default.
• W2153752433 hasConcept C131992880 @default.
• W2153752433 hasConcept C132525143 @default.
• W2153752433 hasConcept C147792647 @default.
• W2153752433 hasConcept C149530733 @default.
• W2153752433 hasConcept C176225458 @default.
• W2153752433 hasConcept C203776342 @default.
• W2153752433 hasConcept C23123220 @default.
• W2153752433 hasConcept C36038622 @default.
• W2153752433 hasConcept C41008148 @default.
• W2153752433 hasConcept C75165309 @default.
• W2153752433 hasConcept C80444323 @default.
• W2153752433 hasConceptScore W2153752433C11413529 @default.
• W2153752433 hasConceptScore W2153752433C124101348 @default.
• W2153752433 hasConceptScore W2153752433C131992880 @default.
• W2153752433 hasConceptScore W2153752433C132525143 @default.
• W2153752433 hasConceptScore W2153752433C147792647 @default.
• W2153752433 hasConceptScore W2153752433C149530733 @default.
• W2153752433 hasConceptScore W2153752433C176225458 @default.
• W2153752433 hasConceptScore W2153752433C203776342 @default.
• W2153752433 hasConceptScore W2153752433C23123220 @default.
• W2153752433 hasConceptScore W2153752433C36038622 @default.
• W2153752433 hasConceptScore W2153752433C41008148 @default.
• W2153752433 hasConceptScore W2153752433C75165309 @default.
• W2153752433 hasConceptScore W2153752433C80444323 @default.
• W2153752433 hasLocation W21537524331 @default.
• W2153752433 hasLocation W21537524332 @default.
• W2153752433 hasOpenAccess W2153752433 @default.
• W2153752433 hasPrimaryLocation W21537524331 @default.
• W2153752433 hasRelatedWork W2153752433 @default.
• W2153752433 hasRelatedWork W2353748800 @default.
• W2153752433 hasRelatedWork W2366976231 @default.
• W2153752433 hasRelatedWork W2399248792 @default.
• W2153752433 hasRelatedWork W2546858759 @default.
• W2153752433 hasRelatedWork W2604857373 @default.
• W2153752433 hasRelatedWork W2946681422 @default.
• W2153752433 hasRelatedWork W3113013029 @default.
• W2153752433 hasRelatedWork W3181591076 @default.
• W2153752433 hasRelatedWork W4243718474 @default.
• W2153752433 isParatext "false" @default.
• W2153752433 isRetracted "false" @default.
• W2153752433 magId "2153752433" @default.
• W2153752433 workType "article" @default.