FleXPath
Authors:
Open Access
- 13 June 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 83-94
Abstract
Querying XML data is a well-explored topic with powerful database-style query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for querying XML documents is full-text search on textual content. In this paper, we study fundamental challenges that arise when we try to integrate these two querying paradigms. While keyword search is based on approximate matching, XPath has exact match semantics. We address this mismatch by considering queries on structure as a "template", and looking for answers that best match this template and the full-text search. To achieve this, we provide an elegant definition of relaxation on structure and define primitive operators to span the space of relaxations. Query answering is now based on ranking potential answers on structural and full-text search conditions. We set out certain desirable principles for ranking schemes and propose natural ranking schemes that adhere to these principles. We develop efficient algorithms for answering top-K queries and discuss results from a comprehensive set of experiments that demonstrate the utility and scalability of the proposed framework and algorithms.© ACKeywords
This publication has 10 references indexed in Scilit:
- Texquery2004
- Searching XML documents via XML fragments2003
- XRANK2003
- Containment and equivalence for an XPath fragment2002
- Top- k selection queries over relational databasesACM Transactions on Database Systems, 2002
- PREFER2001
- A flexible model for retrieval of SGML documents1998
- Structured document storage and refined declarative and navigational access mechanisms in HyperStorMThe VLDB Journal, 1997
- On saying “Enough already!” in SQL1997
- Fast evaluation of structured queries for information retrieval1995