Name
Abstract | ||
|---|---|---|
Composing queries is evidently a tedious task. This is particularly true of graph queries as they are typically complex and prone to errors, compounded by the fact that graph schemas can be missing or too loose to be helpful for query formulation. Despite the great success of query formulation aids, in particular, automatic query completion, graph query autocompletion has received much less research attention. In this paper, we propose a novel framework for subgraph query autocompletion (called AutoG). Given an initial query q and a user's preference as input, AutoG returns ranked query suggestions $$Q'$$Qź as output. Users may choose a query from $$Q'$$Qź and iteratively apply AutoG to compose their queries. The novelties of AutoG are as follows: First, we formalize query composition. Second, we propose to increment a query with the logical units called c-prime features that are (i) frequent subgraphs and (ii) constructed from smaller c-prime features in no more than c ways. Third, we propose algorithms to rank candidate suggestions. Fourth, we propose a novel index called feature Dag (FDag) to optimize the ranking. We study the query suggestion quality with simulations and real users and conduct an extensive performance evaluation. The results show that the query suggestions are useful (saved roughly 40% of users' mouse clicks), and AutoG returns suggestions shortly under a large variety of parameter settings. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s00778-017-0454-9 | VLDB J. |
Keywords | DocType | Volume |
Subgraph query,Query autocompletion,Graphs,Database usability | Journal | 26 |
Issue | ISSN | Citations |
3 | 1066-8888 | 9 |
PageRank | References | Authors |
0.48 | 28 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peipei Yi | 1 | 28 | 3.09 |
| Byron Choi | 2 | 554 | 45.50 |
| Sourav S. Bhowmick | 3 | 1519 | 272.35 |
| Jianliang Xu | 4 | 2743 | 168.17 |