Online Market For Buying And Selling Different Products
Author(s):
P.BalaChandra, T.Spandana
Keywords:
Temporal graph, versioned graph, keyword search
Abstract
Archiving graph information over history is demanded in several applications, like social network studies, cooperative comes, scientific graph databases, and bibliographies. usually individuals have an interest in querying temporal graphs. Existing keyword search approaches for graph-structured data are deficient for querying temporal graphs. This paper initiates the study of supporting keyword-based queries on temporal graphs. we tend to propose a hunt syntax that's a moderate extension of keyword search, that permits casual users to simply search temporal graphs with nonobligatory predicates and ranking functions associated with timestamps. to come up with results expeditiously, we tend to initial propose a best path iterator, that finds the ways between 2 knowledge nodes in every photograph that's the “best” with regard to 3 ranking factors. It prunes invalid or inferior ways and maximizes shared process among totally different snapshots. Then we tend to develop algorithms that expeditiously generate top-k query results. in depth experiments verified the potency and effectiveness of our approach.
Article Details
Unique Paper ID: 145720

Publication Volume & Issue: Volume 4, Issue 11

Page(s): 47 - 50
Article Preview & Download


Share This Article

Join our RMS

Conference Alert

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

Call For Paper

Volume 10 Issue 10

Last Date for paper submitting for March Issue is 25 June 2024

About Us

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Social Media

Google Verified Reviews