Estimating list sizes in partial joins

MaRDI QIDQ1842428zbMATH OpenFDO

Authors S. V. Zykin

Publication date 17 May 1995

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

natural join operationrelational data model

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Database theory (68P15) Information storage and retrieval of data (68P20)

Review text

The paper is an extension of the investigation of a mapping of a relational data model to a list model, especially a partial join is considered. In this mapping for a realisation of the relation \(R\) there exists a list realisation --- a list \(s\). Between the join operator and the projection operator on the list \(s\) is the relationship: the result of the natural join operation can be obtained by taking the projection on the list \(s\). To build up the above mentioned mapping the size of the list \(s\) is important. In the paper a simple expression for a static estimate of the list size has been found. A discussion about the advantage/disadvantage of list representation of data and join indices is added. The paper is a contribution to the long execution time problem of the natural join operation.

Recommendations

• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Random Sampling and Size Estimation Over Cyclic Joins.
• Size bounds and query plans for relational joins
• DFT techniques for size estimation of database join operations
• Selectivity and cost estimation for joins based on random sampling
• Tracking join and self-join sizes in limited storage
• Some estimations in database queries
• Query size estimation by adaptive sampling

Cited in

(1)

• Formation of hypercube representation of relational database

This page was built for publication: Estimating list sizes in partial joins

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1842428)