A probabilistic relational algebra for the integration of information retrieval and database systems
ACM Transactions on Information Systems (TOIS)
SilkRoute: trading between relations and XML
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
XIRQL: a query language for information retrieval in XML documents
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The Index-Based XXL Search Engine for Querying XML Data with Relevance Ranking
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Querying XML Views of Relational Data
Proceedings of the 27th International Conference on Very Large Data Bases
An evaluation of binary xml encoding optimizations for fast stream based xml processing
Proceedings of the 13th international conference on World Wide Web
Triggers over nested views of relational data
ACM Transactions on Database Systems (TODS)
Efficient keyword search over virtual XML views
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient keyword search over virtual XML views
The VLDB Journal — The International Journal on Very Large Data Bases
XQuery Full Text Implementation in BaseX
XSym '09 Proceedings of the 6th International XML Database Symposium on Database and XML Technologies
Lightweight integration of IR and DB for scalable hybrid search with integrated ranking support
Web Semantics: Science, Services and Agents on the World Wide Web
Hi-index | 0.00 |
The XQuery 1.0 and XPath 2.0 Full-text (XQFT) language has been developed by the W3C to extend XQuery and XPath with full-text search capabilities. XQFT allows users to specify a mix of structured and complex full-text predicates, and also allows users to score/rank such queries. The power and flexibility of XQFT gives rise to two interesting questions. First, is it possible to efficiently integrate a full-function XML query language with sophisticated full-text search? Second, is it possible to score and rank arbitrary XQuery and XQFT queries? In this demonstration, we present evidence that it is indeed possible to achieve the above goals. We demonstrate the Quark open-source data management system and show how we can seamlessly and efficiently integrate structured and unstructured search over XML data. In particular, we demonstrate (a) techniques for efficiently evaluating keyword search over virtual XML views, and (b) a framework for scoring both structured and full-text predicates.