IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v2y2017i4idhcseit172487.html

Realistic and Efficient Selection Scheme for Huge Scale De-Duplication

Author

Listed:
  • Megha Rani Raigond
  • Vijaylaxmi

Abstract

The data de-duplication work has attracted a substantial quantity amount of observation from the analysis community to provide effectual and economical solutions. Duplicate data means same data stored in database. The data given by an operator to tune the de-duplication methods generally indicated by a collection of manually labelled pair. The domain is ns2.In the existing system we are sending the packets from source to destination while sending the packets it does not check the all nodes and here we are not giving the node id for each node. So duplicate packets will send to destination. In addition, in this While sending the packets from source to destination, we have to give the node id to each node for security purpose. The algorithm will check all the nodes such as which node does not contain duplicate packets. Finally, Algorithm will find the shortest path to send de-duplicate packets from source to destination. In this we conclude, de-duplicate packets will reaches to destination by using the shortest path.

Suggested Citation

  • Megha Rani Raigond & Vijaylaxmi, 2017. "Realistic and Efficient Selection Scheme for Huge Scale De-Duplication," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 2(4), pages 340-343, August.
    • Handle: RePEc:jbh:ijsrcs:v2:y2017:i4:id:hcseit172487
    Note: Article URL: https://ijsrcseit.com/CSEIT172487
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT172487
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrcseit.com/paper/CSEIT172487.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;

    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:jbh:ijsrcs:v2:y2017:i4:id:hcseit172487. 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: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    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.