Expressiveness and Performance of Full-Text Search Languages | Zendy

Chavdar Botev | Zendy; Sihem Amer-Yahia | Zendy; Jayavel Shanmugasundaram | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Expressiveness and Performance of Full-Text Search Languages

Author(s) -

Chavdar Botev,

Sihem Amer-Yahia,

Jayavel Shanmugasundaram

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-32960-9

DOI - 10.1007/11687238_23

Subject(s) - computer science , expressive power , full text search , natural language processing , artificial intelligence , regular expression , programming language , information retrieval , search engine

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research