Please use this identifier to cite or link to this item:
|Title:||A semantic approach to keyword search over relational databases||Authors:||Zeng, Z.
|Issue Date:||2013||Citation:||Zeng, Z.,Bao, Z.,Lee, M.L.,Ling, T.W. (2013). A semantic approach to keyword search over relational databases. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8217 LNCS : 241-254. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-41924-9_21||Abstract:||Research in relational keyword search has been focused on the efficient computation of results as well as strategies to rank and output the most relevant ones. However, the challenge to retrieve the intended results remains. Existing relational keyword search techniques suffer from the problem of returning overwhelming number of results, many of which may not be useful. In this work, we adopt a semantic approach to relational keyword search via an Object-Relationship-Mixed data graph. This graph is constructed based on database schema constraints to capture the semantics of objects and relationships in the data. Each node in the ORM data graph represents either an object, or a relationship, or both. We design an algorithm that utilizes the ORM data graph to process keyword queries. Experiment results show our approach returns more informative results compared to existing methods, and is efficient. © Springer-Verlag 2013.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/77980||ISBN:||9783642419232||ISSN:||03029743||DOI:||10.1007/978-3-642-41924-9_21|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 9, 2019
checked on Sep 8, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.