A theory of stream queries

    DBPL, pp. 153-168, 2007.

    Cited by: 24|Bibtex|Views5|Links
    EI
    Keywords:
    bounded memory computabilityfixed universeabstract computabilityfinite sequencedata elementMore(5+)

    Abstract:

    Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predicates. Stream queries are modeled as functions from streams to streams. Both timed and untimed settings are considered. Issues investigated include abstract defini...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments