Keyword Search on Hyper Graph Data Bases

Authors

  • D. Pavani  M.Tech Scholar, Computer Science and Engineering, JNTUA College of Engineering, Ananthapuramu, Andhra Pradesh, India

Keywords:

Temporal Graphs, Hyper Graphs, Keyword Search.

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.

References

  1. Ziyang Liu, Chong Wang, and Yi Chen. Keyword Search on Temporal Graph 2016
  2. B. Ding, J. X. Yu, S. Wang, L. Qin, X. Zhang, and X. Lin. Finding Top-k Min-Cost Connected Trees in Databases. In ICDE, pages 836–845, 2007.
  3. F. Rizzolo and A. A. Vaisman. Temporal XML: Modeling, Indexing, and Query Processing. VLDB J., 17(5):1179–1212, 2008.
  4. R. Bin-Thalab and N. El-Tazi. TOIX: Temporal Object Indexing for XML Documents. In DEXA, pages 235–249, 2015.
  5. R. Bin-Thalab, N. El-Tazi, and M. E. El-Sharkawi. TMIX: Temporal ModelforIndexingXMLDocuments. InAICCSA,pages1–8,2013.
  6. B. Ding, J. X. Yu, and L. Qin. Finding Time-Dependent Shortest Paths over Large Graphs. In EDBT, pages 205–216, 2008.
  7. H. He, H. Wang, J. Yang, and P. S. Yu. BLINKS: Ranked Keyword Searches on Graphs. In SIGMOD Conference, pages 305–316, 2007.
  8. Y. Luo, X. Lin, W. Wang, and X. Zhou. SPARK: Top-k Keyword Query in Relational Databases. In SIGMODConference, pages 115– 126, 2007.

Downloads

Published

2018-07-30

Issue

Section

Research Articles

How to Cite

[1]
D. Pavani, " Keyword Search on Hyper Graph Data Bases, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 6, pp.247-251, July-August-2018.