Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

SIFT - a Tool for Wide-Area Information Dissemination

Tak W. Yan, Hector Garcia-Molina, Stanford University

The dissemination model is becoming increasingly important in wide-area information system. In this model, the user subscribes to an information dissemination service by submitting profiles that describe his interests. He then passively receives new, filtered information. The Stanford Information Filtering Tool (SIFT) is a tool to help provide such service. It supports full-text filtering using well-known information retrieval models. The SIFT filtering engine implements novel indexing techniques, capable of processing large volumes of information against a large number of profiles. It runs on several major Unix platforms and is freely available to the public. In this paper we present SIFT's approach to user interest modeling and user-server communication. We demonstrate the processing capability of SIFT by describing a running server that disseminates USENET News. We present an empirical study of SIFT's performance, examining its main memory requirement and ability to scale with information volume and user population.

Tak W. Yan, Stanford University

Hector Garcia-Molina, Stanford University

BibTeX
@inproceedings {260466,
author = {Tak W. Yan and Hector Garcia-Molina},
title = {{SIFT} - a Tool for {Wide-Area} Information Dissemination},
booktitle = {USENIX 1995 Technical Conference (USENIX 1995 Technical Conference)},
year = {1995},
address = {New Orleans, LA},
url = {https://www.usenix.org/conference/usenix-1995-technical-conference/sift-tool-wide-area-information-dissemination},
publisher = {USENIX Association},
month = jan
}
Download

Links

Paper: 
http://usenix.org/publications/library/proceedings/neworl/full_papers/yan.ps
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us