Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{145720,
        author = {P.BalaChandra and T.Spandana},
        title = {Online Market For Buying And Selling Different Products},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {11},
        pages = {47-50},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=145720},
        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.},
        keywords = {Temporal graph, versioned graph, keyword search},
        month = {},
        }