Record Details

FleXPath: flexible structure and full-text querying for XML

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title FleXPath: flexible structure and full-text querying for XML
 
Creator AMER-YAHIA, SIHEM
LAKSHMANAN, LAKS VS
SHASHANK, PANDIT
 
Subject query languages
query
algorithms
scalability
 
Description 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.
 
Publisher Association for Computing Machinery
 
Date 2009-06-22T07:05:46Z
2011-11-28T08:21:12Z
2011-12-15T09:57:38Z
2009-06-22T07:05:46Z
2011-11-28T08:21:12Z
2011-12-15T09:57:38Z
2004
 
Identifier Proceedings of the ACM SIGMOD International Conference on Management of Data, Paris, France, 13-18 June 2004, 83-94
1-58113-859-8
10.1145/1007568.1007581
http://hdl.handle.net/10054/1564
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1564
 
Language en