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

Keyword Search on Hyper Graph Data Bases

Author

Listed:
  • D. Pavani

Abstract

Archiving graph data is necessary in many applications. This graph data is handled with graph databases. They also consist of temporal graph. The temporal graph consists of temporal data. Temporal data refers to data, where it changes over time. Querying on temporal graphs the existing approaches are insufficient as they consume more time. This paper supports keyword search on temporal graphs efficiently by using hyper graphs. The main advantage of Hyper Graphs over Temporal graphs is keyword evolution time can be reduced drastically.

Suggested Citation

  • D. Pavani, 2018. "Keyword Search on Hyper Graph Data Bases," 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. 3(6), pages 247-251, July.
    • Handle: RePEc:jbh:ijsrcs:v3:y2018:i6:id:hcseit183645
    Note: Article URL: https://ijsrcseit.com/CSEIT183645
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT183645
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrcseit.com/paper/CSEIT183645.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:v3:y2018:i6:id:hcseit183645. 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.