Efficient probabilistic supergraph search
- Publication Type:
- Conference Proceeding
- 2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016, 2016, pp. 1542 - 1543
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2016 IEEE. In this paper, we investigate the problem of supergraph containment search over uncertain data graphs gu where each edge in a gu has an occurrence probability, namely probabilistic supergraph search, which has a wide spectrum of applications.
Please use this identifier to cite or link to this item: