By Topic

Cellular automata based architecture of a database query processor

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chattopadhyay, S. ; Dept. of Comput. Sci. & Tech., Bengal Eng. Coll., Howrah, India ; Mitra, S. ; Pal Chaudhuri, P.

In large databases the objects form certain classes and all objects in a class possesses common attributes. The relational database for a such a set of classified objects requires a class-relation-identifying the class corresponding to each object, and an attribute-relation containing the attributes for each class. For efficient processing of the queries, multi-level indexing scheme is employed requiring large memory to store the index files. The access to the index files adds to the time overhead of query processing. In this paper, a Multiple Attractor Cellular Automata (MACA) based chip has been reported that stores the class-relation in an implicit manner, eliminating multi-level indexing altogether

Published in:

VLSI Design, 1996. Proceedings., Ninth International Conference on

Date of Conference:

3-6 Jan 1996