The number, size, and user population of bibliographic and full-text document databases are rapidly growing. With a high document arrival rate, it becomes essential for users of such databases to have access to the very latest documents; yet the high document arrival rate also makes it difficult for users to keep themselves updated. It is desirable to allow users to submit profiles, i.e., queries that are constantly evaluated, so that they will be automatically informed of new additions that may be of interest. Such service is traditionally called Selective Dissemination of Information (SDI). The high document arrival rate, the huge number of users, and the timeliness requirement of the service pose a challenge in achieving efficient SDL. In this article, we propose several index structures for indexing profiles and algorithms that efficiently match documents against large number of profiles. We also present analysis and simulation results to compare their performance under different scenarios.
%0 Journal Article
%1 Yan-Index-1994
%A Yan, Tak W.
%A Garcia-Molina, Hector
%D 1994
%J ACM Trans. Database Syst.
%K Datenbank Indexstrukturen Information boolean wismasys0809
%N 2
%P 332-364
%T Index Structures for Selective Dissemination of Information Under the Boolean Model
%U http://dblp.uni-trier.de/db/journals/tods/tods19.html#YanG94
%V 19
%X The number, size, and user population of bibliographic and full-text document databases are rapidly growing. With a high document arrival rate, it becomes essential for users of such databases to have access to the very latest documents; yet the high document arrival rate also makes it difficult for users to keep themselves updated. It is desirable to allow users to submit profiles, i.e., queries that are constantly evaluated, so that they will be automatically informed of new additions that may be of interest. Such service is traditionally called Selective Dissemination of Information (SDI). The high document arrival rate, the huge number of users, and the timeliness requirement of the service pose a challenge in achieving efficient SDL. In this article, we propose several index structures for indexing profiles and algorithms that efficiently match documents against large number of profiles. We also present analysis and simulation results to compare their performance under different scenarios.
@article{Yan-Index-1994,
abstract = {The number, size, and user population of bibliographic and full-text document databases are rapidly growing. With a high document arrival rate, it becomes essential for users of such databases to have access to the very latest documents; yet the high document arrival rate also makes it difficult for users to keep themselves updated. It is desirable to allow users to submit profiles, i.e., queries that are constantly evaluated, so that they will be automatically informed of new additions that may be of interest. Such service is traditionally called Selective Dissemination of Information (SDI). The high document arrival rate, the huge number of users, and the timeliness requirement of the service pose a challenge in achieving efficient SDL. In this article, we propose several index structures for indexing profiles and algorithms that efficiently match documents against large number of profiles. We also present analysis and simulation results to compare their performance under different scenarios.},
added-at = {2008-11-04T22:24:03.000+0100},
author = {Yan, Tak W. and Garcia-Molina, Hector},
biburl = {https://www.bibsonomy.org/bibtex/245646934a1c1971810b4e87be08e9f07/olhah},
interhash = {efdc3fa239194602b5a98433084c352b},
intrahash = {45646934a1c1971810b4e87be08e9f07},
journal = {ACM Trans. Database Syst.},
keywords = {Datenbank Indexstrukturen Information boolean wismasys0809},
number = 2,
pages = {332-364},
timestamp = {2008-11-05T17:20:59.000+0100},
title = {Index Structures for Selective Dissemination of Information Under the Boolean Model},
url = {http://dblp.uni-trier.de/db/journals/tods/tods19.html#YanG94},
volume = 19,
year = 1994
}