We study the expressiveness and performance of full-text search languages. Our motivation is to provide a formal basis for comparing full-text search languages and to develop a model for full-text search that can be tightly integrated with structured search. We design a model based on the positions of tokens (words) in the input text, and develop a full-text calculus (FTC) and a full-text algebra (FTA) with equivalent expressive power; this suggests a notion of completeness for full-text search languages. We show that existing full-text languages are incomplete and identify a practical subset of the FTC and FTA that is more powerful than existing languages, but which can still be evaluated efficiently. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Botev, C., Amer-Yahia, S., & Shanmugasundaram, J. (2006). Expressiveness and performance of full-text search languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3896 LNCS, pp. 349–367). https://doi.org/10.1007/11687238_23
Mendeley helps you to discover research relevant for your work.