Matches in SemOpenAlex for { <https://semopenalex.org/work/W2026553931> ?p ?o ?g. }
Showing items 1 to 83 of
83
with 100 items per page.
- W2026553931 abstract "In recent years, with the emergence of a number of new real applications, such as protein-protein interaction (PPI) networks, visual pattern recognition, and intelligent traffic systems, managing huge volumes of uncertain graphs has attracted much attention in the database community. Currently, most existing fundamental queries over graphs only support deterministic (or certain) graphs, although real graph data are often noisy, inaccurate, and incomplete. In this paper, we study a new type of uncertain graph query, probabilistic supergraph containment query over large uncertain graphs. Specifically, given an uncertain graph database UGD which contains a set of uncertain graphs, a deterministic query graph q, and a probabilistic threshold δ, a probabilistic supergraph containment query is to find the set of uncertain graphs from UGD, denoted as UGDq, such that UGDq={ugi∈ UGD|Pr(ugi⊆ q)≥δ} where Pr(ugi⊆q) means the likelihood that ugi is a subgraph of q. We prove that the computation of Pr(ugi⊆q) is #P-hard and design an efficient filtering-and-verification framework to avoid the expensive computation. In particular, we propose an effective filtering strategy and a novel probabilistic inverted index, called PS-Index, to enhance pruning power in the filtering phase. Furthermore, the candidate graphs which pass the filtering phase are tested in the verification phase via an efficient unequal probability sampling-based approximation algorithm. Finally, we verify the effectiveness and efficiency of the proposed methods through extensive experiments." @default.
- W2026553931 created "2016-06-24" @default.
- W2026553931 creator A5001241928 @default.
- W2026553931 creator A5010738468 @default.
- W2026553931 creator A5051874566 @default.
- W2026553931 creator A5052597827 @default.
- W2026553931 date "2014-11-03" @default.
- W2026553931 modified "2023-10-01" @default.
- W2026553931 title "Efficient Probabilistic Supergraph Search Over Large Uncertain Graphs" @default.
- W2026553931 cites W1510148020 @default.
- W2026553931 cites W1570856340 @default.
- W2026553931 cites W1965427702 @default.
- W2026553931 cites W1972243925 @default.
- W2026553931 cites W1973968359 @default.
- W2026553931 cites W2008974204 @default.
- W2026553931 cites W2041361017 @default.
- W2026553931 cites W2043354831 @default.
- W2026553931 cites W2057272970 @default.
- W2026553931 cites W2074241604 @default.
- W2026553931 cites W2092271237 @default.
- W2026553931 cites W2099913238 @default.
- W2026553931 cites W2103626206 @default.
- W2026553931 cites W2106336008 @default.
- W2026553931 cites W2107565029 @default.
- W2026553931 cites W2107710781 @default.
- W2026553931 cites W2110034858 @default.
- W2026553931 cites W2115826669 @default.
- W2026553931 cites W2133695619 @default.
- W2026553931 cites W2137442080 @default.
- W2026553931 cites W2137913010 @default.
- W2026553931 cites W2139694815 @default.
- W2026553931 cites W2158501189 @default.
- W2026553931 cites W2498260651 @default.
- W2026553931 doi "https://doi.org/10.1145/2661829.2661872" @default.
- W2026553931 hasPublicationYear "2014" @default.
- W2026553931 type Work @default.
- W2026553931 sameAs 2026553931 @default.
- W2026553931 citedByCount "9" @default.
- W2026553931 countsByYear W20265539312015 @default.
- W2026553931 countsByYear W20265539312016 @default.
- W2026553931 countsByYear W20265539312018 @default.
- W2026553931 countsByYear W20265539312019 @default.
- W2026553931 countsByYear W20265539312020 @default.
- W2026553931 countsByYear W20265539312023 @default.
- W2026553931 crossrefType "proceedings-article" @default.
- W2026553931 hasAuthorship W2026553931A5001241928 @default.
- W2026553931 hasAuthorship W2026553931A5010738468 @default.
- W2026553931 hasAuthorship W2026553931A5051874566 @default.
- W2026553931 hasAuthorship W2026553931A5052597827 @default.
- W2026553931 hasConcept C126255220 @default.
- W2026553931 hasConcept C154945302 @default.
- W2026553931 hasConcept C17192189 @default.
- W2026553931 hasConcept C33923547 @default.
- W2026553931 hasConcept C41008148 @default.
- W2026553931 hasConcept C49937458 @default.
- W2026553931 hasConceptScore W2026553931C126255220 @default.
- W2026553931 hasConceptScore W2026553931C154945302 @default.
- W2026553931 hasConceptScore W2026553931C17192189 @default.
- W2026553931 hasConceptScore W2026553931C33923547 @default.
- W2026553931 hasConceptScore W2026553931C41008148 @default.
- W2026553931 hasConceptScore W2026553931C49937458 @default.
- W2026553931 hasFunder F4320308943 @default.
- W2026553931 hasFunder F4320309327 @default.
- W2026553931 hasFunder F4320321001 @default.
- W2026553931 hasFunder F4320321540 @default.
- W2026553931 hasFunder F4320321592 @default.
- W2026553931 hasLocation W20265539311 @default.
- W2026553931 hasOpenAccess W2026553931 @default.
- W2026553931 hasPrimaryLocation W20265539311 @default.
- W2026553931 hasRelatedWork W1253008510 @default.
- W2026553931 hasRelatedWork W1501302278 @default.
- W2026553931 hasRelatedWork W1575659177 @default.
- W2026553931 hasRelatedWork W1603968847 @default.
- W2026553931 hasRelatedWork W165430243 @default.
- W2026553931 hasRelatedWork W1812247352 @default.
- W2026553931 hasRelatedWork W2317724037 @default.
- W2026553931 hasRelatedWork W2909011011 @default.
- W2026553931 hasRelatedWork W4290792893 @default.
- W2026553931 hasRelatedWork W2567309070 @default.
- W2026553931 isParatext "false" @default.
- W2026553931 isRetracted "false" @default.
- W2026553931 magId "2026553931" @default.
- W2026553931 workType "article" @default.