skip to main content
article
Free Access

Using collaborative filtering to weave an information tapestry

Published:01 December 1992Publication History
First page image

References

  1. 1 ANSI Database language SQL. (Apr. 199I), DiS 9075:199x(E).Google ScholarGoogle Scholar
  2. 2 Denning, PJ. Electronic junk. Com~ mun. ACM 25, 3 (Mar. 1982), !63- 165. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Gifford, D.K., Baldwin, R.W~, Berlin, S.T. and Lucassen, J.M. An architecture for large scale information systems. In Proceedings Tenth Symposium on Operating Systems Principles (Orc~ Island, Wash., Dec. 1985), pp. 161 170. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Kent, J., Terry~ D~ and Orr, W.S. Browsing electronic mail: Experiences interfacing a mail system to a DBMS. In Proceedings Fourteentti International Conference on VeD, Large Data. bases (VLDB), (Los Angeles, Calif., Aug. t988), pp. !!2-123. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Lutz, E,, Kleist-Retzow, H.V. and Hoerning, K. MAFIA~An active mail-filter agent for an intelligent document processing support. Multi.. User lnterfhces and Application. s:, S~ Gibbs and A.A~ Verrijn-Stuart, Eds~, North Holland, 1990, pp. 16-32. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Malone, T,W~, Grant, K,R., Turbak, iF.A., Brobst, S.A. and Cohen, M.D~ Intelligent information sharing sys.~ terns. Commun. ACM 30, 5 (.May 1987'1, 390-40'2. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Palme, J. You have !34 unread mail:! Do you want: to read them now? In Proceedings IFIP WG 6.5 Working Con.-. ference on :Computer-baa"ed document Ser~ vices (Nottingham, England May 1984), pp. 175- ! 84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Pollock, S. A rule-based message ilttering system. ACM Trans. ()~f lnf Syst, 6, 3 (July 1988), 232-254. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Rosenberg, J., Everhart, C.F. and Borenstein, N.S. An overview of the Andrew Message System. In Proceed. ings SIGCOMM '.8'7 Workshop on Fron.- tie- in Computer Communicatwns Technology (Stowe, Vt., Aug. i987), pp. 99-108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Snfith, B. The Unix Connection. Byte 14, 5 (May 1989), 245-251.Google ScholarGoogle Scholar
  11. 11 Sybase. Transact-SQL user's guide. Sybase, Inc., Oct. 1989.Google ScholarGoogle Scholar
  12. 12 Terry, D.B. 7 steps to a better mail system. Message .Handling Syste-~r~ and Application Layer Communication Proto~ cols, P. Schicker' and E. Stefl~;rud, Eds~, North Holland,. 1.9:91, pp. 23-. 33.Google ScholarGoogle Scholar
  13. 13 Terry, D.B~, Goidberg, D., Nichols, D. and Oki, B. Continuous Queries Over Append-Only Databases, In Proceedings ACM-SIGMODS Symposium on the Management of Data, (San Diego, June i992), pp. 321-330. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Using collaborative filtering to weave an information tapestry

        Recommendations

        Reviews

        Thomas C. Lowe

        Filtering processes are the same as, or descended from, selective dissemination of information (or SDI, although that acronym has been commandeered). The general concepts apply to traditional document collections, where an SDI system brings selected new accessions to appropriate patrons' attention, or automatically copies and routes news briefs, memoranda, directives, or information. The notions apply equally to productivity tools for environments increasingly deluged with electronic mail. Email is the motivation for Tapestry, a system that features, in addition to content-based filtering, human contribution to the filtering, called collaborative filtering . Those who read a document in Tapestry can annotate that document by recording their responses to each document in an append-only annotation store. Documents are indexed only once; documents are never re-indexed or purged in the ideal case, so the indexing and annotation information are in append-only storage. Therefore, new indexing criteria cannot be introduced, and endorsements cannot be expunged. A Tapestry requirement for “continuous semantics” results in the restriction that, for any fixed query, the number of documents returned by that query must be a weakly monotonic increasing function of time. So, as the authors illustrate, a valid query is “all bug reports that [were] not answered within two weeks,” and an invalid query is “all bug reports that are over two weeks old and have not been answered.” This restriction may not be inconsistent with a document-streaming SDI processor's typical application. The paper describes the advantages of Tapestry's collaborative nature, its implementation under Sybase with translation from its peculiar language to SQL, and existing and planned electronic mail connections. Eventually, Tapestry is intended to be a replacement for current email systems.

        Access critical reviews of Computing literature here

        Become a reviewer for Computing Reviews.

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image Communications of the ACM
          Communications of the ACM  Volume 35, Issue 12
          Special issue on information filtering
          Dec. 1992
          85 pages
          ISSN:0001-0782
          EISSN:1557-7317
          DOI:10.1145/138859
          Issue’s Table of Contents

          Copyright © 1992 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 December 1992

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader