.png){kind=icon}
Return
String search experimentation using massive data
.png){kind=icon}
OA
AI
DOI：10.1098/rsta.2013.0135.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Descriptions of new string search or indexing algorithms are often accompanied by an experimental evaluation. In this article, we provide guidance as to how such investigations can be carried out, drawing on our experience of measurement in this field. In particular, we describe methodologies for stratifying patterns according to their length and frequency, so that precise response-time measurements can be made; and we describe a metric for categorizing the extent of 'repetitiveness' in a text, so that dataset type can also be factored into evaluations. We show that separating these concepts allows a greater understanding of the behaviour of string search algorithms.
Keywords:
pattern search
string indexing
experimental evaluation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
3.7
Papers:
7.8K
Citations:
2.8W
Organization
.png){kind=icon}
