This paper is based on relatively newer approach for query optimization in object databases,which uses query decomposition and cached query results to improve execution a query. Issuesthat are focused here is fast retrieval and high reuse of cached queries, Decompose Query intoSub query, Decomposition of complex queries into smaller for fast retrieval of result.Here we try to address another open area of query caching like handling wider queries. Byusing some parts of cached results helpful for answering other queries (wider Queries) andcombining many cached queries while producing the result.Multiple experiments were performed to prove the productivity of this newer way of optimizinga query. The limitation of this technique is that it’s useful especially in scenarios where datamanipulation rate is very low as compared to data retrieval rate.
展开▼
