Problem of optimizing the number of block accesses in performing relational join is NP-hard

DOI10.1016/0020-0190(91)90070-XzbMath0731.68018OpenAlexW2082199511MaRDI QIDQ808230

Sakti Pramanik, Farshad Fotouhi

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90070-x

zbMATH Keywords

NP-complete problemsdatabase accessrelational join

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Optimizing the cost of relational queries using partial-relation schemes
• Use of graph-theoretic models for optimal relational database accesses to perform join
• Unnamed Item

This page was built for publication: Problem of optimizing the number of block accesses in performing relational join is NP-hard