Please use this identifier to cite or link to this item:
|Title:||Almost linear semantic XML keyword search||Authors:||Tekli, Joe
|Affiliations:||Department of Mechatronics Engineering||Keywords:||Query Processing
|Issue Date:||2021||Part of:||Proceedings of the 13th International Conference on Management of Digital EcoSystems||Start page:||129||End page:||138||Conference:||International Conference on Management of Digital EcoSystems ( 13th : 1-3 Nov, 2021 : Tunisia )||Abstract:||
Many efforts have been deployed by the IR community to extend free-text query processing toward semi-structured XML search. Most methods rely on the concept of Lowest Comment Ancestor (LCA) between two or multiple structural nodes to identify the most specific XML elements containing query keywords posted by the user. Yet, few of the existing approaches consider XML semantics, and the methods that process semantics generally rely on computationally expensive word sense disambiguation (WSD) techniques, or apply semantic analysis in one stage only: performing query relaxation/refinement over the bag of words retrieval model, to reduce processing time. In this paper, we describe the building blocks of a new approach for XML keyword search aiming to solve the limitations mentioned above. Our solution first transforms the XML document collection (offline) and the keyword query (on-the-fly) into meaningful semantic representations using context-based and global disambiguation methods, specially designed to allow almost linear computation efficiency. Consequently, the semantically augmented XML data tree is processed for structural node clustering, based on semantic query concepts (i.e., key-concepts), in order to identify and rank candidate answer sub-trees containing related occurrences of query key-concepts. Preliminary experiments highlight the quality and potential of our approach.
|URI:||https://scholarhub.balamand.edu.lb/handle/uob/5306||ISBN:||9781450383141||DOI:||10.1145/3444757.3485079||Open URL:||Link to full text||Type:||Conference Paper|
|Appears in Collections:||Department of Mechatronics Engineering|
Show full item record
checked on Aug 13, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.