Abstract
Query processing in databases can be divided into two steps: selecting an ‘optimal’ evaluation strategy, and executing it. We first present elementary nested loop and relational algebra algorithms for query execution and point out some opportunities for improving their performance. A survey of optimization strategies, structured in query transformation techniques and access planning methods, follows. Finally, extensions for special-purpose query systems are briefly addressed.KeywordsQuery ProcessingIntegrity ConstraintRelational AlgebraNest LoopQuery OptimizationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
