Database Query Processing Using Finite Cursor Machines

    Theory of Computing Systems \/ Mathematical Systems Theory, Volume 44, Issue 4, 2009, Pages 533-560.

    Cited by: 18|Bibtex|Views9|Links
    EI
    Keywords:
    DatabaseRelational algebraSemijoinQuery processing

    Abstract:

    We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what happens in so-called “one-pass” and “two-pass query processing”. Technically, the model is described in the framework of abstract state machines. Our main resul...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments