Database query processing using finite cursor machines

Authors:
Martin Grohe;Yuri Gurevich;Dirk Leinders;Nicole Schweikardt;Jerzy Tyszkiewicz;Jan Van den Bussche
Affiliations:
Humboldt-University Berlin;Microsoft Research;Hasselt University and Transnational University of Limburg;Humboldt-University Berlin;University of Warsaw;Hasselt University and Transnational University of Limburg
Venue:
ICDT'07 Proceedings of the 11th international conference on Database Theory
Year:
2007

Citing 26
Cited 3

Fundamental techniques for order optimization

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Evolving algebras 1993: Lipari guide

Specification and validation methods
The space complexity of approximating the frequency moments

Journal of Computer and System Sciences
Degrees of acyclicity for hypergraphs and relational database schemes

Journal of the ACM (JACM)
Computing on data streams

External memory algorithms
Logics with aggregate operators

Journal of the ACM (JACM)
Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Database System Implementation

Database System Implementation
Processing XML Streams with Deterministic Automata

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Efficient Filtering of XML Documents for Selective Dissemination of Information

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Efficient filtering of XML documents with XPath expressions

The VLDB Journal — The International Journal on Very Large Data Bases
Stream processing of XPath queries with predicates

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XPath queries on streaming data

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
On the expressive power of semijoin queries

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)

Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
On the Streaming Model Augmented with a Sorting Primitive

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the memory requirements of XPath evaluation over XML streams

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of division and set joins in the relational algebra

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Buffering in query evaluation over XML streams

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Lower bounds for sorting with few random accesses to external memory

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Semijoin Algebra and the Guarded Fragment

Journal of Logic, Language and Information
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Algorithms for acyclic database schemes

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Query languages and data models for database sequences and data streams

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
On multi-head finite automata

FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Tight lower bounds for query processing on streaming and external memory data

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Machine models and lower bounds for query processing

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A theory of stream queries

DBPL'07 Proceedings of the 11th international conference on Database programming languages
Database theory, Yuri, and me

Fields of logic and computation

Quantified Score

Hi-index	0.00

Visualization

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 results are upper and lower bounds for processing relational algebra queries in this model, specifically, queries of the semijoin fragment of the relational algebra.