Expressiveness and Performance of Full-Text Search Languages

@inproceedings{Botev2006ExpressivenessAP,
  title={Expressiveness and Performance of Full-Text Search Languages},
  author={Chavdar Botev and Sihem Amer-Yahia and Jayavel Shanmugasundaram},
  booktitle={EDBT},
  year={2006}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
11 Citations
38 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 38 references

T

  • N. Fuhr
  • R̈olleke. A Probabilistic Relational Algebra for…
  • 1997
Highly Influential
9 Excerpts

XIRQL: An Extension of XQL for Information Retrieval

  • N. Fuhr, K. Grossjohann
  • Integrating Keyword Search into XML Query…
  • 2000
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…