Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/545827
Title: Privacy preserving mining from outsourced graph database with authenticated subgraph query services
Researcher: Sharmila G
Guide(s): Kavitha Devi M K
Keywords: Aids Antiviral
Graph Data
Subgraph Mining
University: Anna University
Completed Date: 2024
Abstract: Graph data structure has been used widely in several fields, including newlinecheminformatics, bioinformatics, communication networks, social networks, newlineweb analysis and to describe complex objects. In recent decades, because of the newlineexplosive growth of graph databases, the contribution of subgraph mining in the newlinefield of Graph mining has caught the attention of many researchers owing to its newlinewide range of applications. In large scale dynamic graph databases, mining newlinesubgraphs patterns is challenging because graph operations, such as subgraph newlineisomorphism testing are often more complex in time, memory and cost than the newlinecorresponding operations on sets, sequences, or trees. Graph indexing and newlinemining algorithms had been proposed so far are vastly different in terms of newlinecomputation time and memory requirement. These algorithms compromised newlinescalability and execution time while attempting to exploit large scale graph newlinedatabases. In current distributed environment, very few research works have newlineconcentrated on secure subgraph mining and faced lot of issues in reducing newlineauthentication time. A useful technique with scalability, security and QoS is still newlinerequired for subgraph mining. newlineThe proposed work is focussed to solve the existing issues in graph newlineindexing, subgraph searching, authentication of query service and scalability of newlinegraph data. A system model for subgraph mining with authentication of query newlineservices in graph database is proposed in three different modules for three newlinedifferent applications. In the first module, an efficient authentication friendly newlinestatic graph index called GSimIndex is constructed to support authenticated newlinesearch for similarity subgraph queries based on Distance-based indexing. This newlinework is tested for AIDS Antiviral screening dataset and compared with existing newlinegraph indexing techniques that supports similarity search like DISR index, newlineGMTree and ML-Index. newline
Pagination: xvii,162p.
URI: http://hdl.handle.net/10603/545827
Appears in Departments:Faculty of Information and Communication Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File196 kBAdobe PDFView/Open
02_prelim pages.pdf2.26 MBAdobe PDFView/Open
03_contents.pdf63.51 kBAdobe PDFView/Open
04_abstracts.pdf10.6 kBAdobe PDFView/Open
05_chapter1.pdf1.62 MBAdobe PDFView/Open
06_chapter2.pdf685.35 kBAdobe PDFView/Open
07_chapter3.pdf1.13 MBAdobe PDFView/Open
08_chapter4.pdf2.07 MBAdobe PDFView/Open
09_chapter5.pdf1.38 MBAdobe PDFView/Open
10_annexures.pdf142.46 kBAdobe PDFView/Open
80_recommendation.pdf161.5 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: