Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Finding and approximating top-k answers in keyword proximity search
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Identifying meaningful return information for XML keyword search
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Discover: keyword search in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Keyword proximity search in complex data graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
SPARK: A Keyword Search Engine on Relational Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Keyword search in databases: the power of RDBMS
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
ExQueX: exploring and querying XML documents
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Finding a minimal tree pattern under neighborhood constraints
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Language models for keyword search over data graphs
Proceedings of the fifth ACM international conference on Web search and data mining
Interactive predicate suggestion for keyword search on RDF graphs
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
KESOSD: keyword search over structured data
KEYS '12 Proceedings of the Third International Workshop on Keyword Search on Structured Data
A personal perspective on keyword search over data graphs
Proceedings of the 16th International Conference on Database Theory
Hi-index | 0.00 |
A system for keyword search on data graphs is demonstrated on two challenging datasets: the large DBLP and Mondial (which is highly cyclic and has a complex schema). The system supports search, exploration and question answering. The demonstration shows how the system copes with the main challenges in keywords search on data graphs. In particular, the system generates answers efficiently and completely (i.e., it does not miss answers). It has an effective ranking mechanism that also takes into account redundancies among answers. Finally, the system uses a novel technique for displaying multi-node subtrees in a compact graphical form that facilitates quick and easy understanding, which is essential for effective browsing of the answers.