Efficient Top-k Keyword Search in Relational Databases Considering Integrated Candidate Network
Efficiently navigating vast datasets without requiring query language expertise is crucial in the era of Big Data. Keyword search in relational databases offers a promising solution, but many existing methods struggle with datasets of moderate size, such as one million tuples. This paper introduces...
Saved in:
| Main Authors: | Fatemeh Khalifeh, Mohammad Taheri, Mostafa Fakhrahmad, Eghbal Mansoori |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10609359/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Enhancing Keyword Search in Relational Databases With Word Embeddings
by: Fatemeh Khalifeh, et al.
Published: (2025-01-01) -
Search conversion journeys and the missed opportunity of associated keywords
by: David M. Rothschild, et al.
Published: (2025-04-01) -
Multi-keywords fuzzy search encryption supporting dynamic update in an intelligent edge network
by: Xixi Yan, et al.
Published: (2022-12-01) -
Shallow-Depth Quantum Circuit for Unstructured Database Search
by: Junpeng Zhan
Published: (2024-10-01) -
Query recovery attacks against conjunctive keyword searchable encryption
by: DU Ruiying, et al.
Published: (2024-08-01)