NALMO: Transforming Queries in Natural Language for Moving Objects Databases

被引:3
|
作者
Wang, Xieyang [1 ]
Liu, Mengyi [1 ]
Xu, Jianqiu [1 ]
Lu, Hua [2 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Nanjing, Peoples R China
[2] Roskilde Univ, Roskilde, Denmark
基金
中国国家自然科学基金;
关键词
Moving objects database; Natural language interface; Semantic parsing; Structured language; Query processing; INTERFACE;
D O I
10.1007/s10707-023-00494-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Moving objects databases (MODs) have been extensively studied due to their wide variety of applications including traffic management, tourist service and mobile commerce. However, queries in natural languages are still not supported in MODs. Since most users are not familiar with structured query languages, it is essentially important to bridge the gap between natural languages and the underlying MODs system commands. Motivated by this, we design a natural language interface for moving objects, named NALMO. In general, we use semantic parsing in combination with a location knowledge base and domain-specific rules to interpret natural language queries. We design a corpus of moving objects queries for model training, which is later used to determine the query type. Extracted entities from parsing are mapped through deterministic rules to perform query composition. NALMO is able to well translate moving objects queries into structured (executable) languages. We support five kinds of queries including time interval queries, range queries, nearest neighbor queries, trajectory similarity queries and join queries. We develop the system in a prototype system SECONDO and evaluate our approach using 280 natural language queries extracted from popular conference and journal papers in the domain of moving objects. Four volunteers give the system satisfaction and related suggestions through three rounds of independent tests. Experimental results show that (i) NALMO achieves accuracy and precision 96.8% and 81.1%, respectively, (ii) the average time cost of translating a query is 1.49s, and (iii) the average satisfaction is 95.5%.
引用
收藏
页码:427 / 460
页数:34
相关论文
共 50 条
  • [1] NALMO: Transforming Queries in Natural Language for Moving Objects Databases
    Xieyang Wang
    Mengyi Liu
    Jianqiu Xu
    Hua Lu
    GeoInformatica, 2023, 27 : 427 - 460
  • [2] NALMO: A Natural Language Interface for Moving Objects Databases
    Wang, Xieyang
    Xu, Jianqiu
    Lu, Hua
    PROCEEDINGS OF 17TH INTERNATIONAL SYMPOSIUM ON SPATIAL AND TEMPORAL DATABASES, SSTD 2021, 2021, : 1 - 11
  • [3] Triggers and continuous queries in moving objects databases
    Trajcevski, G
    Scheuermann, P
    14TH INTERNATIONAL WORKSHOP ON DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2003, : 905 - 910
  • [4] Understanding Natural Language Queries over Relational Databases
    Li, Fei
    Jagadish, H. V.
    SIGMOD RECORD, 2016, 45 (01) : 6 - 13
  • [5] Isolating Significant Phrases in Common Natural Language Queries to Databases
    Hoque, Mohammad Moinul
    Mahbub, Md. Shahriar
    Al-Mamun, S. M. Abdullah
    2008 11TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY: ICCIT 2008, VOLS 1 AND 2, 2008, : 546 - 551
  • [6] Parsing "grammatically incomplete" natural language queries to spatial databases
    Wang, FJ
    JOINT 9TH IFSA WORLD CONGRESS AND 20TH NAFIPS INTERNATIONAL CONFERENCE, PROCEEDINGS, VOLS. 1-5, 2001, : 2400 - 2404
  • [7] Knowledge Rich Natural Language Queries over Structured Biological Databases
    Jamil, Hasan M.
    ACM-BCB' 2017: PROCEEDINGS OF THE 8TH ACM INTERNATIONAL CONFERENCE ON BIOINFORMATICS, COMPUTATIONAL BIOLOGY,AND HEALTH INFORMATICS, 2017, : 352 - 361
  • [8] Moving objects in networks Databases
    de Almeida, Victor Teixeira
    CURRENT TRENDS IN DATABASE TECHNOLOGY - EDBT 2006, 2006, 4254 : 75 - 85
  • [9] Algorithms for Moving Objects Databases
    Cotelo Lema, J.A. (gueting@fernuni-hagen.de), 1600, Oxford University Press (46):
  • [10] Algorithms for moving objects databases
    Lema, JAC
    Forlizzi, L
    Güting, RH
    Nardelli, E
    Schneider, M
    COMPUTER JOURNAL, 2003, 46 (06): : 680 - 712