QUERY PROCESSING AND ACCESS PATH SELECTION IN THE RELATIONAL MAIN

In this paper, we describe heuristic rules for choosing an appropriate access path for a given query in main memory databases using a functional memory system. We have asserted that conventional cache-based memory access is not suitable for query processing in main memory databases. To cope with this problem, we have proposed three hardware-supported memory access schemes. If we select an appropriate memory access scheme from the three proposed schemes and the cache-based access, the execution time of query processing can be reduced. In this paper, we derive heuristic rules on which access path should be selected and show its impact on execution time through experimentation