Database query processing using finite cursor machines

DOI10.1007/s00224-008-9137-7zbMath1192.68213OpenAlexW3021974799MaRDI QIDQ2272221

Martin Grohe, Dirk Leinders, Jan Van den Bussche, Yuri Gurevich, Nicole Schweikardt, Jerzy Tyszkiewicz

Publication date: 6 August 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/7847

zbMATH Keywords

databaserelational algebraquery processingsemijoin

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (3)

Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ Database Theory, Yuri, and Me ⋮ Database query processing using finite cursor machines

Uses Software

• XPath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• On the memory requirements of XPath evaluation over XML streams
• On the complexity of division and set joins in the relational algebra
• The space complexity of approximating the frequency moments
• Efficient filtering of XML documents with XPath expressions
• Database query processing using finite cursor machines
• On the expressive power of semijoin queries
• The semijoin algebra and the guarded fragment
• Degrees of acyclicity for hypergraphs and relational database schemes
• Evolving Algebras 1993: Lipari Guide
• Logics with aggregate operators
• Automata, Languages and Programming
• Sequential abstract-state machines capture sequential algorithms

This page was built for publication: Database query processing using finite cursor machines