Expressiveness and Performance of Full-Text Search Languages
| dc.contributor.author | Botev, Chavdar | en_US |
| dc.contributor.author | Amer-Yahia, Sihem | en_US |
| dc.contributor.author | Shanmugasundaram, Jayavel | en_US |
| dc.date.accessioned | 2007-04-04T19:44:43Z | |
| dc.date.available | 2007-04-04T19:44:43Z | |
| dc.date.issued | 2005-06-30 | en_US |
| dc.description.abstract | We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for full-text search that can be tightly integrated with structured search. We develop a formal model for full-text search 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 and can be used as a basis for a study of their expressiveness. We show that existing full-text languages are incomplete and develop {\tt COMP}, a complete full-text search language. We also identify practical subsets of {\tt COMP} that are more powerful than existing languages, develop efficient query evaluation algorithms for these subsets, and study experimentally their performance. | en_US |
| dc.format.extent | 379731 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2005-1996 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/5696 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Expressiveness and Performance of Full-Text Search Languages | en_US |
| dc.type | technical report | en_US |
Files
Original bundle
1 - 1 of 1