VFG – INDEX: A NOVEL GRAPH INDEXING METHOD | Zendy

A. Pankaj Moses Monickaraj | Zendy; K. Vivekanandan | Zendy; D. RAMYA CHITHRA | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

VFG – INDEX: A NOVEL GRAPH INDEXING METHOD

Author(s) -

A. Pankaj Moses Monickaraj,

K. Vivekanandan,

D. RAMYA CHITHRA

Publication year - 2014

Publication title -

international journal of computer science and informatics

Language(s) - English

Resource type - Journals

ISSN - 2231-5292

DOI - 10.47893/ijcsi.2014.1185

Subject(s) - search engine indexing , computer science , schema (genetic algorithms) , xml , graph , data mining , theoretical computer science , graph database , information retrieval , world wide web

The latest advancements in science and technology have observed large quantity of complicated structures and schema less data such as proteins, circuits, images, Web, and XML documents which can be modeled into various types of which one of the most dominant now a days are graphs. This has caused Graph Mining, one of the budding areas of research happening throughout. In this paper, we investigate the various algorithms for Graph Indexing which makes use of Frequent Sub graph as a key term for indexing, of which one the most dominant is FG-index algorithm. This algorithm is tested with AIDS dataset and an improved algorithm is proposed for effective indexing. KeywordsGraph, Graph Mining, Graph Indexing, Frequent Sub Graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research