Machine models for query processing
ACM SIGMOD Record
Yuri, logic, and computer science
Fields of logic and computation
Fields of logic and computation
Parallel evaluation of conjunctive queries
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Declarative abstractions for agent based hybrid control systems
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Factorised representations of query results: size bounds and readability
Proceedings of the 15th International Conference on Database Theory
Hi-index | 0.00 |
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 results are upper and lower bounds for processing relational algebra queries in this model, specifically, queries of the semijoin fragment of the relational algebra.