Sciweavers

428 search results - page 29 / 86
» The Use of Summaries in XML Retrieval
Sort
View
KCAP
2009
ACM
14 years 3 months ago
Incremental summarization using taxonomy
In this paper, a new summarization system is proposed, which summarizes a document by interactively scoring the sentences using already-extracted summary so that the sentence whic...
DongHyun Choi, Key-Sun Choi
WAW
2007
Springer
77views Algorithms» more  WAW 2007»
14 years 2 months ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 10 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
WEBDB
2004
Springer
170views Database» more  WEBDB 2004»
14 years 2 months ago
Content and Structure in Indexing and Ranking XML
Rooted in electronic publishing, XML is now widely used for modelling and storing structured text documents. Especially in the WWW, retrieval of XML documents is most useful in co...
Felix Weigel, Holger Meuss, Klaus U. Schulz, Fran&...
WEBDB
2004
Springer
125views Database» more  WEBDB 2004»
14 years 2 months ago
Best-Match Querying from Document-Centric XML
On the Web, there is a pervasive use of XML to give lightweight semantics to textual collections. Such documentcentric XML collections require a query language that can gracefully...
Jaap Kamps, Maarten Marx, Maarten de Rijke, Bö...