An upper bound on the number of execution nodes for a distributed join

DOI10.1016/0020-0190(81)90076-4MaRDI QIDQ1149802zbMATH OpenOpenAlexFDO

Authors G. Pelagatti, Stefano Ceri

Publication date 1981

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(81)90076-4

zbMATH Keywords

distributed database

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Theory of operating systems (68N25)

Cites work

• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—Location Theory: A Selective Bibliography

Cited in

(1)

• Data analysis using a geometrical representation of predicate calculus

This page was built for publication: An upper bound on the number of execution nodes for a distributed join

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