IDEAS home Printed from https://ideas.repec.org/a/igg/jirr00/v7y2017i2p19-33.html
   My bibliography  Save this article

Design of a Least Cost (LC) Vertical Search Engine based on Domain Specific Hidden Web Crawler

Author

Listed:
  • Sudhakar Ranjan

    (Department of Computer Science Engineering, Apeejay Stya University, Gurgaon, India)

  • Komal Kumar Bhatia

    (Department of Computer Engineering, YMCA University of Science & Technology, Faridabad, India)

Abstract

Now days with the advent of internet technologies and ecommerce the need for smart search engine for human life is rising. The traditional search engines are not intelligent as well as smart and thus lead to the rise in searching costs. In this paper, architecture of a vertical search engine based on the domain specific hidden web crawler is proposed. To make a least cost vertical search engine improvement in the following techniques like: searching, indexing, ranking, transaction and query interface are suggested. The domain term analyzer filters the useless information to the maximum extent and finally provides the users with high precision information. Through the experimental result it is shown that the system works on accelerating the access, computation, storage, communication time, increased efficiency and work professionally.

Suggested Citation

  • Sudhakar Ranjan & Komal Kumar Bhatia, 2017. "Design of a Least Cost (LC) Vertical Search Engine based on Domain Specific Hidden Web Crawler," International Journal of Information Retrieval Research (IJIRR), IGI Global, vol. 7(2), pages 19-33, April.
  • Handle: RePEc:igg:jirr00:v:7:y:2017:i:2:p:19-33
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJIRR.2017040102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jirr00:v:7:y:2017:i:2:p:19-33. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.