AutoG: a visual query autocompletion framework for graph databases
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,...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/83505 http://hdl.handle.net/10220/42600 |
| _version_ | 1811690806504849408 |
|---|---|
| author | Xu, Jianliang Yi, Peipei Choi, Byron Bhowmick, Sourav Saha |
| author2 | School of Computer Science and Engineering |
| author_facet | School of Computer Science and Engineering Xu, Jianliang Yi, Peipei Choi, Byron Bhowmick, Sourav Saha |
| author_sort | Xu, Jianliang |
| collection | NTU |
| description | 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′ as output. Users may choose a query from 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. |
| first_indexed | 2024-10-01T06:09:51Z |
| format | Journal Article |
| id | ntu-10356/83505 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T06:09:51Z |
| publishDate | 2017 |
| record_format | dspace |
| spelling | ntu-10356/835052020-03-07T11:48:53Z AutoG: a visual query autocompletion framework for graph databases Xu, Jianliang Yi, Peipei Choi, Byron Bhowmick, Sourav Saha School of Computer Science and Engineering Query autocompletion Subgraph query 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′ as output. Users may choose a query from 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. MOE (Min. of Education, S’pore) Accepted version 2017-06-06T09:10:33Z 2019-12-06T15:24:26Z 2017-06-06T09:10:33Z 2019-12-06T15:24:26Z 2017 Journal Article Yi, P., Choi, B., Bhowmick, S. S., & Xu, J. (2017). AutoG: a visual query autocompletion framework for graph databases. The VLDB Journal, 26(3), 347-372. 1066-8888 https://hdl.handle.net/10356/83505 http://hdl.handle.net/10220/42600 10.1007/s00778-017-0454-9 en The VLDB Journal © 2017 Springer-Verlag Berlin Heidelberg. This is the author created version of a work that has been peer reviewed and accepted for publication by The VLDB Journal, Springer-Verlag Berlin Heidelberg. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1007/s00778-017-0454-9]. 23 p. application/pdf |
| spellingShingle | Query autocompletion Subgraph query Xu, Jianliang Yi, Peipei Choi, Byron Bhowmick, Sourav Saha AutoG: a visual query autocompletion framework for graph databases |
| title | AutoG: a visual query autocompletion framework for graph databases |
| title_full | AutoG: a visual query autocompletion framework for graph databases |
| title_fullStr | AutoG: a visual query autocompletion framework for graph databases |
| title_full_unstemmed | AutoG: a visual query autocompletion framework for graph databases |
| title_short | AutoG: a visual query autocompletion framework for graph databases |
| title_sort | autog a visual query autocompletion framework for graph databases |
| topic | Query autocompletion Subgraph query |
| url | https://hdl.handle.net/10356/83505 http://hdl.handle.net/10220/42600 |
| work_keys_str_mv | AT xujianliang autogavisualqueryautocompletionframeworkforgraphdatabases AT yipeipei autogavisualqueryautocompletionframeworkforgraphdatabases AT choibyron autogavisualqueryautocompletionframeworkforgraphdatabases AT bhowmicksouravsaha autogavisualqueryautocompletionframeworkforgraphdatabases |