Online Subgraph Skyline Analysis Over

Knowledge Graphs
A Project report submitted In fulfilment of the requirements for the Award of
the Degree of

MASTER OF COMPUTER APPLICATION

Submitted By
ANUMULA. VENKATA REDDY
Reg No: 14AH1F0002

Under the Esteemed Guidance of

U. BABU, M.C.A
Assoc. Professor

DEPARTMENT OF COMPUTER APPLICATION

AMARA INSTITUTE OF ENGINEERING AND TECHNOLOGY
(Approved by AICTE-New Delhi & Affiliated to JNTU Kakinada)
Satulur-522549, Narasaraopet, Guntur District
2016-2017
 AMARA INSTITUTE OF ENGINEERING AND TECHNOLOGY
(Approved by AICTE-New Delhi & Affiliated to JNTU Kakinada)
Satulur-522549, Narasaraopet, Guntur District

DEPARTMENT OF MASTER OF COMPUTER APPLICATION

CERTIFICATE
This is to certify that this Project work entitled Online Subgraph Skyline
Analysis Over Knowledge Graphs that is being submitted by

ANUMULA.VENKATAREDDY Reg No:(14AH1F0002) in Partial fulfilment

of the requirements for the award of the degree of the MASTER OF COMPUTER
APPLICATIONS in MASTER OF COMPUTER APPLICATIONS is a record of bonsaied
work carried out under the Guidance and Supervision during the Academic Year 2016-2017
and found worthy of Acceptance to Requirements of the JAWAHARLALNEHRU
TECHNOLOGICAL UNIVERSITY, KAKINADA.

PROJECT GUIDE HEAD OF THE DEPARTMENT

U. BABU, Assoc. Prof U. BABU, Assoc. Prof

EXTERNAL EXAMINER
 ACKNOWLEDGEMENT

We wish to express my thanks to various personalities who are responsible. The

Completion of the project. We are extremely thankful to our Chairman Sri AMARA
VENKTESWARAO, who took keen interest on us in every effort throughout this course. We
owe out Gratitude to our principal Dr. M. ROJA RANI for her kind attention and valuable
guidance throughout the course.

We express my deep-felt gratitude to Mr U. BABU, HOD of MCA Dept. and

coordinator of the project for his encouragement. Their proud knowledge and Willingness
have been a source of inspiration for me through out of this project work.

We extend my sincere thanks to our guide Mr U. BABU, Assoc. Prof, whose valuable
guidance and unstinting encouragement enabled us to accomplish our project successfully in
time.

We affectionately acknowledge the encouragement received from our friends and in

giving those who involved valuable suggestions and clarifying out doubts which had really
helped us in successfully completing our project.
 CONTENTS
NAME PAGE
1.INTRODUCTION 1
2.LITERATURE SURVEY 2
3.SYSTEM ANALYSIS 3
3.1 INPUT DESIGN
3.2 OBJECTIVES
3.3 OUTPUT DESIGN
3.4 EXITING SYSTEM
3.5 PROPOSED SYSTEM
3.6 IMPLEMENATIONS
3.7 SYSTEM REQUIREMENTS
3.7.1 H/W SYSTEM CONFIGURATION
3.7.2 S/W SYSTEM CONFIGURATION
4.SYSTEM STUDY 9
4.1 FEASIBILITY STUDY
4.1.1 ECONOMICAL FEASIBILITY
4.1.2 TECHNICAL FEASIBILITY
4.1.3 SOCIAL FEASIBILITY
5.SYSTEM DESIGN 11
5.1 SYSTEM ARCHHITECTURE
5.2 DATA FLOW DIAGRAM
5.3 UML DIAGRAMS
5.3.1 DATA FLOW DIAGRAMS
5.3.2 USE CASE DIAGRAMS
 5.3.3 CLASS DIAGRAMS
5.3.4 SEQUENCE DIAGRAMS
5.3.5 ACTIVITY DIAGRAMS
5.3.6 COMPONENT DIAGRMS
5.3.7 ER DIAGRAMS
6.SYSTEM TESTING 21
TYPES OF TESTING
6.1 UNIT TESTING
6.2 INTEGRATION TESTING
6.3 ACCEPTANCE TESTING
7. CODING 24
7.1 SOFTWARE ENVIRONMENT
7.2 SAMPLE PROGRAMS
8.SCREEN SHOTS 47

9. CONCLUSION 53

10. FUTURE ENHANCEMENT 54

11. REFERENCE 55
 ABSTRACT

Subgraph search is very useful in many real-world applications. However, users

may be overwhelmed by the masses of matches. In this paper, we propose a subgraph skyline
analysis problem, denoted as S 2A, to support more complicated analysis over graph data.
Specifically, given a large graph G and a query graph q, we want to find all the subgraphs g in
G, such that g is graph isomorphic to q and not dominated by any other subgraphs. In order to
improve the efficiency, we devise a hybrid feature encoding incorporating both structural and
numeric features based on a partitioning strategy, and discuss how to optimize the space
partitioning. We also present a sky layer index to facilitate the dynamic subgraph skyline
computation. Moreover, an attribute cluster-based method is proposed to deal with the curse
of dimensionality. Extensive experiments over real datasets confirm the effectiveness and
efficiency of our algorithm.