Cut as a querying unit for WWW, Netnews, e-mail
Keishi Tajima, Yoshiaki Mizuuchi, Masatsugu Kitagawa, Katsumi Tanaka · 1998
In this paper?WC' propose a query framework for hypcrtext data in general, and for WWW pages, Netnews articles, and e-mails in particular.In existing query tools for hypertext data, such as search engines for WWW or intelligent news/mail readers, data units in query are typically individual nodes.In actual hypertext data, however, one topic is often described over a series of connected ~lotles, and therefore, the logical data unit should he such a series of nodes corresponding to one topic.This discrepancy between the data unit, in query and the logical data unit hinders the efficient information discovery from hypertext data.To solve this problem, in our framework, we divide hypertexts into connectctl subgraphs corresponding to individual t,opics, and we use t,hose subgraphs as the data units in queries.