IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v15y2023i3p106-d1092332.html
   My bibliography  Save this article

Complex Queries for Querying Linked Data

Author

Listed:
  • Hasna Boumechaal

    (LIRE Laboratory, University of Constantine 2- Abdelhamid Mehri, Constantine 25000, Algeria)

  • Zizette Boufaida

    (LIRE Laboratory, University of Constantine 2- Abdelhamid Mehri, Constantine 25000, Algeria)

Abstract

Querying Linked Data is one of the most important issues for the semantic web community today because it requires the user to understand the structure and vocabularies used in various data sources. Furthermore, users must be familiar with the syntax of query languages, such as SPARQL. However, because users are accustomed to natural language-based search, novice users may find it challenging to use these features. As a result, new approaches for querying Linked Data sources on the web with NL queries must be defined. In this paper, we propose a novel system for converting natural language queries into SPARQL queries to query linked and heterogeneous semantic data on the web. While most existing methods have focused on simple queries and have ignored complex queries, the method described in this work aims to handle various types of NL queries, particularly complex queries containing negation, numbers, superlatives, and comparative adjectives. Three complementary strategies are used in this context: (1) identifying the semantic relations between query terms in order to understand the user’s needs; (2) mapping the NL terms to semantic entities; and (3) constructing the query’s valid triples based on the different links used to describe the identified entities in order to generate correct SPARQL queries. The empirical evaluations show that the proposed system is effective.

Suggested Citation

  • Hasna Boumechaal & Zizette Boufaida, 2023. "Complex Queries for Querying Linked Data," Future Internet, MDPI, vol. 15(3), pages 1-20, March.
  • Handle: RePEc:gam:jftint:v:15:y:2023:i:3:p:106-:d:1092332
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/15/3/106/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/15/3/106/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:15:y:2023:i:3:p:106-:d:1092332. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.