Beruflich Dokumente
Kultur Dokumente
Neha Agrawal
Neha Mare
Ekta Sinha
(Guide)
I.
A. DESCRIPTION LANGUAGE
Description language provides different solution to achieve
such a reuse of a reference ontology based DMS[1]. To
capture the relation of interest for the application under
construction in a module. DL-lite comes with efficient
inference algorithms for querying data through (DL-lite)
ontologies and for checking data consistency w.r.t. integrity
constraints expressed in DL-lite.[2] Existing definitions of
modulesin the literature basically resort to the notion
of(deductive) conservative extension of a schema or of
uniform interplant of a schema, a.k.a. forgetting about
noninteresting relations of a schema. [3] formalizes those two
notions for schemas written in DLs and discusses their
connection. We carry out our investigations in the setting of
DL-lite, which is the foundation of the QL profile of OWL2
for efficiently managing large datasets. In addition, DL-lite
comes with efficient inference algorithms [4] for querying
data through (DL-lite) ontologies and for checking data
consistency w.r.t. integrity constraints expressed in DL-lite.
To attain a consistence database, novel properties of
robustness for modules that provide means for checking easily
that a robust module-based DMS evolves safely w.r.t. both the
schema and the data of the reference DMS. We can use robust
modules in:
Database
a.
INTRODUCTION
IN CONSISTENCY CHECKING
IN QUERY ANSWERING
II.
III.
METHODS
A travel agency where you can get all the facilities on one
click. Its an online travel agency which is user friendly as
well as Responsive, which mean a user is cable of using a
mobile site for travel agency. This travel agency is also
capable of managing data efficiently, which will be done using
Robust module based data management and is secured as well.
The security feature is added using DES algorithm.
A. ROBUST MODULE BASE DATA MANAGEMENT
We revisit the reuse of a reference ontology-based DMS
in order to build a new DMS with specific needs. We go one
step further by not only considering the design of a
modulebased DMS (i.e., how to extract a module from a
ontological schema): we also study how a module-based DMS
can benefit from the reference DMS to enhance its own data
management skills. We Introduced properties of robustness for
modules that provide means for checking easily that a robust
module-based DMS evolves safely w.r.t. both the schema and
the data of the reference DMS. From a module robust to
consistency checking, for any data update in a corresponding
module based DMS, we show how to query the reference
DMS for checking whether the local update does not bring any
inconsistency with the data and the constraints of the reference
DMS. From a module robust to query answering, for any
query asked to a module-based DMS, we show how to query
the reference DMS for obtaining additional answers by also
www.ijsres.com
ALGORITHM 2
The SPC algorithm (Safe Personalization Checking) SPC
(T0,T,T ,RQA,RCC)
INPUT: a Tbox T0that is a personalization of the module T
of a Tbox T w.r.t. sig(T ), and two booleans RQA and
RCC denoting respectively whether T is robust to query
answering and/or consistency checking
OUTPUT: true if T0is safe, false otherwise
(1) if sig(T ) (sig(T0)\sig(T)) 6=
(2) return false
(3) if cl(T ) 6= ERM(T T0,sig(T ), false, false)
(4) return false
(5) if cl(ERM(T T0,sig(T0)\sig+(T),RQA,RCC) 6=cl(T0)
(6) return false
(7) return true.
B. DES ALGORITHM
DES is based on two fundamental attributes of
cryptography: Substitution (confusion) and transposition
(Diffusion). DES consists of 16 steps, each of which called as
a Round. Fig. 2 Shows Encryption and Decryption
Techniques.
ALGORITHM
www.ijsres.com
IV.
SYSTEM FEATURES
Page 37
V.
CONCLUSION
www.ijsres.com
VI.
ACKNOWLEDGEMENTS
REFERENCES
[1] F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P.
F. Patel-Schneider, Eds, The Description Logic
Handbook: Theory, Implementation, and Applications.
Cambridge University Press, 2003.
[2] H. Stuckenschmidt, C. Parent, and S. Spaccapietra, Eds.,
Modular Ontologies: Concepts, Theories and Techniques
for Knowledge Modularization,ser. Lecture Notes in
Computer Science. Springer, 2009,vol. 5445.
[3] S. Ghilardi, C. Lutz, and F. Wolter, Did i damage my
ontology?a case for conservative extensions in description
logics, in KR,2006.
[4] D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini,
and R. Rosati, Tractable reasoning and efficient query
answering in description logics: The dl-lite family, JAR,
vol.
39,
no.
3,
pp.
385429,
2007.
Page 38