Open Access
Introduction to Query Processing and Optimization
S. S. Agrawal
- 01 Jan 2013
27
TL;DR: This paper will introduce the basic concepts of query processing and query optimization in the relational database, and describe and difference query processing techniques in relational databases.
read more
Abstract: Query Processing is the scientific art of obtaining the desired information from a database system in a predictable and reliable fashion. Database systems must be able to respond to requests for information from the user i.e. process queries. In large database systems, which may be running on un-predictable and volatile environments, it is difficult to produce efficient database query plans based on information available solely at compile time. Getting the database results in a timely manner deals with the technique of Query Optimization. Efficient processing of queries is an important requirement in many interactive environments that involve massive amounts of data. Efficient query processing in domains such as the Web, multimedia search, and distributed systems has shown a great impact on performance. This paper will introduce the basic concepts of query processing and query optimization in the relational database. We also describe and difference query processing techniques in relational databases.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Database Performance Tuning and Query Optimization
Sadhana J. Kamatkar,Ajit Kamble,Amelec Viloria,Lissette Hernández-Fernández,Ernesto García Cali +4 more
- 17 Jun 2018
TL;DR: This paper is focusing on query tuning tips & tricks which can be applied to gain immediate performance gain by creating Query Execution Flow Chart and demonstrates the application of this technique in an Employee Biometric Attendance Management System.
A formal framework for query decomposition and knowledge integration in data warehouse federations
TL;DR: This paper presents a formal framework for data and knowledge processing in data warehouse federations, and proposes a model for query decomposition process and knowledge integration.
12
Query Optimization using Modified Ant Colony Algorithm
Ajay Wagh,Varsha Nemade +1 more
TL;DR: This paper modifications Ant Colony Algorithm for query optimization and shows the comparison execution time between Heuristic based optimization, Ant Colony Optimization and Modified Ant Colony optimization algorithms.
An Efficient Approach of Block Nested Loop Algorithm based on Rate of Block Transfer
TL;DR: An approach has been proposed that makes the processing of join operation in database systems more efficient and join query processing become efficient, without loosing the level of complexity of the previous algorithms of block nested loop join (BNLJ).
Comparing Oracle and PostgreSQL, Performance and Optimization
Pedro Martins,Paulo Tomé,Cristina Wanzeller,Filipe Sá,Maryam Abbasi +4 more
- 30 Mar 2021
TL;DR: In this article, the authors evaluate and compare the performance of Oracle and PostgreSQL database systems with the TPC-H benchmark, following a strategy of adding column-based indexes to optimize query execution.
6
References
•Book
Fundamentals of Database Systems, 5th Edition
Ramez Elmasri,Shamkant B. Navathe +1 more
- 17 Mar 2006
558
Expressing and optimizing sequence queries in database systems
TL;DR: This paper takes the optimal text search algorithm of Knuth, Morris and Pratt, and generalize it to handle complex queries on sequences, and exploits the interdependencies between the elements of a pattern to minimize repeated passes over the same data.
XPath query containment
Thomas Schwentick
- 01 Mar 2004
TL;DR: The main idea of this article is to describe some of the main algorithmic techniques that have been proposed for XPath Query Containment, to decrease online computation time in an XML publish-subscribe scenario with hundreds of subscribers and tens of thousands of XML documents to be delivered per day.
143
Reasoning on regular path queries
Diego Calvanese,G. De Giacomo,Maurizio Lenzerini,Moshe Y. Vardi +3 more
- 01 Dec 2003
TL;DR: It is demonstrated that the basic services for reasoning about two way regular path queries are decidable, thus showing that the limited form of recursion expressible by these queries does not endanger the decidability of reasoning.
Advancements in SQL/XML
Andrew Eisenberg,Jim Melton +1 more
- 01 Sep 2004
TL;DR: Since the authors last wrote about SQL/XML in [2], the first edition of that new part of the SQL standard has been officially published as an international standard, commonly called SQL/ XML:2003.
65