The optimum execution order of queries in linear storage

DOI10.1016/0020-0190(90)90083-AzbMath0704.68032OpenAlexW2011919427MaRDI QIDQ917278

Yannis Manolopoulos, Christos H. Papadimitriou, John G. Kollias

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90083-a

zbMATH Keywords

databasesbatched disk queries

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Related Items (2)

The traveling salesman problem with flexible coloring ⋮ Estimating disk head movement in batched searching

Cites Work

• Unnamed Item
• Ordering conjunctive queries
• Optimising disc head movements in secondary key retrievals
• Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage
• An Estimate of Seek Time for Batched Searching of Random or Index Sequential Structured Files
• Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems
• Equivalences among Relational Expressions
• An Optimal Drum Scheduling Algorithm

This page was built for publication: The optimum execution order of queries in linear storage