Optimal implementation of selectors in a data-base

DOI10.1016/0377-2217(82)90111-4zbMath0488.68060OpenAlexW2092111419MaRDI QIDQ1166277

Alain Billionnet

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90111-4

zbMATH Keywords

Steiner problembranch and bound algorithmhierarchical indexoptimal index structuresearch of an optimal rooted tree among the partial subgraphs of a given graph

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Une nouvelle méthode pour le problème de partitionnement fondée sur une évaluation par excès de la solution
• Cost-minimal trees in directed acyclic graphs

This page was built for publication: Optimal implementation of selectors in a data-base