東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back to Search results for [ null ]

Switch To: Labeled | MARC Mode | ISBD

Comparing top-k algorithms in summar...

Gu, Xin.

Linked to FindBook

Google Book

Amazon

博客來

Comparing top-k algorithms in summary-based XML retrieval.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Comparing top-k algorithms in summary-based XML retrieval./
Author:	Gu, Xin.
Description:	73 p.
Notes:	Source: Masters Abstracts International, Volume: 45-06, page: 3186.
Contained By:	Masters Abstracts International45-06.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR27286
ISBN:	9780494272862

Comparing top-k algorithms in summary-based XML retrieval.
Gu, Xin.

Comparing top-k algorithms in summary-based XML retrieval. - 73 p.

Source: Masters Abstracts International, Volume: 45-06, page: 3186.

Thesis (M.Sc.)--University of Toronto (Canada), 2007.

The semi-structural feature of XML raises the challenge in XML Information Retrieval (XML-IR)---how to efficiently exploit the additional structural information. In this thesis, strategies for XML-IR are studied, with particular emphasis on strategies for top-k computations. Structural summaries are exploited for efficiently evaluating structural constraints in the query. For top-k computations, both a straightforward Merge Algorithm (MA) and a baseline Threshold Algorithm ( TA) are implemented. In order to obtain the pre-computed scores for the relevant elements that are required as input by the top-k computation algorithms, an Exhaustive Retrieval Algorithm (ERA) is implemented. Experiments are conducted with an XML-IR system named TReX using NEXI queries over IEEE Journal and Wikipedia XML collections. The running times of the ERA, TA and MA algorithms are reported and compared. The experimental results show that neither TA nor MA outperforms the other for all queries.

ISBN: 9780494272862Subjects--Topical Terms:

626642
Computer Science.

Comparing top-k algorithms in summary-based XML retrieval.
LDR:01728nam 2200241 a 45 001 957701
005 20110630
008 110630s2007 ||||||||||||||||| ||eng d
020 $a 9780494272862
035 $a (UMI)AAIMR27286
035 $a AAIMR27286
040 $a UMI $c UMI
100 1 $a Gu, Xin. $3 1281043
245 1 0 $a Comparing top-k algorithms in summary-based XML retrieval.
300 $a 73 p.
500 $a Source: Masters Abstracts International, Volume: 45-06, page: 3186.
502 $a Thesis (M.Sc.)--University of Toronto (Canada), 2007.
520 $a The semi-structural feature of XML raises the challenge in XML Information Retrieval (XML-IR)---how to efficiently exploit the additional structural information. In this thesis, strategies for XML-IR are studied, with particular emphasis on strategies for top-k computations. Structural summaries are exploited for efficiently evaluating structural constraints in the query. For top-k computations, both a straightforward Merge Algorithm (MA) and a baseline Threshold Algorithm ( TA) are implemented. In order to obtain the pre-computed scores for the relevant elements that are required as input by the top-k computation algorithms, an Exhaustive Retrieval Algorithm (ERA) is implemented. Experiments are conducted with an XML-IR system named TReX using NEXI queries over IEEE Journal and Wikipedia XML collections. The running times of the ERA, TA and MA algorithms are reported and compared. The experimental results show that neither TA nor MA outperforms the other for all queries.
590 $a School code: 0779.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a University of Toronto (Canada). $3 1017674
773 0 $t Masters Abstracts International $g 45-06.
790 $a 0779
791 $a M.Sc.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR27286