TY  - JOUR
TI  - Keyword Search on Hyper Graph Data Bases
AU  - D. Pavani
JO  - International Journal of Scientific Research in Computer Science, Engineering and Information Technology
PB  - Technoscience Academy
DA  - 2018/07/30
PY  - 2018
DO  - https://doi.org/10.32628/IJSRCSEIT
UR  - https://ijsrcseit.com/CSEIT183645
VL  - 3
IS  - 6
SP  - 247	
EP  - 251
AB  - 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.