Name
Abstract | ||
|---|---|---|
AbstractA large body of research on subgraph query processing on large networks assumes that a query is posed in the form of a connected graph. Unfortunately, end users in practice may not always have precise knowledge about the topological relationships between nodes in a query graph to formulate a connected query. In this demonstration, we present a novel graph querying paradigm called partial topology-based network search and a query processing system called panda to efficiently find top-k matches of a partial topology query (ptq) in a single machine. A ptq is a disconnected query graph containing multiple connected query components. ptqs allow an end user to formulate queries without demanding precise information about the complete topology of a query graph. We demonstrate various innovative features of panda and its promising performance. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.14778/3229863.3236236 | Hosted Content |
Field | DocType | Volume |
Data mining,Large networks,Computer science | Journal | 11 |
Issue | ISSN | Citations |
12 | 2150-8097 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miao Xie | 1 | 3 | 1.73 |
| Sourav S. Bhowmick | 2 | 1519 | 272.35 |
| Hao Su | 3 | 7343 | 302.07 |
| gao cong | 4 | 4086 | 169.93 |
| Wook-Shin Han | 5 | 805 | 57.85 |