A Review of Heuristics for Optimal Page Access Sequence with a Model for Spatial Queries
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 7
Abstract
Spatial Database Systems are very large databases requiring storage in disk devices. The join process between two relations that is based on spatial nature of the attributes needs repeated and redundant disk accesses. This necessitates the implementation of join index which accelerates the join processing between two relations and it incurs high over head. This work studies the heuristics that are being in use for join processing from the context of optimal page access of disk I/O and that of spatial join processing with join index. The study presents a summary of heuristics that are implemented for join processing of spatial relations. Spatial-Queries modeled with spatial statistical measures provide an indication of spatial clusters. This model with an appropriate clustering algorithm identifies clusters that would require page re-accesses. An Optimal Page Access Sequence can reduce the page re-accesses and thus bring down the I/O cost of the join process. The work evaluates the performance of the statistical measure Moran’s I to model spatial queries and identified to have a better performance than the existing measure Ripley’s K function.
Authors and Affiliations
Dr. Chandra. E , Anuradha. V. P
FACE RECOGNITION FROM LOWER JAW OR MANDIBLE OF A HUMAN
Identify a human by his face is a very easy job for a human but it is most difficult job for a machine. These papers presenting some approaches for recognize a human face from skull. Then a totally new conception is intr...
Molecular Database Generation for Type 2 Diabetes using Computational Science-Bioinformatics' Tools
In this paper a new algorithm GIGC is proposed which is the modified form of glucose insulin meal GIM model. Diabetes mellitus is one of the worst diseases that are affecting adversely large population. This motivates ma...
PALM: Preprocessed Apriori For Logical Matching Using Map Reduce Algorithm
With the recent explosive growth of the amount of data content and information on the Internet, it has become increasingly difficult for users to find and maximize the utilization of the information found in the internet...
Invariant Moments based War Scene Classification using ANN and SVM: A Comparative Study
In this paper we are trying to classify a war scene from the natural scene. For this purpose two set of image categories are taken viz., opencountry & war tank. By using Invariant Moments features are extracted from...
PDPKDES ( Pre Distributed Powerful Key for Data Encryption Standard)
Data encryption standard in spite of being a great algorithm in terms of a good combination of confusion and diffusion steps, doesn’t largely used because of a weak key concept. The key used in DES is only 64 bits (or 56...