XPath 2.0 Full-Text Query Rewriting
Recent extensions for full-text search to existing XML query languages such as XPath and XQuery reflect the emerging interest in Information Retrieval over large semistructured data collections that offer a large variety of challenges for efficient search with a rich mixture of structural and textual document contents.The aim of this work is to implement a query parser that takes a query written in the XPath 2.0 Full-Text syntax and translates the query structure into an abstract graph representation that is processable by an existing query engine (TopX) with support for the most important XPath axes as well as full-text extensions.
Guidance: Martin Theobald, Ralf Schenkel
Student: Marco Stadtmüller
Level: Bachelor (Fopra)
Status: Finished
Start:
Prerequisites: Programming skills in Java, some SQL and XML experience
•
last change: Ralf Schenkel, jJanuary 8, 2008.