Continuous queries over append-only databases

  • Authors:

  • Douglas Terry;David Goldberg;David Nichols;Brian Oki

  • Affiliations:

  • Xerox Corporation, Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Altoj CA;Xerox Corporation, Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Altoj CA;Xerox Corporation, Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Altoj CA;Xerox Corporation, Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Altoj CA

  • Venue:
  • SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
  • Year:
  • 1992

Quantified Score

Hi-index 0.02

Visualization

Abstract

In a database to which data is continually added, users may wish to issue a permanent query and be notified whenever data matches the query. If such continuous queries examine only single records, this can be implemented by examining each record as it arrives. This is very efficient because only the incoming record needs to be scanned. This simple approach does not work for queries involving joins or time. The Tapestry system allows users to issue such queries over a database of mail and bulletin board messages. The user issues a static query, such as “show me all messages that have been replied to by Jones,” as though the database were fixed and unchanging. Tapestry converts the query into an incremental query that efficiently finds new matches to the original query as new messages are added to the database. This paper describes the techniques used in Tapestry, which do not depend on triggers and thus be implemented on any commercial database that supports SQL. Although Tapestry is designed for filtering mail and news messages, its techniques are applicable to any append-only database.