loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
9th International Conference on VLSI Design: VLSI in Mobile Communication
Bangalore, INDIA
January 03-January 06
ISBN: 0-8186-7228-5
S. Chattopadhyay, Dept. of Comput. Sci. & Tech., Bengal Eng. Coll., Howrah, India
S. Mitra, Dept. of Comput. Sci. & Tech., Bengal Eng. Coll., Howrah, India
P. Pal Chaudhuri, Dept. of Comput. Sci. & Tech., Bengal Eng. Coll., Howrah, India
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.
Index Terms:
query processing; cellular automata; VLSI; relational databases; microprocessor chips; classification; database machines; cellular automata based architecture; database query processor; programmable query processor chip; fast database access; relational database; multiple attractor cellular automata; class-relation storage; true/false classifier
Citation:
S. Chattopadhyay, S. Mitra, P. Pal Chaudhuri, "Cellular automata based architecture of a database query processor," vlsid, pp.320, 9th International Conference on VLSI Design: VLSI in Mobile Communication, 1996
Usage of this product signifies your acceptance of the Terms of Use.