{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:53:19Z","timestamp":1770540799224,"version":"3.49.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:p>Visual Graph Query Interfaces (VQIs) empower non-programmers to query graph data by constructing visual queries intuitively. Devising efficient technologies in Graph Query Engines (GQEs) for interactive search and exploration has also been studied for years. However, these two vibrant scientific fields are traditionally independent of each other, causing a vast barrier for users who wish to explore the full-stack operations of graph querying. In this demonstration, we propose a novel VQI system built upon Neo4j called VisualNeo that facilities an efficient subgraph query in large graph databases. VisualNeo inherits several advanced features from recent advanced VQIs, which include the data-driven gui design and canned pattern generation. Additionally, it embodies a database manager module in order that users can connect to generic Neo4j databases. It performs query processing through the Neo4j driver and provides an aesthetic query result exploration.<\/jats:p>","DOI":"10.14778\/3611540.3611608","type":"journal-article","created":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T11:32:37Z","timestamp":1694777557000},"page":"4010-4013","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query Engines"],"prefix":"10.14778","volume":"16","author":[{"given":"Kai","family":"Huang","sequence":"first","affiliation":[{"name":"Hong Kong Univ. of Sci. &amp; Tech."}]},{"given":"Houdong","family":"Liang","sequence":"additional","affiliation":[{"name":"Hong Kong Univ. of Sci. &amp; Tech."}]},{"given":"Chongchong","family":"Yao","sequence":"additional","affiliation":[{"name":"Hong Kong Univ. of Sci. &amp; Tech."}]},{"given":"Xi","family":"Zhao","sequence":"additional","affiliation":[{"name":"Hong Kong Univ. of Sci. &amp; Tech."}]},{"given":"Yue","family":"Cui","sequence":"additional","affiliation":[{"name":"Hong Kong Univ. of Sci. &amp; Tech."}]},{"given":"Yao","family":"Tian","sequence":"additional","affiliation":[{"name":"Hong Kong Univ. of Sci. &amp; Tech."}]},{"given":"Ruiyuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Hong Kong Univ. of Sci. &amp; Tech."}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Hong Kong Univ. of Sci. &amp; Tech."}]}],"member":"320","published-online":{"date-parts":[[2023,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Neo4j Graph Data Platform. Neo4j sandbox."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3520157"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588736"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476256"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3384681"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137794"},{"key":"e_1_2_1_7_1","volume-title":"Edward M. Graph drawing by force-directed placement. Software: Practice and experience","author":"Fruchterman","year":"1991","unstructured":"Fruchterman, Thomas MJ and Reingold, Edward M. Graph drawing by force-directed placement. Software: Practice and experience, 1991."},{"key":"e_1_2_1_8_1","volume-title":"SIGMOD","author":"Huang K","year":"2019","unstructured":"Huang K, Chua H E, Bhowmick S S, et al. CATAPULT: data-driven selection of canned patterns for efficient visual graph query formulation. In SIGMOD, 2019."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457251"},{"key":"e_1_2_1_10_1","volume-title":"PVLDB","author":"Bonifati","year":"2017","unstructured":"Bonifati, Angela and Martens, Wim and Timm, Thomas. An Analytical Study of Large SPARQL Query Logs. In PVLDB, 2017."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554862"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.49"},{"key":"e_1_2_1_13_1","volume-title":"METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices","author":"Karypis","year":"1997","unstructured":"Karypis, George and Kumar, Vipin. METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. 1997."},{"key":"e_1_2_1_14_1","unstructured":"Neo4j Graph Data Platform. Neo4j. Available at: https:\/\/neo4j.com\/."},{"key":"e_1_2_1_15_1","unstructured":"National Center for Biotechnology Information. PubChem Sketcher. Available at: https:\/\/pubchem.ncbi.nlm.nih.gov\/edit3\/index.html."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1184038"},{"key":"e_1_2_1_17_1","unstructured":"NHOGS Interactive. Popoto.js. Available at: https:\/\/popotojs.com."},{"key":"e_1_2_1_18_1","unstructured":"Graphileon. Available at: https:\/\/graphileon.com\/."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3611540.3611608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:33:14Z","timestamp":1757543594000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3611540.3611608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":18,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10.14778\/3611540.3611608"],"URL":"https:\/\/doi.org\/10.14778\/3611540.3611608","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"2023-08-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}