Introducing Fuzziness in Existing Orthogonal Persistence Interfaces and Systems

2011 ◽  
pp. 241-268 ◽  
Author(s):  
Miguel Ángel Sicilia ◽  
Elena Garcia-Barriocanal ◽  
José A. Gutierrez
Keyword(s):  
Case Studies ◽  
Programming Language ◽  
Relational Databases ◽  
Database Design ◽  
Query Languages ◽  
Uncertain Information ◽  
Object Storage ◽  
Object Models ◽  
Programming Practices ◽  
Current Database

Previous research has resulted in generalizations of the capabilities of OODB models and query languages to cope with imprecise and uncertain information in several ways, informed by previous research in fuzzy relational databases. As a result, a number of models and techniques to integrate fuzziness in its various facets in object data stores are available for researchers and practitioners, and even extensions to commercial systems have been implemented. Nonetheless, for those models and techniques to become widespread in industrial contexts, more attention should be paid to their integration with current database design and programming practices, so that the benefits of fuzzy extensions could be easily adopted and seamlessly integrated in current applications. This chapter attempts to provide some criteria to select the fuzzy extensions that more seamlessly integrate in the current object storage paradigm known as orthogonal persistence, in which programming-language object models are directly stored, so that database design becomes mainly a matter of object design. Concrete examples and case studies are provided as practical illustrations of the introduction of fuzziness both at the conceptual and the physical levels of this kind of persistent system.

scholarly journals A Low-Cost Library Database Solution

2017 ◽  
Vol 19 (1) ◽  
pp. 46-49 ◽  
Author(s):  
Mark England ◽  
Lura Joseph ◽  
Nem W. Schlect
Keyword(s):  
Search Engine ◽  
Programming Language ◽  
Relational Databases ◽  
Low Cost ◽  
The World ◽  
The Web ◽  
Interface Designs

Two locally created databases are made available to the world via the Web using an inexpensive but highly functional search engine created in-house. The technology consists of a microcomputer running UNIX to serve relational databases. CGI forms created using the programming language Perl offer flexible interface designs for database users and database maintainers.

scholarly journals BUILDING ONTOLOGIES OVER RELATIONAL DATABASES

2018 ◽  
Vol 6 (11) ◽  
pp. 254-265
Author(s):  
Damitha D Karunaratna
Keyword(s):  
Relational Databases ◽  
World Wide ◽  
Query Languages ◽  
Public Access ◽  
Prototype System ◽  
Data Bases ◽  
Domain Specific ◽  
The World ◽  
Access Data ◽  
Relational Data Bases

Relational Databases are typically created to fulfil the information requirements of a community of users generally belongs to a single organization. Data stored in these databases were typically accessed by using Structured Query Languages or through customized interfaces.  With the popularity of the World Wide Web and the availability of large number of Relational Databases for public access there is a need for users to retrieve data from these databases by using a text-based queries, possibly by using the terms that they are familiar with. However, the inherent limitations of Structured Query Languages used to create and access data in relational Data Bases does not allow uses to access data by using text-based queries. Also, the terms used in queries should be limited to those used during the construction of the databases. This paper proposes an architecture to generated ontologies over relation databases and show how they could be enhanced semantically by using available domain-specific or top-level ontologies so that the data managed by the DBs can be accessed by using text-based queries. The feasibility of the proposed architecture was demonstrated by building a prototype system over a sample MySQL database.

Integrating Heterogeneous Enterprise Data Using Ontology in Supply Chain Management

2019 ◽  
pp. 71-102
Author(s):  
Kamalendu Pal
Keyword(s):  
Relational Databases ◽  
Query Languages ◽  
Heterogeneous Data ◽  
Integration Framework ◽  
Rdf Graph ◽  
Semantic Web Technology ◽  
Business Operations ◽  
Semantic Translation ◽  
Description Framework ◽  
Resource Description

Many industries prefer worldwide business operations due to the economic advantage of globalization on product design and development. These industries increasingly operate globalized multi-tier supply chains and deliver products and services all over the world. This global approach produces huge amounts of heterogeneous data residing at various business operations, and the integration of these data plays an important role. Integrating data from multiple heterogeneous sources need to deal with different data models, database schema, and query languages. This chapter presents a semantic web technology-based data integration framework that uses relational databases and XML data with the help of ontology. To model different source schemas, this chapter proposes a method based on the resource description framework (RDF) graph patterns and query rewriting techniques. The semantic translation between the source schema and RDF ontology is described using query and transformational language SPARQL.

From Natural Language to Programming Language

2018 ◽  
pp. 110-130 ◽  
Author(s):  
Xiao Liu ◽  
Dinghao Wu
Keyword(s):  
Problem Solving ◽  
Software Development ◽  
Natural Language ◽  
Case Studies ◽  
Programming Language ◽  
Program Synthesis ◽  
Computer Programs

Programming remains a dark art for beginners or even professional programmers. Experience indicates that one of the first barriers for learning a new programming language is the rigid and unnatural syntax and semantics. After analysis of research on the language features used by non-programmers in describing problem solving, the authors propose a new program synthesis framework, dialog-based programming, which interprets natural language descriptions into computer programs without forcing the input formats. In this chapter, they describe three case studies that demonstrate the functionalities of this program synthesis framework and show how natural language alleviates challenges for novice programmers to conduct software development, scripting, and verification.

Ontology Query Languages for Ontology-Based Databases

2010 ◽  
pp. 227-247
Author(s):  
Stéphane Jean ◽  
Yamine Aït Ameur ◽  
Guy Pierra
Keyword(s):  
Semantic Web ◽  
Query Languages ◽  
Logical Model ◽  
Web Community ◽  
New Generation ◽  
Current Database

Current databases and their associated languages allow a user to exploit data according to their logical model. Usually, there is a gap between this logical model and the actual concepts represented. As a consequence, exploiting, exchanging and integrating data stored in databases are difficult. To overcome these problems, several approaches have proposed to extend current databases with ontologies. We called Ontology-Based Databases (OBDB) such databases. However, current database languages such as SQL have not been designed to exploit ontologies. Thus, a new generation of languages we called ontology query languages has emerged. The goal of this chapter is to provide an up to date survey on ontology query languages. We survey languages coming from the Semantic Web community as well as those coming from the database community.

Visual Query Languages, Representation Techniques, and Data Models

2011 ◽  
pp. 206-233
Author(s):  
Maria Chiara Caschera ◽  
Arianna D’Ulizia ◽  
Leonardo Tininini
Keyword(s):  
Information Systems ◽  
Relational Databases ◽  
Query Languages ◽  
Visual Query ◽  
Representation Technique ◽  
Key Issues ◽  
Visual Query Languages ◽  
Good Trade ◽  
Definition Of ◽  
Representation Techniques

An easy, efficient, and effective way to retrieve stored data is obviously one of the key issues of any information system. In the last few years, considerable effort has been devoted to the definition of more intuitive, visual-based querying paradigms, attempting to offer a good trade-off between expressiveness and intuitiveness. In this chapter, we analyze the main characteristics of visual languages specifically designed for querying information systems, concentrating on conventional relational databases, but also considering information systems with a less rigid structure such as Web resources storing XML documents. We consider two fundamental aspects of visual query languages: the adopted visual representation technique and the underlying data model, possibly specialized to specific application contexts.

From Databases to Ontologies

2009 ◽  
pp. 2360-2383
Author(s):  
Guntis Barzdins ◽  
Janis Barzdins ◽  
Karlis Cerans
Keyword(s):  
Conceptual Model ◽  
Relational Database ◽  
Relational Databases ◽  
Database Design ◽  
Database Schema ◽  
Design Problems ◽  
Uml Profile ◽  
Domain Experts ◽  
Owl Ontology ◽  
Rdf Database

This chapter introduces the UML profile for OWL as an essential instrument for bridging the gap between the legacy relational databases and OWL ontologies. We address one of the long-standing relational database design problems where initial conceptual model (a semantically clear domain conceptualization ontology) gets “lost” during conversion into the normalized database schema. The problem is that such “loss” makes database inaccessible for direct query by domain experts familiar with the conceptual model only. This problem can be avoided by exporting the database into RDF according to the original conceptual model (OWL ontology) and formulating semantically clear queries in SPARQL over the RDF database. Through a detailed example we show how UML/OWL profile is facilitating this new and promising approach.

Database Design Based on B

2009 ◽  
pp. 440-456 ◽  
Author(s):  
Elvira Locuratolo
Keyword(s):  
Data Structures ◽  
Formal Method ◽  
Real Life ◽  
Database Design ◽  
Model Transformations ◽  
Software Systems ◽  
The Novel ◽  
Life Changes ◽  
Semantic Data ◽  
Object Models

This chapter is devoted to the integration of the ASSO features in B. ASSO is a database design methodology defined for achieving conceptual schema consistency, logical schema correctness, flexibility in reflecting the real-life changes on the schema and efficiency in accessing and storing information. B is an industrial formal method for specifying, designing, and coding software systems. Starting from a B specification of the data structures and of the transactions allowed on a database, two model transformations are designed: The resulting model, called Structured Database Schema, integrates static and dynamics exploiting the novel concepts of Class-Machine and Specialized Class-Machine. Formal details which must be specified if the conceptual model of ASSO is directly constructed in B are avoided; the costs of the consistency obligations are minimized. Class-Machines supported by semantic data models can be correctly linked with Class-Machines supported by object Models.

scholarly journals Automated Generation of Personal Data Reports from Relational Databases

2011 ◽  
Vol 10 (02) ◽  
pp. 193-208 ◽  
Author(s):  
Georgios John Fakas ◽  
Ben Cawley ◽  
Zhi Cai
Keyword(s):  
Prior Knowledge ◽  
Data Protection ◽  
Relational Databases ◽  
Query Language ◽  
Personal Data ◽  
Query Languages ◽  
Hash Tables ◽  
Automated Generation ◽  
Novel Approach ◽  
Performance Results

This paper presents a novel approach for extracting personal data and automatically generating Personal Data Reports (PDRs) from relational databases. Such PDRs can be used among other purposes for compliance with Subject Access Requests of Data Protection Acts. Two methodologies with different usability characteristics are introduced: (1) the GDSBased Method and (2) the By Schema Browsing Method. The proposed methdologies combine the use of graphs and query languages for the construction of PDRs. The novelty of these methodologies is that they do not require any prior knowledge of either the database schema or of any query language by the users. An optimisation algorithm is proposed that employs Hash Tables and reuses already found data. We conducted several queries on two standard benchmark databases (i.e. TPC-H and Microsoft Northwind) and we present the performance results.

Sign in / Sign up

Export Citation Format

Share Document