This paper introduces 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. The 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.
Did you find this white paper useful?
27 out of 50 users found this white paper useful
Related white papers
SQL Server 2005 Administration
Learn to administer and tune SQL Databases and Servers. Description: Get the knowledge and skills you need to maintain a Microsoft SQL Server 2005 database in this 5-day course. Learn how to...
Microsoft Exchange Server 2007
Learn about Exchange 2007 and how to leverage its features. Description: Exchange Server 2007 is the latest version of Microsoft's premier messaging application. In this hands-on course, you'll learn to install and...
Powerful Data Warehousing Performance With IBM Red Brick Warehouse
A data warehouse typically provides business intelligence value through an Relational DataBase Management System (RDBMS) optimized for OnLine Analytical Processing (OLAP), which deals with extracting and viewing data from different...
Bloom Histogram: Path Selectivity Estimation for XML Data With Updates
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from such estimations. While there are a...
Creating Multilingual Data for WebSphere Commerce Suite Via WebSphere Catalog Manager
This paper first states that why it needs multilingual business and two types of multilingual business, and give a high level view about the capabilities of WebSphere Catalog Manager(WCM) and...
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating structural relationship, specifically parent-child or ancestor-descendant...
Energy-Efficient Data Multicast in Multi-Hop Wireless Networks
Multi-Hop Wireless Networks (MHWNs) are an emerging paradigm for bandwidth and energy-efficient wireless systems where each terminal communicates only with a few closely positioned neighbor nodes using low power communication...
