DMCA
Efficient Query Optimization in Distributed Database Using Decision Tree Algorithm
BibTeX
@MISC{Singh_efficientquery,
author = {Dr Kamaljit Singh and Dheerendra Singh},
title = {Efficient Query Optimization in Distributed Database Using Decision Tree Algorithm},
year = {}
}
OpenURL
Abstract
ABSTRACT This paper presents semantics query optimization on distributed database using Decision Tree algorithm based on that. Whenever user query from server the master sever can process the query of user from different server's database in Heterogeneous environment on alternative basis which will reduce the time of processing query and less time of response time of user. we will use all query hints based on that whenever user query anything from server our master sever will make SQL query hints to generate more than query using specified rules like query of 2 or more tables query of 1 tables and get required data from database and revert back to user screen in 1. INTRODUCTION Data mining, the extraction of hidden predictive information from large databases, is a powerful new technology with great potential to help companies focus on the most important information in their data warehouses. Data mining tools predict future trends and behaviors, allowing businesses to make proactive, knowledge-driven decisions. The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by retrospective tools typical of decision support systems. Data mining tools can answer business questions that traditionally were too time consuming to resolve. They scour databases for hidden patterns, finding predictive information that experts may miss because it lies outside their expectations. Most companies already collect and refine massive quantities of data. Data mining techniques can be implemented rapidly on existing software and hardware platforms to enhance the value of existing information resources, and can be integrated with new products and systems as they are brought on-line. When implemented on high performance client/server or parallel processing computers, data mining tools can analyze massive databases to deliver answers to questions such as, "Which clients are most likely to respond to my next promotional mailing, and why?" This white paper provides an introduction to the basic technologies of data mining. Examples of profitable applications illustrate its relevance to today's business environment as well as a basic description of how data warehouse architectures can evolve to deliver the value of data mining to end users. QUERY OPTIMIZATION It is a function of many relational database management systems. The query optimizer attempts to determine the most efficient way to execute a given query by considering the possible query plans. Generally, the query optimizer cannot be accessed directly by users: once queries are submitted to database server, and parsed by the parser, they are then passed to the query optimizer where optimization occurs. However, some database engines allow guiding the query optimizer with hints. A query is a request for information from a database. It can be as simple as "finding the address of a person with SS# 123-45-6789," or more complex like "finding the average salary of all the employed married men in California between the ages 30 to 39, that earn less than their wives." Queries results are generated by accessing relevant database data and manipulating it in a way that yields the requested information. Since database structures are complex, in most cases, and especially for not-very-simple queries, the needed data for a query can be collected from a database by accessing it in different ways, through different data-structures, and in different orders. Each different way typically requires different processing time. Processing times of the same query may have large variance, from a fraction of a second to hours, depending on the way selected. The purpose of query optimization, which is an automated process, is to find the way to process a given query in minimum time. The large possible variance in time justifies performing query optimization, though finding the exact optimal way to execute a query, among all possibilities, is typically very complex, time consuming by itself, may be too costly, and often practically impossible. Thus query optimization typically tries to approximate the optimum by comparing several common-sense alternatives to provide in a reasonable time a "good enough" plan which typically does not deviate much from the best possible result. METHODOLOGY In this whole Research work concept we will use Network programming Tcp/ip Sockets to show interaction of master sever with another sever who process query also the communication of Client Machine to Master Master. We will use Multithreading concept of java based on that we will implement master server that can listen the query of more than user simultaneously each Thread can handle query of each user We will use mysql database on each server having window operating system for Homogenous environment.