| Quark: an efficient XQuery full-text implementation |
| Full text |
Pdf
(229 KB)
|
| Source
|
International Conference on Management of Data
archive
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
table of contents
Chicago, IL, USA
DEMONSTRATION SESSION: Group C
table of contents
Pages: 781 - 783
Year of Publication: 2006
ISBN:1-59593-434-0
|
|
Authors
|
|
Anand Bhaskar
|
Cornell University, Ithaca, New York
|
|
Chavdar Botev
|
Cornell University, Ithaca, New York
|
|
Muthiah M. Muthaia Chettiar
|
Cornell University, Ithaca, New York
|
|
Lin Guo
|
Cornell University, Ithaca, New York
|
|
Jayavel Shanmugasundaram
|
Cornell University, Ithaca, New York
|
|
Feng Shao
|
Cornell University, Ithaca, New York
|
|
Fan Yang
|
Cornell University, Ithaca, New York
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 10, Downloads (12 Months): 49, Citation Count: 3
|
|
|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
R. J. Bayardo , D. Gruhl , V. Josifovski , J. Myllymaki, An evaluation of binary xml encoding optimizations for fast stream based xml processing, Proceedings of the 13th international conference on World Wide Web, May 17-20, 2004, New York, NY, USA
[doi> 10.1145/988672.988719]
|
| |
2
|
C. Botev and J. Shanmugasundaram. Context-sensitive keyword search and ranking for xml. In WebDB'2005 Poster.
|
| |
3
|
Z. Chen, J. Gehrke, F. Korn, N. Koudas, J. Shanmugasundaram, and D. Srivastava. Index structures for matching xml twigs using relational query processors. In XSDM'2005.
|
| |
4
|
|
 |
5
|
|
 |
6
|
|
| |
7
|
|
 |
8
|
Igor Tatarinov , Stratis D. Viglas , Kevin Beyer , Jayavel Shanmugasundaram , Eugene Shekita , Chun Zhang, Storing and querying ordered XML using a relational database system, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin
[doi> 10.1145/564691.564715]
|
| |
9
|
|
CITED BY 3
|
|
|
|
|
Feng Shao , Lin Guo , Chavdar Botev , Anand Bhaskar , Muthiah Chettiar , Fan Yang , Jayavel Shanmugasundaram, Efficient keyword search over virtual XML views, Proceedings of the 33rd international conference on Very large data bases, September 23-27, 2007, Vienna, Austria
|
|
|
Feng Shao , Lin Guo , Chavdar Botev , Anand Bhaskar , Muthiah Chettiar , Fan Yang , Jayavel Shanmugasundaram, Efficient keyword search over virtual XML views, The VLDB Journal — The International Journal on Very Large Data Bases, v.18 n.2, p.543-570, April 2009
|
|