Combining fuzzy information from multiple systems
Journal of Computer and System Sciences
Approximation algorithms
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Adaptive Processing of Top-k Queries in XML
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Social matching: A framework and research agenda
ACM Transactions on Computer-Human Interaction (TOCHI)
The link-prediction problem for social networks
Journal of the American Society for Information Science and Technology
Identifying meaningful return information for XML keyword search
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Fast best-effort pattern matching in large attributed graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Top-k subgraph matching query in a large graph
Proceedings of the ACM first Ph.D. workshop in CIKM
Efficient search ranking in social networks
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Efficient algorithms for exact ranked twig-pattern matching over graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient top-k querying over social-tagging networks
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
An axiomatic approach for result diversification
Proceedings of the 18th international conference on World wide web
Evolution of an online social aggregation network: an empirical study
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Learning concept importance using a weighted dependence model
Proceedings of the third ACM international conference on Web search and data mining
What do people ask their social networks, and why?: a survey study of status message q&a behavior
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
DivQ: diversification for keyword search over structured databases
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Detecting Social Positions Using Simulation
ASONAM '10 Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
On query result diversification
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Scalable Diversified Ranking on Large Graphs
ICDM '11 Proceedings of the 2011 IEEE 11th International Conference on Data Mining
Max-Sum diversification, monotone submodular functions and dynamic updates
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Approximation algorithms for maximum dispersion
Operations Research Letters
Top-k linked data query processing
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Proceedings of the VLDB Endowment
Strong simulation: Capturing topology in graph pattern matching
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Graph pattern matching has been widely used in e.g., social data analysis. A number of matching algorithms have been developed that, given a graph pattern Q and a graph G, compute the set M(Q,G) of matches of Q in G. However, these algorithms often return an excessive number of matches, and are expensive on large real-life social graphs. Moreover, in practice many social queries are to find matches of a specific pattern node, rather than the entire M(Q,G). This paper studies top-k graph pattern matching. (1) We revise graph pattern matching defined in terms of simulation, by supporting a designated output node uo. Given G and Q, it is to find those nodes in M(Q,G) that match uo, instead of the large set M(Q,G). (2) We study two classes of functions for ranking the matches: relevance functions δr() based on, e.g., social impact, and distance functions δd() to cover diverse elements. (3) We develop two algorithms for computing top-k matches of uo based on δr(), with the early termination property, i.e., they find top-k matches without computing the entire M(Q,G). (4) We also study diversified top-k matching, a bi-criteria optimization problem based on both δr() and δd(). We show that its decision problem is NP-complete. Nonetheless, we provide an approximation algorithm with performance guarantees and a heuristic one with the early termination property. (5) Using real-life and synthetic data, we experimentally verify that our (diversified) top-k matching algorithms are effective, and outperform traditional matching algorithms in efficiency.