Design of SMACA: synthesis and its analysis through rule vector graph for web based application
by Anirban Kundu, Ruma Dutta, Debajyoti Mukhopadhyay
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 2, No. 4, 2008

Abstract: Web search engine uses indexing for management of web-pages in a mannered way. Web-pages are well distributed within the database of server. Both forward and inverted indexing is employed to tackle web-pages as a part of its functional design. This indexing mechanism helps in retrieving data from the database based on user query. In this paper, an efficient solution to handle the indexing problem is proposed with the introduction of non-linear single cycle multiple attractor cellular automata (SMACA). This paper also reports an analysis on SMACA using rule vector graph (RVG). This work simultaneously shows generation of SMACA by using specific rule sequence. Searching mechanism is done with O(n) complexity. SMACA provides an implicit memory to store the patterns. Search operation to identify the class of a pattern out of several classes boils down to running a cellular automata (CA) for one time step. This demands storage of the CA rule vector (RV) and the seed values. SMACA is based on sound theoretical foundation of CA technology.

Online publication date: Thu, 27-Nov-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com