Search operation methods in the relational database machine RINDA

Abstract

SUMMARYNonindexed queries in a relational database are performed by searching operations, i.e., read out all rows in a table from disks and repetitive condition judgment for each row. Therefore, it takes a long response time on software-only systems.This paper discusses a searching architecture implemented in a RINDA system which is an attached processor of relational database management systems (DBMS). Performance evaluation indicates that RINDA enhances the response of nonindexed queries by as much as 100 times compared to software-only systems.The proposed main features are as follows:(1) The effective functions to achieve a short response time are selected and then implemented as a CSP hardware; (2) for a cooperative process with both CSP and software, the internal format of searching conditions is translated in conjunctive canonical form; (3) by executing NOT operator in a logical equation directly in predicates, the SQL three-value logic degenerates into two-value; and (4) by using multiple CSPs, parallel search processing is performed.