Continuous queries over append-only databases

DOI Web Site 2 Citations
  • Douglas Terry
    Xerox Corporation, Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Altoj CA
  • David Goldberg
    Xerox Corporation, Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Altoj CA
  • David Nichols
    Xerox Corporation, Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Altoj CA
  • Brian Oki
    Xerox Corporation, Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Altoj CA

Search this article

Description

<jats:p> 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 <jats:italic>continuous queries</jats:italic> 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. </jats:p>

Journal

  • ACM SIGMOD Record

    ACM SIGMOD Record 21 (2), 321-330, 1992-06

    Association for Computing Machinery (ACM)

Citations (2)*help

See more

Details 詳細情報について

Report a problem

Back to top