Analyze the efficiency of keyword search algorithms

Daniela Enachescu () and Andreea Radulescu
Additional contact information
Daniela Enachescu: UNIVERSITATEA PETROL-GAZE, PLOIESTI
Andreea Radulescu: UNIVERSITÉ LIBRE DE BRUXELLES

Anale. Seria Stiinte Economice. Timisoara, 2012, vol. XVIII, 871-878

Abstract: This paper intends to analyze, through developed software, the answer of various algorithms to keyword search in random strings problems within the constraint of time and memory space used. The program developed is able to choose, depending on the algorithm used, the maximum number of characters used to comply with data constraints. Afterwards, the performance of algorithms in operations of keyword search in random strings is analyzed. Tests were performed by generating random texts of different lengths, using different character sets. Results can be used to minimize search time, such as in the FIND function used by text editors.

Keywords: String matching; keyword search; text editors (word processing) (search for similar items in EconPapers)
JEL-codes: C6 (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://fse.tibiscus.ro/anale/Lucrari2012/kssue2012_143.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tdt:annals:v:xviii:y:2012:p:871-878

Access Statistics for this article

More articles in Anale. Seria Stiinte Economice. Timisoara from Faculty of Economics, Tibiscus University in Timisoara Contact information at EDIRC.
Bibliographic data for series maintained by Ramona Violeta Vasilescu ( this e-mail address is bad, please contact ).