Join strategies using data space partitioning

DOI10.1007/BF03037503MaRDI QIDQ1104138zbMATH OpenOpenAlexFDO

Authors Esen A. Ozkarahan, Cem H. Bozsahin

Publication date 1988

Published in New Generation Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03037503

zbMATH Keywords

data space partitioningdatabase machinesdynamic and order preserving multidimensional data organizationpartitioned-joinperformance simulationrelational algebrarelational databases

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• scientific article; zbMATH DE number 1945887
• A distributed join algorithm
• Optimizing the cost of relational queries using partial-relation schemes
• On the optimality of strategies for multiple join
• Distributive join strategy based on tuple inversion

Cites work

• Interpolation-based index maintenance

Cited in

(2)

• Join decomposition based on fragmented column indices
• Distributive join strategy based on tuple inversion

This page was built for publication: Join strategies using data space partitioning

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