{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T17:00:15Z","timestamp":1758992415969,"version":"3.32.0"},"reference-count":6,"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":[[2024,8]]},"abstract":"<jats:p>\n            Existing knowledge graph query approaches, whether traditional textual query languages or visual query languages, have steep learning curves that are unfriendly for non-expert users. This demonstration presents a Visual Query approach based on Full-Text search for knowledge graphs, called VQFT, which simplifies the process of querying knowledge graphs for users. Inspired by\n            <jats:italic>full-text search<\/jats:italic>\n            techniques, VQFT aims to combine the user-friendliness of\n            <jats:italic>visual query<\/jats:italic>\n            with the intuitiveness of\n            <jats:italic>full-text search<\/jats:italic>\n            , enabling users to query knowledge graphs as straightforward as using a search engine.\n            <jats:italic>Faceted full-text indexes, visual query constructor<\/jats:italic>\n            , and an\n            <jats:italic>interactive user interface<\/jats:italic>\n            are designed to achieve this goal. User tests and surveys have demonstrated that VQFT is more user-friendly and easier to learn than existing methods, which simplifies the construction of knowledge graph queries for non-expert users.\n          <\/jats:p>","DOI":"10.14778\/3685800.3685884","type":"journal-article","created":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T17:25:21Z","timestamp":1731086721000},"page":"4397-4400","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["VQFT: A Visual Query Approach Based on Full-Text Search for Knowledge Graphs"],"prefix":"10.14778","volume":"17","author":[{"given":"Zhaozhuo","family":"Li","sequence":"first","affiliation":[{"name":"Tianjin University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"Tianjin University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Wang","sequence":"additional","affiliation":[{"name":"Tongji University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yajun","family":"Yang","sequence":"additional","affiliation":[{"name":"Tianjin University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bohan","family":"Li","sequence":"additional","affiliation":[{"name":"Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Han","sequence":"additional","affiliation":[{"name":"Tianjin Academy of Fine Arts, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,8]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"158","article-title":"ViziQuer: a web-based tool for visual diagrammatic queries over RDF data","volume":"2018","author":"\u010cer\u0101ns K\u0101rlis","year":"2018","unstructured":"K\u0101rlis \u010cer\u0101ns, Agris \u0160ostaks, Uldis Boj\u0101rs, J\u016blija Ov\u010di\u0148\u0148ikova, Lelde L\u0101ce, Mikus Grasmanis, Aiga Rom\u0101ne, Art\u016brs Sprogis, and Juris B\u0101rzdi\u0148\u0161. 2018. ViziQuer: a web-based tool for visual diagrammatic queries over RDF data. In The Semantic Web: ESWC 2018. 158--163.","journal-title":"The Semantic Web: ESWC"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190657"},{"key":"e_1_2_1_3_1","volume-title":"The Semantic Web: ESWC","author":"Haag Florian","year":"2015","unstructured":"Florian Haag, Steffen Lohmann, Stephan Siek, and Thomas Ertl. 2015. QueryVOWL: A visual query notation for linked data. In The Semantic Web: ESWC 2015. Springer, 387--402."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108870"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1567274.1567278"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3611540.3611592"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3685800.3685884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T05:24:21Z","timestamp":1735622661000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3685800.3685884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":6,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.14778\/3685800.3685884"],"URL":"https:\/\/doi.org\/10.14778\/3685800.3685884","relation":{},"ISSN":["2150-8097"],"issn-type":[{"type":"print","value":"2150-8097"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"2024-11-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}