Optimizing the cost of relational queries using partial-relation schemes

DOI10.1016/0306-4379(88)90028-2zbMath0654.68110OpenAlexW2055999895MaRDI QIDQ1108822

Sakti Pramanik, Farshad Fotouhi

Publication date: 1988

Published in: Information Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0306-4379(88)90028-2

zbMATH Keywords

query optimizationhybrid hashjoin algorithmspartial relationsrelational queriessemijoin

Mathematics Subject Classification ID

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

Related Items (1)

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

This page was built for publication: Optimizing the cost of relational queries using partial-relation schemes