CONTEXT INDEXING IN SEARCH ENGINE USING BINARY SEARCH TREE

Journal Title: International Journal on Computer Science and Engineering - Year 2013, Vol 5, Issue 6

Abstract

Indexing in search engines is an active area of current researches and the aim of search engines is to provide the most relevant documents to the users in least possible time. In this paper a context based indexing is proposed where the index list stores the available context along with the keywords. Thus the information will be more relevant as the context of the topic is also made available to the retrieval system. For indexing the keyword extracted from the web documents along with their contexts are stored in Binary Search Tree (BST), to enhance the performance of the search engine.

Authors and Affiliations

Charu Kathuria , Goutam Datta , Vanditaa Kaul

Keywords

Related Articles

Classification of Different Species Families using Clustering lgorithm

The division of similar objects into groups is known as Clustering. The main objective of this implementation is classification of DNA sequences related to different species and their families using Clustering Algorithm...

An Efficient Method for Digital Image Watermarking Based on PN Sequences

In the recent times, the rapid and extensive growth in Internet technology is creating a pressing need to develop several newer techniques to protect copyright, ownership, authentication and content integrity of digital...

Cloud Computing: A solution to Geographical Information Systems (GIS) Cloud Computing and GIS

Geographical Information Systems or Geospatial Information Systems (GIS) is a collection of tools that captures, stores, analyzes, manages, and presents data that are linked to geographical locations. GIS plays an essent...

A STUDY OF CLONE DETECTING TECHNIQUES IN STATIONARY AND MOBILE WIRELESS SENSOR NETWORK

Mobile Wireless sensor network (MWSN) is one of the recently emerging areas in which mobility of sensor nodes play a major role. Sensor nodes are allowed to move freely and are allowed to communicate with each other with...

Impulse Noise removal in Digital Images

In this paper, we introduce a new class of filter, the modified spatial median filter (MSMF) for the removal of impulse noise in digital images. The proposed filter is compared with four different filtering algorithms ba...

Download PDF file
  • EP ID EP98622
  • DOI -
  • Views 118
  • Downloads 0

How To Cite

Charu Kathuria, Goutam Datta, Vanditaa Kaul (2013). CONTEXT INDEXING IN SEARCH ENGINE USING BINARY SEARCH TREE. International Journal on Computer Science and Engineering, 5(6), 514-521. https://europub.co.uk/articles/-A-98622