ACM Home Page
Please provide us with feedback. Feedback
Query biased snippet generation in XML search
Full text PdfPdf (440 KB)
Source
International Conference on Management of Data archive
Proceedings of the 2008 ACM SIGMOD international conference on Management of data table of contents
Vancouver, Canada
SESSION: Research Session 8: XML Query Processing table of contents
Pages 315-326  
Year of Publication: 2008
ISBN:978-1-60558-102-6
Authors
Yu Huang  Arizona State University, Tempe, AZ, USA
Ziyang Liu  Arizona State University, Tempe, AZ, USA
Yi Chen  Arizona State University, Tempe, AZ, USA
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 235,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1376616.1376651
What is a DOI?

ABSTRACT

Snippets are used by almost every text search engine to complement ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance semantics are difficult to assess. Despite the fact that XML is a standard representation format of web data, research on generating result snippets for XML search remains untouched.

In this paper we present a system, eXtract, which addresses this important yet open problem. We identify that a good XML result snippet should be a self-contained meaningful information unit of a small size that effectively summarizes this query result and differentiates it from others, according to which users can quickly assess the relevance of the query result. We have designed and implemented a novel algorithm to satisfy these requirements and verified its efficiency and effectiveness through experiments.


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
 
2
3
4
5
 
6
 
7
V. Hristidis, Y. Papakonstantinou, and A. Balmin. Keyword Proximity Search on XML Graphs. In ICDE, 2003.
8
 
9
10
11
 
12
 
13
 
14
15
16
17
 
18
V. Vesper. Let?s Do Dewey. http://www.mtsu.edu/ vvesper/dewey.html.
19
20

CITED BY  7