A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ACM Transactions on Computational Logic (TOCL)
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
Bidirectional expansion for keyword search on graph databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Query biased snippet generation in XML search
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Graph summarization with bounded error
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient aggregation for graph summarization
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
SQAK: doing more with keywords
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Data clouds: summarizing keyword search results over structured data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Refining Keyword Queries for XML Retrieval by Combining Content and Structure
ECIR '09 Proceedings of the 31th European Conference on IR Research on Advances in Information Retrieval
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Keyword search on structured and semi-structured data
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Multi-document summarization by sentence extraction
NAACL-ANLP-AutoSum '00 Proceedings of the 2000 NAACL-ANLP Workshop on Automatic Summarization
Measure-driven keyword-query expansion
Proceedings of the VLDB Endowment
Return specification inference and result clustering for keyword search on XML
ACM Transactions on Database Systems (TODS)
Query expansion based on clustered results
Proceedings of the VLDB Endowment
Incremental graph pattern matching
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Interactive SQL query suggestion: Making databases user-friendly
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Keyword-Driven SPARQL Query Generation Leveraging Background Knowledge
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Effectively interpreting keyword queries on RDF databases with a rear view
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
REX: explaining relationships between entity pairs
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Keyword search has been popularly used to query graph data. Due to the lack of structure support, a keyword query might generate an excessive number of matches, referred to as "answer graphs", that could include different relationships among keywords. An ignored yet important task is to group and summarize answer graphs that share similar structures and contents for better query interpretation and result understanding. This paper studies the summarization problem for the answer graphs induced by a keyword query Q. (1) A notion of summary graph is proposed to characterize the summarization of answer graphs. Given Q and a set of answer graphs G, a summary graph preserves the relation of the keywords in Q by summarizing the paths connecting the keywords nodes in G. (2) A quality metric of summary graphs, called coverage ratio, is developed to measure information loss of summarization. (3) Based on the metric, a set of summarization problems are formulated, which aim to find minimized summary graphs with certain coverage ratio. (a) We show that the complexity of these summarization problems ranges from ptime to NP-complete. (b) We provide exact and heuristic summarization algorithms. (4) Using real-life and synthetic graphs, we experimentally verify the effectiveness and the efficiency of our techniques.