Reference architecture for search infrastructure

Ismail, Bukhary Ikhwan; Kandan, Rajendar; Goortani, Ehsan Mostajeran; Mydin, Mohd Nizam Mohd; Khalid, Mohammad Fairus; Hoe, Ong Hong

doi:10.1109/iccsce.2017.8284390

Cited by 3 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The indexer will create an entry for each keyword discovered and may include the keyword's relative position in the document. Indexing is the pivotal operation in an FTS system [14]. The FTS engine then searches within the index and returns hits matching the query.…”

mentioning

confidence: 99%

A High-Performance Non-Indexed Text Search System

Kieu-Do-Nguyen,

Dang,

The Binh

et al. 2024

Electronics

View full text Add to dashboard Cite

Full-text search has a wide range of applications, including tracking systems, computer vision, and natural language processing. Standard methods usually implement a two-phase procedure: indexing and retrieving, with the retrieval performance entirely dependent on the index efficiency. In most cases, the more powerful the index algorithm, the more memory and processing time are required. The amount of time and memory required to index a collection of documents is proportional to its overall size. In this paper, we propose a full-text search hardware implementation without the indexing phase, thus removing the time and memory requirements for indexing. Additionally, we propose an efficient design to leverage the parallel architecture of High Bandwidth Memory (HBM). To our knowledge, few (if not zero) researchers have integrated their full-text search system with an effective data access control on HBM. The functionality of the proposed system is verified on the Xilinx Alveo U50 Field-Programmable Gate Array (FPGA). The experimental results show that our system achieved a throughput of 8 Gigabytes per second, about 6697× speed-up compared to other software-based approaches.

show abstract

mentioning

confidence: 99%