SlideShare a Scribd company logo
Robust Module-based Data Management
ABSTRACT
The current trend for building an ontology-based data management system (DMS) is to
capitalize on efforts made to design a preexisting well-established DMS (a reference system).
The method amounts to extracting from the reference DMS a piece of schema relevant to the
new application needs – a module –, possibly personalizing it with extra-constraints w.r.t. the
application under construction, and then managing a dataset using the resulting schema. In this
project, we extend the existing definitions of modules and we introduce novel properties of
robustness 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 carry out our
investigations in the setting of description logics which underlie modern ontology languages,
like RDFS, OWL, and OWL2 from W3C. Notably, we focus on the DL-liteA dialect of the DL-
lite family, which encompasses the foundations of the QL profile of OWL2 (i.e., DL-liteR): the
W3C recommendation for efficiently managing large datasets.
Existing System
The current trend for building an ontology-based data management system (DMS) is to
capitalize on efforts made to design a preexisting well-established DMS (a reference system).
GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
The method amounts to extracting from the reference DMS a piece of schema relevant to the
new application needs – a module –, possibly personalizing it with extra-constraints w.r.t. the
application under
construction, and then managing a dataset using the resulting schema..
Problems on existing system:
1.This is Method Not Maintain Easy.
Proposed System
Here, we extend the existing definitions of modules and we introduce novel properties of
robustness 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 carry out our
investigations in the setting of description logics which underlie modern ontology languages,
like RDFS, OWL, and OWL2 from
W3C. Notably, we focus on the DL-liteA dialect of the DL-lite family, which encompasses the
foundations of the QL profile of OWL2 (i.e., DL-liteR): the W3C recommendation for efficiently
managing large datasets.
Advantages:
1. This is very useful to maintain Data.
2. Search and retrieve the data is very Easy.
Implementation
Implementation is the stage of the project when the theoretical design is turned out into a
working system. Thus it can be considered to be the most critical stage in achieving a
successful new system and in giving the user, confidence that the new system will work and
be effective.
The implementation stage involves careful planning, investigation of the existing
system and it’s constraints on implementation, designing of methods to achieve changeover
and evaluation of changeover methods.
Main Modules:-
Main Modules:-
1. User Module:
In this module, Users are having authentication and security to access the detail
which is presented in the ontology system. Before accessing or searching the details user
should have the account in that otherwise they should register first.
.
2. Global Answer Illustration:
Suppose now that our DMS can answer conjunctive queries (a.k.a. select-project-join
queries), e.g., Q(x):- JournPaper(x) ^ hasAuthor(x; "AH") asking for the journal papers written
by Alon Y. Halevy. In some situation, it is interesting to provide answers from our DMS
together with the reference one, called global answers, typically when our own DMS provides
no or too few answers. To do so, we extend the notion of module to robustness to query
answering, so that global query answering can be performed on demand. We ensure that the
module captures the knowledge in the reference schema that is required to answer any query
built upon the relations of interest. Then, at global query answering time, this knowledge is used
to identify the relevant data for a given query within the distributed dataset consisting of the
dataset of the module-based DMS plus that of the reference DMS.
3. Reducing Data Storage Illustration:
Computing edit distance exactly is a costly operation. Sev- eral techniques have been
proposed for identifying candidate strings within a small edit distance from a query string fast.
All of them are based on q-grams and a q-gram
counting argument. For a string s, its q-grams are produced by sliding a window
of length q over the characters of s. To deal with the special case at the beginning and the end of
s, that have fewer than q characters, one may introduce special characters, such as “#” and “$”,
which are not in S. This helps conceptually extend
s by prefixing it with q - 1 occurrences of “#” and suffixing it with q - 1 occurrences of “$”.
Hence, each q-gram for the string s has exactly q characters.
4. Module-Based Data Management:
The main idea underlying the notion of module of a Tbox is to capture some
constraints of the Tbox, including all the (implied) constraints built upon a given signature,
denoted the signature of interest. Our definition of module extends and encompasses the
existing definitions. In contrast with we do not impose modules of a Tbox to be subsets of it.
For a module to capture some constraints of the Tbox, it is indeed sufficient to impose that it is
logically entailed by the Tbox. In contrast with , we do not impose the signature of modules to
be restricted to the signature of interest. In fact, as we have shown through the illustrative
example, the robustness properties may enforce the signature of modules to contain additional
relations that are not relations of interest but that are logically related to them.
.
.
Configuration:-
H/W System Configuration:-
Processor - Pentium –III
Speed - 1.1 Ghz
RAM - 256 MB(min)
Hard Disk - 20 GB
Floppy Drive - 1.44 MB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Monitor - SVGA
S/W System Configuration:-
 Operating System :Windows95/98/2000/XP
 Application Server : Tomcat5.0/6.X
 Front End : HTML, Java, Jsp
 Scripts : JavaScript.
 Server side Script : Java Server Pages.
 Database : Mysql 5.0
 Database Connectivity : JDBC.

More Related Content

PPTX
Robust Module based data management system
PPTX
Softwae and database in data communication network
PDF
A New Architecture for Group Replication in Data Grid
PDF
DOCX
assignment3
PDF
prefix based labelling scheme for xml data
PDF
Bitmap Indexes for Relational XML Twig Query Processing
PDF
10.Sehgal
Robust Module based data management system
Softwae and database in data communication network
A New Architecture for Group Replication in Data Grid
assignment3
prefix based labelling scheme for xml data
Bitmap Indexes for Relational XML Twig Query Processing
10.Sehgal

What's hot (20)

PPT
An HDF-EOS DataBlade using Informix's Object-Relational Database
PDF
Beginner's guide to Mongodb and NoSQL
PDF
MAP/REDUCE DESIGN AND IMPLEMENTATION OF APRIORIALGORITHM FOR HANDLING VOLUMIN...
PDF
PDF
MAP REDUCE BASED ON CLOAK DHT DATA REPLICATION EVALUATION
PDF
The International Journal of Engineering and Science (The IJES)
PDF
Semantic Web Nature
PDF
Moving Library Metadata Toward Linked Data: Opportunities Provided by the eX...
PDF
EVALUATING CASSANDRA, MONGO DB LIKE NOSQL DATASETS USING HADOOP STREAMING
PDF
HadoopXML: A Suite for Parallel Processing of Massive XML Data with Multiple ...
PPTX
A physical view
PPTX
External CV support in Dataverse 5.7
 
PDF
Transforming data-centric eXtensible markup language into relational database...
PPTX
Transient and persistent RDF views over relational databases in the context o...
DOCX
Scalable and adaptive data replica placement for geo distributed cloud storages
PDF
CDF Embraces XML and SOAP
PDF
RDF and Java
PDF
Hadoop
PPTX
Technical Background
PDF
2008 Industry Standards for C2 CDM and Framework
An HDF-EOS DataBlade using Informix's Object-Relational Database
Beginner's guide to Mongodb and NoSQL
MAP/REDUCE DESIGN AND IMPLEMENTATION OF APRIORIALGORITHM FOR HANDLING VOLUMIN...
MAP REDUCE BASED ON CLOAK DHT DATA REPLICATION EVALUATION
The International Journal of Engineering and Science (The IJES)
Semantic Web Nature
Moving Library Metadata Toward Linked Data: Opportunities Provided by the eX...
EVALUATING CASSANDRA, MONGO DB LIKE NOSQL DATASETS USING HADOOP STREAMING
HadoopXML: A Suite for Parallel Processing of Massive XML Data with Multiple ...
A physical view
External CV support in Dataverse 5.7
 
Transforming data-centric eXtensible markup language into relational database...
Transient and persistent RDF views over relational databases in the context o...
Scalable and adaptive data replica placement for geo distributed cloud storages
CDF Embraces XML and SOAP
RDF and Java
Hadoop
Technical Background
2008 Industry Standards for C2 CDM and Framework
Ad

Similar to Robust module based data management (20)

PDF
Generic Algorithm based Data Retrieval Technique in Data Mining
PDF
E0322035037
PPTX
Aeneas:: An Extensible NoSql Enhancing Application System
PDF
A relational model of data for large shared data banks
PDF
Runaway complexity in Big Data... and a plan to stop it
DOCX
Mc0077 – advanced database systems
PDF
Academic research on graph processing: connecting recent findings to industri...
PDF
Introduction to query rewriting optimisation with dependencies
PDF
high_level_parallel_processing_model
PDF
NoSQL overview #phptostart turin 11.07.2011
PDF
Development without Constraint
PDF
Evolution of the Graph Schema
PPT
Claremont Report on Database Research: Research Directions (Le Gruenwald)
PDF
Datastores
PPT
Data-Intensive Scalable Science
PDF
FP Days: Down the Clojure Rabbit Hole
PDF
learn you some erlang - chap 9 to chap10
PDF
Document Based Data Modeling Technique
PDF
28 16094 31623-1-sm efficiency (edit ari)new2
PPT
Database Research Principles Revealed
Generic Algorithm based Data Retrieval Technique in Data Mining
E0322035037
Aeneas:: An Extensible NoSql Enhancing Application System
A relational model of data for large shared data banks
Runaway complexity in Big Data... and a plan to stop it
Mc0077 – advanced database systems
Academic research on graph processing: connecting recent findings to industri...
Introduction to query rewriting optimisation with dependencies
high_level_parallel_processing_model
NoSQL overview #phptostart turin 11.07.2011
Development without Constraint
Evolution of the Graph Schema
Claremont Report on Database Research: Research Directions (Le Gruenwald)
Datastores
Data-Intensive Scalable Science
FP Days: Down the Clojure Rabbit Hole
learn you some erlang - chap 9 to chap10
Document Based Data Modeling Technique
28 16094 31623-1-sm efficiency (edit ari)new2
Database Research Principles Revealed
Ad

More from IEEEFINALYEARPROJECTS (20)

DOCX
Scalable face image retrieval using attribute enhanced sparse codewords
DOCX
Scalable face image retrieval using attribute enhanced sparse codewords
DOCX
Reversible watermarking based on invariant image classification and dynamic h...
DOCX
Reversible data hiding with optimal value transfer
DOCX
Query adaptive image search with hash codes
DOCX
Noise reduction based on partial reference, dual-tree complex wavelet transfo...
DOCX
Local directional number pattern for face analysis face and expression recogn...
DOCX
An access point based fec mechanism for video transmission over wireless la ns
DOCX
Towards differential query services in cost efficient clouds
DOCX
Spoc a secure and privacy preserving opportunistic computing framework for mo...
DOCX
Secure and efficient data transmission for cluster based wireless sensor netw...
DOCX
Privacy preserving back propagation neural network learning over arbitrarily ...
DOCX
Non cooperative location privacy
DOCX
Harnessing the cloud for securely outsourcing large
DOCX
Geo community-based broadcasting for data dissemination in mobile social netw...
DOCX
Enabling data dynamic and indirect mutual trust for cloud computing storage s...
DOCX
Dynamic resource allocation using virtual machines for cloud computing enviro...
DOCX
A secure protocol for spontaneous wireless ad hoc networks creation
DOCX
Utility privacy tradeoff in databases an information-theoretic approach
DOCX
Two tales of privacy in online social networks
Scalable face image retrieval using attribute enhanced sparse codewords
Scalable face image retrieval using attribute enhanced sparse codewords
Reversible watermarking based on invariant image classification and dynamic h...
Reversible data hiding with optimal value transfer
Query adaptive image search with hash codes
Noise reduction based on partial reference, dual-tree complex wavelet transfo...
Local directional number pattern for face analysis face and expression recogn...
An access point based fec mechanism for video transmission over wireless la ns
Towards differential query services in cost efficient clouds
Spoc a secure and privacy preserving opportunistic computing framework for mo...
Secure and efficient data transmission for cluster based wireless sensor netw...
Privacy preserving back propagation neural network learning over arbitrarily ...
Non cooperative location privacy
Harnessing the cloud for securely outsourcing large
Geo community-based broadcasting for data dissemination in mobile social netw...
Enabling data dynamic and indirect mutual trust for cloud computing storage s...
Dynamic resource allocation using virtual machines for cloud computing enviro...
A secure protocol for spontaneous wireless ad hoc networks creation
Utility privacy tradeoff in databases an information-theoretic approach
Two tales of privacy in online social networks

Recently uploaded (20)

PDF
NewMind AI Weekly Chronicles - August'25-Week II
PDF
Network Security Unit 5.pdf for BCA BBA.
PDF
Assigned Numbers - 2025 - Bluetooth® Document
PPTX
Digital-Transformation-Roadmap-for-Companies.pptx
PDF
Machine learning based COVID-19 study performance prediction
PDF
7 ChatGPT Prompts to Help You Define Your Ideal Customer Profile.pdf
PDF
Build a system with the filesystem maintained by OSTree @ COSCUP 2025
PPTX
Big Data Technologies - Introduction.pptx
DOCX
The AUB Centre for AI in Media Proposal.docx
PDF
Peak of Data & AI Encore- AI for Metadata and Smarter Workflows
PPTX
Cloud computing and distributed systems.
PPTX
Machine Learning_overview_presentation.pptx
PPTX
sap open course for s4hana steps from ECC to s4
PDF
Encapsulation theory and applications.pdf
PDF
Optimiser vos workloads AI/ML sur Amazon EC2 et AWS Graviton
PDF
cuic standard and advanced reporting.pdf
PPTX
Programs and apps: productivity, graphics, security and other tools
PPT
Teaching material agriculture food technology
PDF
MIND Revenue Release Quarter 2 2025 Press Release
PDF
Mobile App Security Testing_ A Comprehensive Guide.pdf
NewMind AI Weekly Chronicles - August'25-Week II
Network Security Unit 5.pdf for BCA BBA.
Assigned Numbers - 2025 - Bluetooth® Document
Digital-Transformation-Roadmap-for-Companies.pptx
Machine learning based COVID-19 study performance prediction
7 ChatGPT Prompts to Help You Define Your Ideal Customer Profile.pdf
Build a system with the filesystem maintained by OSTree @ COSCUP 2025
Big Data Technologies - Introduction.pptx
The AUB Centre for AI in Media Proposal.docx
Peak of Data & AI Encore- AI for Metadata and Smarter Workflows
Cloud computing and distributed systems.
Machine Learning_overview_presentation.pptx
sap open course for s4hana steps from ECC to s4
Encapsulation theory and applications.pdf
Optimiser vos workloads AI/ML sur Amazon EC2 et AWS Graviton
cuic standard and advanced reporting.pdf
Programs and apps: productivity, graphics, security and other tools
Teaching material agriculture food technology
MIND Revenue Release Quarter 2 2025 Press Release
Mobile App Security Testing_ A Comprehensive Guide.pdf

Robust module based data management

  • 1. Robust Module-based Data Management ABSTRACT The current trend for building an ontology-based data management system (DMS) is to capitalize on efforts made to design a preexisting well-established DMS (a reference system). The method amounts to extracting from the reference DMS a piece of schema relevant to the new application needs – a module –, possibly personalizing it with extra-constraints w.r.t. the application under construction, and then managing a dataset using the resulting schema. In this project, we extend the existing definitions of modules and we introduce novel properties of robustness 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 carry out our investigations in the setting of description logics which underlie modern ontology languages, like RDFS, OWL, and OWL2 from W3C. Notably, we focus on the DL-liteA dialect of the DL- lite family, which encompasses the foundations of the QL profile of OWL2 (i.e., DL-liteR): the W3C recommendation for efficiently managing large datasets. Existing System The current trend for building an ontology-based data management system (DMS) is to capitalize on efforts made to design a preexisting well-established DMS (a reference system). GLOBALSOFT TECHNOLOGIES IEEE PROJECTS & SOFTWARE DEVELOPMENTS IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401 Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
  • 2. The method amounts to extracting from the reference DMS a piece of schema relevant to the new application needs – a module –, possibly personalizing it with extra-constraints w.r.t. the application under construction, and then managing a dataset using the resulting schema.. Problems on existing system: 1.This is Method Not Maintain Easy. Proposed System Here, we extend the existing definitions of modules and we introduce novel properties of robustness 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 carry out our investigations in the setting of description logics which underlie modern ontology languages, like RDFS, OWL, and OWL2 from W3C. Notably, we focus on the DL-liteA dialect of the DL-lite family, which encompasses the foundations of the QL profile of OWL2 (i.e., DL-liteR): the W3C recommendation for efficiently managing large datasets. Advantages: 1. This is very useful to maintain Data. 2. Search and retrieve the data is very Easy.
  • 3. Implementation Implementation is the stage of the project when the theoretical design is turned out into a working system. Thus it can be considered to be the most critical stage in achieving a successful new system and in giving the user, confidence that the new system will work and be effective. The implementation stage involves careful planning, investigation of the existing system and it’s constraints on implementation, designing of methods to achieve changeover and evaluation of changeover methods. Main Modules:- Main Modules:- 1. User Module: In this module, Users are having authentication and security to access the detail which is presented in the ontology system. Before accessing or searching the details user should have the account in that otherwise they should register first. . 2. Global Answer Illustration: Suppose now that our DMS can answer conjunctive queries (a.k.a. select-project-join queries), e.g., Q(x):- JournPaper(x) ^ hasAuthor(x; "AH") asking for the journal papers written by Alon Y. Halevy. In some situation, it is interesting to provide answers from our DMS
  • 4. together with the reference one, called global answers, typically when our own DMS provides no or too few answers. To do so, we extend the notion of module to robustness to query answering, so that global query answering can be performed on demand. We ensure that the module captures the knowledge in the reference schema that is required to answer any query built upon the relations of interest. Then, at global query answering time, this knowledge is used to identify the relevant data for a given query within the distributed dataset consisting of the dataset of the module-based DMS plus that of the reference DMS. 3. Reducing Data Storage Illustration: Computing edit distance exactly is a costly operation. Sev- eral techniques have been proposed for identifying candidate strings within a small edit distance from a query string fast. All of them are based on q-grams and a q-gram counting argument. For a string s, its q-grams are produced by sliding a window of length q over the characters of s. To deal with the special case at the beginning and the end of s, that have fewer than q characters, one may introduce special characters, such as “#” and “$”, which are not in S. This helps conceptually extend s by prefixing it with q - 1 occurrences of “#” and suffixing it with q - 1 occurrences of “$”. Hence, each q-gram for the string s has exactly q characters. 4. Module-Based Data Management: The main idea underlying the notion of module of a Tbox is to capture some constraints of the Tbox, including all the (implied) constraints built upon a given signature, denoted the signature of interest. Our definition of module extends and encompasses the existing definitions. In contrast with we do not impose modules of a Tbox to be subsets of it. For a module to capture some constraints of the Tbox, it is indeed sufficient to impose that it is logically entailed by the Tbox. In contrast with , we do not impose the signature of modules to be restricted to the signature of interest. In fact, as we have shown through the illustrative
  • 5. example, the robustness properties may enforce the signature of modules to contain additional relations that are not relations of interest but that are logically related to them. . . Configuration:- H/W System Configuration:- Processor - Pentium –III Speed - 1.1 Ghz RAM - 256 MB(min) Hard Disk - 20 GB Floppy Drive - 1.44 MB Key Board - Standard Windows Keyboard Mouse - Two or Three Button Mouse Monitor - SVGA S/W System Configuration:-  Operating System :Windows95/98/2000/XP  Application Server : Tomcat5.0/6.X  Front End : HTML, Java, Jsp  Scripts : JavaScript.  Server side Script : Java Server Pages.
  • 6.  Database : Mysql 5.0  Database Connectivity : JDBC.