Access the full text.
Sign up today, get DeepDyve free for 14 days.
M-L Fernández, G Valiente (2001)
A graph distance metric combining maximum common subgraph and minimum common supergraphPattern Recognit. Lett., 22
C Duin, A Volgenant, S Voß (2004)
Solving group steiner problems as steiner problemsEur. J. Oper. Res., 154
S Bruckner, F Huffner, RM Karp, R Shamir, R Sharan (2010)
Topology-free querying of protein interaction networksJ. Comput. Biol., 17
N Buchan, R Croson (2004)
The boundaries of trust: own and others actions in the US and chinaJ. Econ. Behav. Organ., 55
A Khan, Y Wu, CC Aggarwal, X Yan (2013)
NeMa: fast graph search with label similarityVLDB, 6
S Zhang, J Yang, W Jin (2010)
SAPPER: subgraph indexing and approximate matching in large graphsVLDB, 3
CS Helvig, G Robins, A Zelikovsky (2001)
An improved approximation scheme for the group steiner problemNetworks, 37
S Bruckner, F Huffner, RM Karp, R Shamir, R Sharan (2009)
Torque: topology-free querying of protein interaction networksNucl. Acids Res., 37
W Fan, J Li, S Ma, N Tang, Y Wu, Y Wu (2010)
Graph pattern matching: from intractable to polynomial timeVLDB, 3
A large body of research has focused on efficient and scalable processing of subgraph search queries on large networks. In these efforts, a query is posed in the form of a connected query graph. Unfortunately, in practice end users may not always have precise knowledge about the topological relationships between nodes in a query graph to formulate a connected query. In this paper, we present a novel graph querying paradigm called partial topology-based network search and propose a query processing framework called panda to efficiently process 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. To this end, we propose an exact and an approximate algorithm called sen-panda and po-panda, respectively, to generate top-k matches of a ptq. We also present a subgraph simulation-based optimization technique to further speedup the processing of ptqs. Using real-life networks with millions of nodes, we experimentally verify that our proposed algorithms are superior to several baseline techniques.
The VLDB Journal – Springer Journals
Published: Nov 18, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.