OPTIMIZATION OF PARALLEL QUERY EXECUTION PLANS IN Xprs USING PATTERN MATCHING ALGORITHM

Why publish with

ijaser

IJASER publishes high-quality, original research papers, brief reports, and critical reviews in all theoretical, technological, and interdisciplinary studies that make up the fields of advanced science and engineering and its applications.

OPTIMIZATION OF PARALLEL QUERY EXECUTION PLANS IN Xprs USING PATTERN MATCHING ALGORITHM

Abstract

Manipulation of Queries on a large amount of data is done with various technologies. Query handling of Big data is a challenging task because of unstructured, real-time data. Efficient Query execution technique usage partition algorithm & pattern match algorithm for handling queries of the user. These techniques provide faster execution of such queries on the Big data in an efficient manner. Various authors propose query execution using DAG, ranges, unification & other methods. Range-aggregate queries are giving better performance with balance partition algorithm and map-reduce technique for handling large amount of queries with pattern matching technique.

Author

A.Ahamed Haris

Download

International Journal of Advanced
Science and Engineering Research

For Queries/Clarification

Why publish with

Author's Desk

Downloads