Topic Matches: [#1 - 512] / 910

1. J would hke to build a knowledge bale with thi6_ Junetionality

prerequisite.. structure major adviSing I would like to build a
knowledge base for this_organization fYU Based on these selections
SYLLOG returns with an answer table containing the necessary mini-
kbs for our target application. The result is given in the following
answer table: to build a knowledge base Jor your organization you.
need this_ minLkb prerequisite specialization set advising 1 YU-
prerequisite IYU-specializat ion IYU-set IYU_data The module
NYU_data contains the actual facts for the NYU ap plication.

Database and Expert Systems Applications.pdf

2. Thus, we consider the problem to resolve as afuzzy search of pattern

in an image database. We specially describe the behavior of the
proposed structure for this kind of manipulation. We analyze the
distribution of the data in the base, and some operations of
manipulation.

Database and Expert Systems Applications.pdf

SUMMARY AND CONCLUSION We have shown an object-oriented

3.
language suitable for the specification of transaction-oriented data
base applications di rectly by end users of such applications. Such
language is formal and hence computer processable, allowing for
specification execu tion, thus facilitating a prototype development
approach.

Database and Expert Systems Applications.pdf

Under this architecture all the CAD tools share the centralized
4.
relational database. Nonetheless, each CAD tool can have a different
internal data structure most suitable for its own use. The mapping
subsystem performs the required data conversion between these two
forms of data, following a script written in a non-procedural language.

Database and Expert Systems Applications.pdf

 The database mode information can be obtained from data dictionary
5.
directly or from inverse engineering of Power Designer. The schema
information saved in data dictionary reflect the final status of current
database, and can be directly obtained by using middle layer API,
like ODBC API and JDBC API, which can interface different RDBMS.

An Improved Ontology Learning Algorithm from Relational Schema.pdf

6. The CR consist of relational schemes: the appli cation scheme and

the data scheme. The application scheme is used to store the
structure of the decompo sition (the decomposition tree) while the
data scheme contains information about the valid domain of the
attributes in fragments and allocation of the frag ments to the users.

Database and Expert Systems Applications.pdf

INTRODUCTION In the process of developing data base applications,

7.
a requirements determination and specification front-end step is
generally recognized. Methods for requirements specifications have
been developed that range from info=al narrative approaches using
plain natural language, to very fo=al specification tech niques that are
computer processable [6,10,12].

Database and Expert Systems Applications.pdf

Conclusion In integrating various VLSI/ CAD tools, design data must

8.
be stored in a centralized database. We designed and implemented a
data mapping subsystem that converts various VLSI/ CAD design
data stored in relational tables into an internal data structure that can
be efficiently manipulated in C. This data conversion process follows
a script written in a non-procedural mapping language. Besides
constructing the data structure, the script can also initialize certain
fields by using declarative SQL statements.

Database and Expert Systems Applications.pdf

DataMaster (2023) is a Protege plug-in for importing schema

9.
structure and data from relational databases into Pro- tege. It takes
data and meta-data from a database connect- ing using JDBC/ ODBC
 drivers and gives in output an owl ontology composed of owl
concepts and instances imported by the data inside the database.

Ontology learning from relational database a review.pdf

10. Our approach is somewhat simpler. We are only dealing with a

subset of natural language being broad enough to allow a natural
description of the media data but easier to understand than general
language. Furthermore, we found that for most applications the
knowledge base is domain specific allowing us to deal with a much
smaller one for each domain.

Database and Expert Systems Applications.pdf

11. Unlocking the Value of Clinical Information 335 Inverse functions

have to deal with the fundamental difference between XML
documents and relational databases. An XML document is a
hierarchical data struc- ture, whereas a database table represents a
flat data structure. When one converts an XML file into a database
table, all implicit hierarchic information in the CDA document is lost.

Lecture Notes in Artificial Intelligence.pdf

12. In some cases, it will turn out that there are actually common
concepts involved, whereas in many others, representations from
one conceptual structure only roughly approximate the seemingly
analogous representations from some other structure. Considering
the degree of natural language and common sense reasoning
involved in . communicating within an international organization, the
task of creating some conceptual supersystem first is hardly feasible,
and, second, does not promise very successful in the application
either. Hence, the objectives when designing the data model for an
international organization are o Identify the similarities and analogies
between the concepts commonly used, and o Handle those
similarities and analogies in the context of a model.

Database and Expert Systems Applications.pdf

13. The script identifies the tuples in relational tables from which the
records for such entities as transistors and nodes are constructed,
and then it provides linkages among those records so that the data
 structure can be efficiently manipulated by a conventional
programming language. Besides constructing the data structure, the
script can also initialize certain fields by using declarative SQL
statements. We show in this paper that the data-structure builder can
significantly reduce the amount of programming required for data
conversion in VLSI/ CAD programs.

Database and Expert Systems Applications.pdf

Ontology server The core architecture of OntoSeek is an ontology

14.
server [52]. The server provides an interface for applications willing to
access or manipulate an ontology data model (a generic graph data
structure), and facilities main- taining a persistent LCG ( Lexical
Conceptual Graph) database. End users and resource encoders can
access the server to update the LCG database encoded in markup
language, such as HTML or XML.

document ontology2.pdf

The processor is positioned between the application programs which

15.
access the structure data ( COMPONENT table), and the RDBMS. The
modules of the processor can be broadly classified under three
areas: data access interface, cache memory, and translation unit.
The data access interface provides a programming interface for
application programs.

Database and Expert Systems Applications.pdf

The problem with this is that such representation methods do not

16.
comply with the principles of the data storage in relational databases
[6, 7], which results in the need to perform additional transformations
of the data when it is transferred from the database to the application
for further processing. This raises the challenge of developing a table
structure for storing graphs and corresponding methods for
processing them in order to reduce the overhead of converting data
from one format to another.

Graph to RDBMS.pdf
 A DOOD concept used in QUIXOTE: has enough power to rep resent
17.
every data in existing databanks and most rules for them. Building a
protein function database belongs to both stages. It is an ingredient
of integrated database, as well as supplementary knowledge base for
protein sequence or structure database.

Database and Expert Systems Applications.pdf

18. Tables, primary and foreign keys, and columns constitute the
metadata. Thirdly, the Map- ping Generator Engine ( MGE) generates
a file containing the mapping ( R2RML file). Finally, this R2RML
model inputs the complete schema of the instances and the file
contain- ing a set of rules, then, using r2rml-kit-master, produces the
data in RDF triples.

Ontology learning from relational database a review.pdf

19. Intermediate structure – the intermediate data structure used for the
conversion of OWL into a relational schema: MOF ( Meta-Object
Facility) FOL (First order logic), RDF, Jena model, etc.

Generating_Relational_Database.pdf

20. [48] M.M. Zloof. Query-by-example: A data base language. IBM

Systems Journal, 16(4):324-343, 1977.

Database and Expert Systems Applications.pdf

Lecture Notes in Computer Science 409, 1989 [3] ChristaIler, T., di

21.
Primio, F., Voss, A: The AI-Workbench Ba bylon (in German),
Addison-Wesley, Bonn, 1986 [4] Relational Technology Inc.:
INGRES I SQL Reference Manu al, Release 6, Alameda, Califonia,
1989 [5] Hiirder, T., Mattos, N., Puppe, F.: About Coupling of Data
base Systems and Expert Systems (in German), in: State of the Art
3, Oldenbourg Verlag, MUnich, 1987 [6] Mattos, N.: An Approach to
Knowledge Base Management, Doctoral Thesis, Universitiit
Kaiserslautem, Kaiserslautern, Germany, 1989 [7] Perkhoff A:
Afunctional transformation language for the log ical integration of
 heterogeneous data (in German), in: Proc. Datenbanken in Biiro,
Technik und Wissenschaft BTW’91, Kaiserslautern, Germany, 1991.

Database and Expert Systems Applications.pdf

22. Verschelde J-L, Dos Santos MC, Deray T, Smith B, Ceusters W.

Ontology-assisted data- base integration to support natural
language processing and biomedical data-mining. Jour- nal of
Integrative Bioinformatics. 15.01.2004 2004(0001, 2004).

Lecture Notes in Artificial Intelligence.pdf

In order to solve this problem, we designed a data mapping

23.
subsystem that converts VLSI/ CAD data stored in relational tables
into internal data structures so that they can be efficiently
manipulated in C. By using our data mapping language, we could
reduce the amount of code required by the data-structure
construction parts of some real VLSI/ CAD tools to about 1/10 of that
required by C implementation.

Database and Expert Systems Applications.pdf

An Object-Oriented Executable Requirements Specification

24.
Language* Oscar Barros Ge= anPavez Industrial Engineering
Department - University of Chile P.O. Box 2777 Santiago/ Chile
ABSTRACT An end user-, object-oriented requirements specification
language, suitable for transaction-processing data base applications,
is pre sented. Such language is formal and hence computer
processable, allowing for specification execution and simulation, thus
facilitat ing a prototype development approach.

Database and Expert Systems Applications.pdf

25. 2) Relational schema criteria: The generated relational databases

differ with respect to their structure and their constraints. On the one
hand, all methods generate an ontology-specific relational schema
except the method presented in [27]. The latter uses generic
representations as a "triple store" where all the data are stored in a
single large table (subject, predicate, object).
 Generating_Relational_Database.pdf

This is the base of the proposed data structure. The access to any
26.
node is performed using a dynamic index structure. Data is
distributed using a combination of this index and the B-tree [6].

Database and Expert Systems Applications.pdf

This program ming interface consists of function calls of a standard

27.
programming language, for example C. The cache memory holds the
necessary information of the BOM structure data in main memory. The
in
. formation stored in this unit is a conversion of the real BOM structure
data lying on the RDBMS disks. The translation unit provides a buffer
be tween the BOM processor and the underlying RDBMS.

Database and Expert Systems Applications.pdf

In practice, tables that contain data shared among concurrent users

28.
are irnmediatly updated, while updates on non-concurrent tables are
buffered for later writing at the end of a session. The hierarchical
structure among blackboards is implemented by the database
administrator which defines the context availables by each clinical
structure and resolves inter-context conflicts.

Database and Expert Systems Applications.pdf

The resulting data architecture is based on how data is related to

29.
other data, not on how the data is used by the applications or on who
uses the data. This provides a more stable and flexible structure.
This logical data architecture is used to drive the creation of physical
data structures free of creation, update, and deletion anomalies that
result in inconsistent data values and other data intearitv uroblems.

A Requirement-Based Approach to Data Modeling and Re-

engineering.PDF

30. Key Words and Phrases: relational database, CAD database,

mapping language, data conversion, VLSI/ CAD.
 Database and Expert Systems Applications.pdf

GenBank module F== INTERFACE F== MODULE PIR module II

31.
Protein Function DB module ~ (submodules) Chemical reactions
Relations of Reactions Transport Domain (submodules) Feature
Descriptions in PIR Motifs Fig 3.3 Protein Function Database in
QuIXOTE 4 QUIXOTE: a DOOD Language In [ 13J a new database
language QuIXOTE has been proposed as a knowledge
representation language, whose ancestors are lan guages for
deductive and object-oriented databases [ 15J and nat ural language
processing applications. It is shown more precisely in [ 14J and [7J.

Database and Expert Systems Applications.pdf

Introduction Standard relational database systems have as data

32.
structure flat tables which are very common for many administrative
tasks [3]. But data mo delling in new fields of database applications,
e. g. engineering, CAD/ CAM, requires the represen tation of more
complex objects than in conven tional applications.

Database and Expert Systems Applications.pdf

33. 7) Maintain schema documentation: Relational schema

documentation is often ignored despite the added value in many
tasks such as data querying, mapping definition, application
development and so on [25]. Without a clear definition of the data or
the database structure, several tasks cannot be verified or even done
[4]. Part of the semantics of the class is carried by the axioms but
complementary information can be found in annotations.

Generating_Relational_Database.pdf

In addition, the normalization is even more important in the context of

34.
physical data warehousing (especially for temporal database and big
data) or virtual data warehousing (mediation) where the data
extracted from multiple sources are heterogeneous, highly
fragmented and context dependent [17], [32]. A ―high‖ normal form
(like 5NF and 6 NF) reduce uncontrolled redundancy and facilitate
schema extension as every part of the schema represents one
predicate [33]. Even more, the resulting structure (after
 normalization) is closer to the set-theory foundation of ontologies and
databases, thus facilitating query formulation [34] as the query
formulated using ontology entities can have a more direct mapping.

Generating_Relational_Database.pdf

System Architecture and Specification of a Fast BOM Object

35.
Processor Using a Standard Relational Database Management
System and a Main Memory Cache Frank Steyer TFH Berlin,
Fachbereich 13 ( Informatik) Luxemburger Str. 10, D-1000 Berlin 65 (
F.R.G.) ABSTRACT Based on standard relational tables, a more
com plex data structure (the directed ordered acyc lic graph) together
with its operational inter face, is investigated. Linked lists are used for
representation and kept in cache memory, which allows a much more
efficient data retrieval.

Database and Expert Systems Applications.pdf

The data model for protein structure databank is also dis cussed: a
36.
deductive database[4] and an object-oriented database with a
functional data model[3].

Database and Expert Systems Applications.pdf

The correctness of decision-making depends on the quantity but also

37.
on the quality of data collected. Nevertheless, data is stored in
different sources that are structured (structural heterogeneity) and
encoded (terminological heterogeneity) in different ways. On the one
hand, to use data efficiently and correctly from these various
heterogeneous sources, experts would ideally be able to express
their queries according to a unified knowledge model that represents
their domain without the need to know the structure of each database
nor to manually extract data from many sources each time.

Generating_Relational_Database.pdf

Therefore, a method that allows the generation of views and

38.
modification procedures can be very beneficial for application
development in the sense that data access and modification can be
handled at the database level. Fourth, another interesting advantage
of using ontologies is the capability to document entities using
 annotation. However, the methods do not use annotations to
document the relational schema (actually documentation is rarely
available).

Generating_Relational_Database.pdf

The strategy proposed by MDE consists of two steps: the first (pre-
39.
processing) struc- tures the data in a database; from this structure
obtained, the system generates an SQL file containing the tables and
their extensions. This ascertains the synchronization between the
input model and the RDB metamodel. The resulting input model is
used in the mapping phase.

Ontology learning from relational database a review.pdf

- The structure of environmental data is heterogeneous. This fact

40.
may be caused by the different origin of the data as well as by the
different application contexts for which data is collected.

Database and Expert Systems Applications.pdf

41. 252 data and queries can be imprecise, but, the database schema
itself cannot be imprecise. This situation is also the same in
conventional OODB systems. But, in some applications, it is very
difficult to define a precise database schema (table skeletons in the
case of RDB, and class hierarchies in the case of OODBs).

Database and Expert Systems Applications.pdf

Data analysis and Definition of the schema An evaluation of the

42.
H.I.T. data structures has shown that fundamental relations
between entity sets cannot be constructed from the H.LT. data since
a structure of the data is carried out there in purely chronological
order or according to sheets and to patients. The H.I.T. schema
was therefore revised and incorporated in the INEKS schema taking
into consideration - the requirements for modification (especially
expansion) of the existing data material - the desired flexibility for
analysis the modelling criteria of the applicable database systems
and - the accepted rules of relational modelling (normal-form theory).
 Database and Expert Systems Applications.pdf

OntoBase (2023) automatically generates ontology grounded in the

43.
database (by means of Protégé API using frames and facets), and it
is, therefore, possible for a user to compose new classes starting
from the columns of one or more tables. It utilizes reverse
engineering to create ontol- ogy from a relational database schema.
The tool connects through JDBC/ ODBC drivers to a database and
converts its schema into owl ontology concepts.

Ontology learning from relational database a review.pdf

IV. IMPLEMENTATION AND EXPERIMENTS A. Prototype Tool

44.
Based on the proposed algorithms, we have implemented a
prototype tool, called R2 OWL, using Java programming language on
J2SE 1.6.0 platform. The tool can take relational schemas and data
as input, map them into an OWL DL ontology using our proposed
algorithms, and produce the resulting ontology in both the abstract
syntax and the RDF/ XML syntax.

OWL Ontology Extraction from Relational.pdf

45. The global performance of the database is broken down in table 2.

The times are for a single day of data on an HP 9000/380
workstation. They are based on the average time to fetch the
temperature over 1000 trials.

Database and Expert Systems Applications.pdf

4,2 DEFINING A QUERY Let us now examine the database in which

46.
data are stored. Let us assume that the user is going to use the
direct manipulation approach. If, he is interested to know the
distribution of viral hepatitis by year (§ 3.3) he can cut the edge
linking the nodes ~ and ~ at the node Y*A*S and calculate the new
table starting from the Pqpulation Distribution table (fig.

Database and Expert Systems Applications.pdf

448 K.D. Fenstermacher Table 2. Event data recorded in the body

47.
table of the TaskTracer database. Events from the events table (
 Table 1) are matched with the body table through the BodyID column
of the events table.

Lecture Notes in Artificial Intelligence.pdf

48. An advantage with having data communicated between ap plications

stored in a database is that the data then also is accessed using a
query language instead of being hidden in side data structures within
the applications. Having a query language permits a level of
integration that is hard to obtain with direct use of communication
protocols.

Database and Expert Systems Applications.pdf

49. platform independent machine readable and can be used by different

applications reusable transformable (e. g. to different formats such as
HTML or PDF) a metalanguage that facilitates exchange a
metalanguage that has open standards for visualization ( Scalable
Vector Graphics SVG) Similarly, Fensel (2001) argues that XML
represents an interesting solution of knowledge management and
electronic commerce. The main reasons are that XML helps defining
a language for describing the structure and semantics of data, it is a
language for processing data and it is a protocol for exchanging data.

The_Business_Model_Ontology_a_propositio.pdf

50. Development The Development (the building of the ontology) is

tackled in two phases: the pre- development and post-development.
The pre-development starts by the Data acquisi- tion ( ABox), which
consists of extracting the instances from the relational database [42],
and represent them based on the RDF triple form [43]. After the data
acquisi- tion, the schema acquisition ( TBox) [22] will be started in
order to generate the defi- nition and the meaning of the extracting
instances.

A novel approach for learning ontology from Relational db.pdf

1 3 a review of different approaches to extract the data model from

51.
an RDB schema and then convert them into instances of an ontology.
This conversion enables the interoperabil- ity of information that
otherwise risks remaining ’an island of data’ stored in individual
 databases. Many approaches exist to integrate the mapping between
RDBs and ontolo- gies.

Ontology learning from relational database a review.pdf

52. First, an ontology presents a consensual knowledge model [31], thus

more suitable for semantic interoperability and for defining a unique
access point. Secondly, an ontology offers a formal definition of the
database enabling automatic structure and data consistency
verification (that can be done automatically by most of the
reasoners). Both the ontological and the relational model must be
used together to take advantage of the abstraction and
expressiveness of ontologies as well as the operational
functionalities of databases built using relational schema [16].

Generating_Relational_Database.pdf

53. Thus, it is inappropriate to always generate an rdfs:subClassOf

axiom in the target OWL ontology when detecting a primary-foreign
key in the relational schema. Moreover, when constructing the target
ontology, other important ontology class axioms (such as
owl:disjointClasses and owl:equivalentClass) and
cardinality constraints (owl: minCardinality, owl:maxCardinality,
and owl:cardinality) are often unreasonably created or even
ignored by the existing methods or tools. As a result, the target
ontology is semantically incomplete or unnatural, which is unable to
fully capture the domain knowledge of such Semantic Web
applications that their data is powered by the underlying relational
database.

OWL Ontology Extraction from Relational.pdf

54. A Dynamic Overwrite Protocol for Multiversion Concurrency Control

Algorithms Tadeusz Morzy Technical University of Poznan Institute of
Computing Science 60-965 Poznan, POLAND 1 Abstract The main
difficulty with multiversion database sys tems is that of storage
space, i. e. in a multiversion data base we would need to keep a
potentially unlimited num ber of versions of data items. As storage
space is always limited, the number data item versions maintained in
the database is also limited.
 Database and Expert Systems Applications.pdf

Indeed, the programmer needs not any more to worry about the
55.
impedance mismatch between the database and the programming
lan guage pal·adigms. He/she manipulates persistent data without
having to be aware of the fact that they persist alld do not have to
translate data from one type structure to another when making them
persistent (as it is necessary in the embedded ap proach).

Database and Expert Systems Applications.pdf

An NPD application program is developed to build and maintain a

56.
real time dynamic ’ Source Destination Matrix’ ( SDM). The elements
of this data structure contain information about pairs of Ethernet card
addresses that cause traffic over the network segment to which the
monitor is connected. In the current version of the matrix module the
information stored is limited to the number of packets and the
number of bytes transported between two stations forming a
connection.

Database and Expert Systems Applications.pdf

57. The first step used by the placement officer is to retrieve the
transferring officer's record from the NMPC database and review his
qualifications. The following officer information will be required for this
simple prototype: Name, Rank, Social Security Number ( SSN),
Designator, Present Homeport, Planned Rotation Date ( PRD), and
Requested Home port. This data gives a good sketch of the officer's
qualifications and what the billet requirements need to be.

Database and Expert Systems Applications.pdf

se Figure 4: Consecutive real world states and state variants data.

58.
base version database verSlon database version database version
Figure 5: Multiversion databa. se a.

Database and Expert Systems Applications.pdf

3.2 Diagnosis Algorithm The diagnosis algorithm is a top-down

59.
search of our se mantic network. The paths followed in this search
 are se lected according to a context which is partially defmed by the
sensor data contained in the database. The decom position of the
device into levels of complexity allows us to partition the diagnosis
process into successive steps corresponding to the structure of the
device.

Database and Expert Systems Applications.pdf

60. Other applications within the project use the database, and their
nature requires that each piece of data be accessible in random time.
This stresses the im- ’ Funded by the Artificial Intelligence and
Development Fund of the Ministry of Industry, Science and
Technology Canada, Transport Canada, Atmospheric Environment
Services of Environment Canada, and the Department of National
Defence. The author wishes to thank Frances de Verteui!,

Database and Expert Systems Applications.pdf

With monitors the database be comes an active database, because

61.
procedures of application programs are invoked from the DBMS, when
triggered by state changes in data sources. This technique provides
a way to pass control between cooperating application pro- grams
through a database. .

Database and Expert Systems Applications.pdf

62. Deliverer: After filtering the relevant data, it is passed on to a

Deliverer component (“ Email” and “ Oracle 9 DB” in fig. 8). This
component reformats the information for delivery in the desired
output format. Here, data is converted to a valid data stream for
transmission via JDBC and SQL store procedures to an Oracle 9
database.

Lecture Notes in Artificial Intelligence.pdf

63. The database-to-ontology module extracts the ontology from the

relational database (which is assumed to be in 3 NF) using OWL as
the language for the resulting ontology. This module connects to the
target database to automatically extract the schema data and
produce an owl ontology. It does not import any data as ontology
 instances from the database nor provide any way to retrieve data
inside it with user Sparql query.

Ontology learning from relational database a review.pdf

64. In general it must be accepted that the data structures of eng

ineering applications should allow sub-assemblies to be defined
recursively, and other sub-assem blies to be shared or overlapping
between assem blies [1]. This data structure can be implemented
and pro cessed with flat tables. But the processing with standard
relational operators may produce run time performance problems: - A
query, explosion of a product for example, would result in many sub-
queries during the traversal of the whole graph.

Database and Expert Systems Applications.pdf

Introduction A database contains data that, together with its

65.
associat~d applications, model a real world enterpris~. A datab~se
state IS said to be consistent if it obeys the integnty constraInts of the
database. When users write database transactions (database update
programs), they are reqyire~ to ensur~ ~hat the transactions are
safe.

Database and Expert Systems Applications.pdf

4.1.1 Generalization and Specialization The first objective leads to

66.
the use of the modelling constructs. The examination of the modelling
approach yields that the same technique of Extended Entity
Relationship modelling can still be applied. The EERM is a general
modelling language able to describe whatever data structure, so
there is no reason for modifications.

Database and Expert Systems Applications.pdf

1 Introduction Relational database technology has been successful

67.
at supporting standard data processing (business) applications. This
success is due mostly to the simplicity of the mathematical theory (i.
e., the set theory) of the relational model.

Database and Expert Systems Applications.pdf

 Since SQL is the standard query language for relational databases
68.
these extensions should be easy to use and to inte grate with
existing databases. A major advantage of such an approach is that
with the increased capabilities of SQL invest ments in systems and
already collected data as well as in training of programmers and end-
users can be used and nevertheless new kinds of applications can
be built.

Database and Expert Systems Applications.pdf

In many heterogeneous environments, a knowledge model seems

69.
very useful to decipher source structure, and isolate interesting data
elements to extract and combine [4]. In the early 80s, the computer
science community adopted the ontologies as a knowledge model
with reasoning abilities [6] to provide a shared conceptualization of
some domain of interest [7]. Since then, ontologies (such as those
expressed using the OWL language [8]) have been used in different
ways: database modeling, data integration, data mapping, data
exchange, data annotation, information retrieval, knowledge
discovery, and so on [9].

Generating_Relational_Database.pdf

70. We applied SGML as the common specification language for the three
types of data. When an application is used, STUFF accesses its
specifications from the SGML-DB, and interprets them. We also use
SGML to specify the protocol for transmissions between STUFF and
SGML-DB.

Database and Expert Systems Applications.pdf

In order to allow a more flexible way of interaction between the

71.
different application programs, a possibility is needed to create a well
defined standardized interface between them, instead of individual ad
hoc solutions. Here, the use of a unified database offers - based on
standard data manipulation features - well founded semantics on
which the applications may set up. An important requirement is, that
data created or collected by, geological / geometric tools like DIGMAP
(c.
 Database and Expert Systems Applications.pdf

Referring to the example of a visual database, containing data,

72.
images, and graphics for an engine description, the following
scenario can be assumed: As shown in Fig. I, different applications
and VUIs (e. g. Windows™, Presentation ManagerTM, X-Windows)
are accessing the visual database.

Database and Expert Systems Applications.pdf

73. XSL is a language for formatting an XML document, in order to

display it, for instance as a web page. XSLT shows how the XML
document should be reorganized into another data structure.
Concretely, XSLT is used to describe how to transform the source
data structure of an XML document into a new XML document, which
can have a completely different data structure.

The_Business_Model_Ontology_a_propositio.pdf

74. element between organizations within the enterprise using the

application/database or “phased” usage of a data element during
various stages of the process supported by the application where the
meaning of the element changes. For example, illustrated in Figure
6, “ Manufacturers cage part number indicator code” is used in four
different ways by four organizations (i. e., DCSC, DESC, DGSC, and
DISC.

A Requirement-Based Approach to Data Modeling and Re-

engineering.PDF

In a tightly coupled architecture, the expert system controls the DBMS

75.
with the ES func tioning as a front end data entry system for the data
base or, altematively, the database management sys tem controls the
ES [9). In a loosely coupled archi tecture, both subsystems retain
their original structure and appearance. A loosely coupled archi
tecture is best suited for the officer placement appli cation.

Database and Expert Systems Applications.pdf

 An example of such a generator is given in [19]. Forms and database
76.
interfaces The form model offers a structure to build an environment
in teracting with a DBMS and having the following characteristics:
Extensibility and integration. The FA concept can be used to integrate
the data manipulated by different tools and the FA_expression
language can be extended with the specific func tions of the tools.

Database and Expert Systems Applications.pdf

4.3 DEFINITION OF A GRASS SCHEMA The System has an

77.
environment designed for the Table Ad ministrator which allows the
table schema of a data base to be defined. Each database table can
be defined using the following steps: - definition and positioning of T
node; - acquisition of information associated with T node (data type,
name, description); - definition of S nodes hierarchy; - definition of
hierarchic structure of A nodes; . - ddinition of C nodes; - definition of
edges between C nodes and A nodes; - acquisition of modalities
associated with each C node.

Database and Expert Systems Applications.pdf

Natural Language Understanding in the Parser In this chapter we

78.
describe the natural language under standing capabilities of the
parser. We outline that in order to accomplish the goal of content
retrieval of multimedia data, full understanding of natural language is
not neces sary. However, a restricted interpretation is necessary
which is done by the parser component using the application de
pendent dictionary as a semantic basis.

Database and Expert Systems Applications.pdf

a) Program· Oriented All steps necessary to retrieve visual data and

79.
construct the target object are explicitly embedded in a dedicated
application program which manages database accesses, object
retrieving and object handling. There is no or only very few
descriptive information, concerning object characteristics, stored in
the

Database and Expert Systems Applications.pdf

 THE CLINICAL INFORMATION SYSTEM ARCHITECTURE If we
80.
consider a sanitary structure (administration, hospitals health
centers,etc.), as a specialization of the concept of enterprise, we
must look for the inte gration of information among each area that
has to be computerized. This means that a database architec ture for
implementing clinical functions should sup- port data and information
exchange among clinical divisions as well as the functional
description of the single clinical work structure. This integration is a
key feature of both the practice of medicine and the administration of
health care.

Database and Expert Systems Applications.pdf

For this scenario of an integration of relational databases and DB-

81.
external data structures, three language levels can be identified: - the
relational data definition and manipulation (i. e. in general SQL-DDL
and SQL-DML) the arrangement of suitable data structures and
operations for the administration of the DB-extenal data the
integrated entire layer for the retrieval and alteration of data which
comes from the DB and/or are DB-external, i. e.

Database and Expert Systems Applications.pdf

82. Indeed, this table can be considered a bridge table that real- izes a
many-to-many relationship. A detail worth noting is that the resulting
owl ontology will be written in owl-full (indeed, a datatype property
can be inverse functional only in owl-full language). Typically, such
an OWL-Full ontol- ogy can be less useful in terms of possible
inference on the data because OWL-Full is not completely
processable by a reasoner.

Ontology learning from relational database a review.pdf

Saha, D., Floratou, A., Sankaranarayanan, K., Minhas, U. F., Mittal,

83.
A. R., & Özcan, F. (2016) “ ATHENA: an ontology-driven system for
natural language querying over relational data stores”, Proceedings
of the VLDB Endowment,9(12) , pp.1209-1220.

An Improved Ontology Learning Algorithm from Relational Schema.pdf

 The wish for a system which has a uniform interface to the
84.
applications and a system which is, as far as possible, data
independent, motivated an examination of relational database
systems. Three items were given special focus when choosing the
relational database system for use in ISACS. Those items were:
performance, distributed processing capabilities and the existence of
a well- defined interface to applications written in conventional
programming languages, such as C or FOR TRAN.

Database and Expert Systems Applications.pdf

85. Most of them are "paper" proposals and are in tended to be an

intermediate level between the natural language definition of the
application and its implementation using a (classical) elatabase sys
tem. These data models generally offer a great power of expression
through rich semantic con cepts. They help the application designer
to for mulate the characteristics of his/her application and to test
whether the application meets its re quirements before implementing
it in a relational database system.

Database and Expert Systems Applications.pdf

C. Case Study Saving space, here we just give a small-scale

86.
example to demonstrate the effectiveness of our proposed approach.
Fig. 3 is the University database created with Microsoft SQL Server,
simply modeling the real-world Algorithm SchemaTrans ( S ) Input: A
relational database schema ( ), , , ,S = N attr DT pk fk and its
instance data; all table types in S have been identified in advance via
algorithm TabTypeIdentification.

OWL Ontology Extraction from Relational.pdf

87. This notion of view provides an alternative to the classical vision of

databases. Traditionally, a rela tional database is defined by a
conceptual schema, and by several application programs which
share data through external schemas. In our proposal, schemas,
application programs and data are en capsulated in views and
abstract data types that allow for building complex database
applications with great flexibility.
 Database and Expert Systems Applications.pdf

Therefore, they can be stored easily in relational tables. However, it

88.
is generally agreed that conventional relational database systems are
inefficient for VLSI/ CAD applications, since such applications often
access large amounts of data repetitively.

Database and Expert Systems Applications.pdf

2 Conceptual requirements in spatial databases The support of

89.
applications which use spatial data, such as CAD or geographic
applications, asks for modeling capabilities that exceed those of
relational database systems. There exist a lot of proposals for data
models and data modeling capabilities for this reason. Some of them
are concerned with gencraI capabilities, e.

Database and Expert Systems Applications.pdf

42 Since UI schema, document structures, and transmission control

90.
data correspond well to the above three basic tasks: development,
storage, and transmission, respectively, building a document-based
application requires only the specification of these data to STUFF,
and STUFF has facilities to automatically construct the application
from the specified three types of data.

Database and Expert Systems Applications.pdf

Overview From the data stored in relations, the data-structure builder

91.
constructs the internal data structure to be used by a VLSI/ CAD
program. A VLSI/ CAD program performs this data conversion at the
beginning of its execution so that the data structure can be efficiently
accessed during the rest of its execution. The data structure thus
constructed consists of records and explicit pointers among them.

Database and Expert Systems Applications.pdf

External Schema External Schema Federated Schema Export

92.
Schema Export Schema Component Schema Component Schema
Local Schema Local Schema different data representations e. g. ER,
 OO, relational model common data representations homogenized
schemas merged schema presentation schema e. g. GIM, HDM e.

Lecture Notes in Artificial Intelligence.pdf

93. Ontology learning from relational database: a review 1 3 Methods

that make a translation only based on meta- data but not on the data
and that for this reason generate an Ontology with only Concepts
and Properties but not Instances.

Ontology learning from relational database a review.pdf

Results and discussion To evaluate the efficiency and the solidity of

94.
the proposed process, we have started from 6 relational databases of
the e-commerce domain. These databases cover several meta- data
used in the process of learning ontologies from relational database,
such as tables, columns, foreign keys ( FKs) and primary keys (
PKs). The detailed information of these databases is summarized in
Table 3.

A novel approach for learning ontology from Relational db.pdf

TABLE I. COMPARISON OF EXISTING DBRE-BASED ONTOLOGY

95.
EXTRACTION APPROACHES Work Knowledge source Ontology
language Degree of automation Translation of primary-foreign keys
Axioms & constraints in the ontology Disjoint classes Equivalent
classes Cardinality constraints [9] RDB schema RDFS Semi-
automatic is-a hierarchy No No No [10] RDB schema & data F-Logic
N/A is-a hierarchy No No No [11] HTML forms F-Logic Semi-automatic
is-a hierarchy No No No [12] RDB schema DLR-Lite Automatic is-a
hierarchy Yes Yes No [13] RDB schema & data OWL Automatic is-a
hierarchy No No Yes [14. ] HTML forms OWL Semi-automatic is-a
hierarchy No No Yes [15] RDB schema & data OWL Automatic is-a
hierarchy No No Yes [16] RDB schema & data OWL Automatic is-a
hierarchy No No No [20] RDB schema & data OWL Semi-automatic
N/A No No No

OWL Ontology Extraction from Relational.pdf

 R2OWL has four modules: (1) extraction module: it uses JDBC API,
96.
more specifically, the java. sql package, to parse the contents of an
RDB’s data dictionary in order to extract the physical database
schema and then stores the schema data as in- memory data
structure ( Java class); (2) identification module: it uses Java class
methods corresponding with algorithm TabTypeIdentification to
specify the table types; (3) translation module: it uses Java class
methods consistent with algorithm SchemaTrans to implement the
translation from relational schema to OWL DL. ontology in the abstract
syntax; (4) transformation module: it performs the ontology
transformation from the abstract syntax to the RDF/ XML syntax.

OWL Ontology Extraction from Relational.pdf

97. The results provided by the inference engine depend on the

ontology/database collaboration efficiency, which is undertaken by
DBOM ( DataBase Ontology Mapping), a domain independent
application providing data integration and maintenance services in a
Semantic Web environment [5].

Lecture Notes in Artificial Intelligence.pdf

An ontology typically provides a vocabulary that de- scribes a domain

98.
of interest and a specification of the meaning of terms used in the
vocabulary. Depending on the precision of this specification, the
notion of on- tology encompasses several data and conceptual mod-
els, including, sets of terms, classifications, thesauri, database
schemas, or fully axiomatized theories [2]. When several competing
ontologies are used in differ- ent applications, most often these
applications cannot immediately interoperate.

Ontology matching state of the art and futur.pdf

Together with a medical partner, the Computer Science Department

99.
of Oldenburg University ( Section: Information Systems, Prof. Dr. H.-
I. Appelrath and Dr. R. Zimmerling) is developing the information
system INEKS *) - Informationssystem fUr l< Pidemiologische
Kreb£register (information system for epidemiologic cancer register)
for medical applications. The relational database system ORACLE
with a number of supplementary software tools is generally applied.
 Database and Expert Systems Applications.pdf

The rest of this paper is organized as follows. In “ Related works”

100.
section, we present the related works, which describes the most
popular studies about relational database into ontology conversion.
In “ Learning ontology from relational database ( LOFRDB): life cycle”
section, we introduce, the life cycle for learning ontologies from
relational data- base.

A novel approach for learning ontology from Relational db.pdf

As is briefly mentioned in the previous section, document struc tures

101.
and their handling- UI schema and transmission control data are
closely related from a view point of logical documents. Us ing the
same language makes it much easier for us to decompose a
document structure into substructures which correspond to user in
terface elements. Also, transmission control is performed based on
the contents of documents, so references from the document struc
tures to Hie control becomes easier when the same language is
used.

Database and Expert Systems Applications.pdf

The target application retrieves data objects from the database (e. g.
102.
01) b) Encapsulated Object. Oriented In this case the database
contains objects and methods operating on them.

Database and Expert Systems Applications.pdf

306 Table 1: Content of a DB record Index Value 1 <value> the value

103.
of the parameter (symbolic or numerical) 2 <var> name of physical
parameter (temperature, cloud cover, etc.) 3 <for> forecast time or
program initialisation time 4 <src> source of physical parameter (
RFE, SA, sounding, objective-analysis, etc.) 5 <time> time tag
(relative or absolute) 6 <alt> altitude (pressure or height) 7 <lat>
latitude (a degree or station name) 8 < Ion> longitude (a degree or
station name) enables the user1 of the database to refer to any
record using a uniform syntax, independently of its actual data
structure in the program.
 Database and Expert Systems Applications.pdf

From the data processing point of view, object oriented databases

104.
can store many kinds of data, for example, text and graphics.
Reference [4] gave a comprehensive review of using object oriented
database to deal with mul timedia applications.

Database and Expert Systems Applications.pdf

In other words, the operations on spreadviews allow one to

105.
reorganize and manipulate data, which are presented in a
spreadsheet like fashion and which are internally organized as
relations in a relational data base. The operations on spreadviews
mayor may not affect the underlying relations. In fact, sometimes
they only lead to a more suitable data presentation, whereas, in other
Franco Turini Dipartimento di Informatica Corso Italia 40, 56100 Pisa,
Italy cases, they actually trigger relational algebra operations on the
underlying relations.

Database and Expert Systems Applications.pdf

The user interface is an important part of a database sys tem

106.
especially when dealing with multimedia data because 103 of their
non-textual nature. Most of the research in the area of user interfaces
focus on the entity-relationship [12] or the more complex sematic and
object -oriented data model [1,3] allowing queries to be directly
specified within the schema. In contrast, we use an extension of the
relational model to handle and manipulate the media data.

Database and Expert Systems Applications.pdf

107. The extracted metadata includes tables, col- umns, primary keys (
PKs), and Foreign Keys ( FKs). Thirdly, Mapping Generator Engine (
MGE) exploits the extracted metadata and build a mapping file (
R2RML file). Lastly, R2RML engine takes as input, the database
model ( Schema + Instances) and the gener- ated mapping
document that contains a set of rules representing the database
schema, then provides an output represents the RDF dataset (triples)
using r2rml-kit-master.
 A novel approach for learning ontology from Relational db.pdf

1 Introduction Mapping of ontologies generalizes a number of

108.
problems occurring in realistic semantic web applications such as the
following ones: (I) Data integration is concerned with the use of data
from different sources in one application. The data from the different
sources needs to be presented to the user in a unified way. Typical
scenarios include (a) the integration of relational databases into se-
mantic web applications, where database schemas are first “lifted” to
the ontology level and then mapped to the ontologies of the
applications, and (b) the usage of different heterogeneous ontologies
within semantic web applications (e.

Lecture Notes in Artificial Intelligence.pdf

1 3 3 Conclusion This article aims to provide a review of different

109.
approaches to learning ontology from a relational database and
extracting data from an RDB schema model, convert- ing them into
ontology instances. Two different problems can be faced in the
context of the mapping between RDB and ontologies. The first is to
extract an ontology from an RDB, and the second is to map a
relational database to an ontology that already exists.

Ontology learning from relational database a review.pdf

110. Moreover, we can also ignore the instance data operations via
predicate () Data because they can be implemented using simple,
efficient queries supported by any high- performance SQL DBMS. With
these in mind, we can use the total number n of database schema
elements, including tables, attributes, and FK/ PK references, to
measure the input size of the algorithm. Thus we have T A Rn n n n=
+ + , where Tn , An , Rn denote the number of tables, attributes, and
FK/ PK references, respectively.

OWL Ontology Extraction from Relational.pdf

Whereas most of the above listed requirements can be satisfied

111.
using the conventional mechanisms of a relational database system,
the conceptual modelling needs extended instruments because of
the following characteristics of mining objects and their relationships.
 They have to be appropriately specified and - only in a second phase
- mapped to relational concepts for implementation (cf. chapter 5).
Objects dealt with in mine planning typically are related to a spatial
location, i.

Database and Expert Systems Applications.pdf

[12] J.M. Smith, " Expert database systems: A data base

112.
perspective," in Expert Database Systems: Proceedings from the first
International Work shop, L. Kerschberg, Ed, Menlo Park, CA: The
Benjamin/ Cummings Publishing Company Inc., 1986.

Database and Expert Systems Applications.pdf

113. ( T-Box) Evaluation metrics; (ii) Factual ontology( A-Box) evaluation

metrics. In future works, we aim to focus on the cleaning and
conditioning the data embedded in the relational database in order to
improve the quality of the resulting ontology. Also, we plane to focus
on different struc- tured sources of information such as Excel
spreadsheet, comma-separated value ( CSV), 3 https ://githu b.

A novel approach for learning ontology from Relational db.pdf

114. The purpose of this article is to review the different approaches

existing in the literature to extract data from an RDB and convert it
into ontology instances. Two approaches are used to integrate the
mapping between RDBs and ontologies. The first allows ontologies to
be extracted from an RDB, the second consists of a mapping of the
relational database to an existing ontology.

Ontology learning from relational database a review.pdf

115. and the operation column describes the ways in which a system can
process alignments. The second half of the table classifies the
available matching methods depending on which kind of data the
algorithms work on: strings (terminological), structure (structural),
data instances (extensional) or models (semantics). Strings and
structures are found in the ontology descriptions, e.

Ontology matching state of the art and futur.pdf

 In this paper, we introduce a data mapping facility, which we call a
116.
data-structure builder. The data-structure builder is built on top of a
relational database management system, and i, converts VLSI
design data stored in relational tables into data structures best suited
for each VLSI/ CAD program. This data conversion process follows a
script written in a non-procedural mapping language.

Database and Expert Systems Applications.pdf

C. Ontology Extraction Algorithms (1) Table type identification The

117.
extraction of domain semantics is a knowledge discovery process
that can help generate an OWL DL ontology from a given RDB by
analyzing not only the database schema but also the instance data.
In order to detect different semantics from different relational
structures, we should classify different types of entity tables (normal
entity, weak entity, subtype entity, and supertype entity, etc.) and
various relationship tables including binary relationship (many-to-
many, one-to- many, and one-to-one) tables and n-ary relationship
tables. According to the Forward Engineering part of Fig.

OWL Ontology Extraction from Relational.pdf

1 Introduction Until recently, typing was not a "hot" topic in database

118.
re search as opposed to the programming language area, e. g., [3,
6J. All conventional data models (relational, CODA SYL network, and
hierarchical model) and their associated database programming
languages uniformly provide static type specificity. The recent
emergence of object oriented data models as the (presumably) next-
generation DBMS has led to a relaxation of static typing in favor of
increased flex ibility and expressiveness.

Database and Expert Systems Applications.pdf

3 Spatial Databases Spatial database applications, such as

119.
geographics and mechanical CAD, illustrate another dimension in
advanced database applica tions. They deal with the representation
of n-dimensional data with explicit knowledge about objects, their
extent, and their po sition in space. The basic data structures and
algorithms required in this area do not neatly match the relational
model.
 Database and Expert Systems Applications.pdf

key .... indicates data now o indicates end·users ..... indicates

120.
functional component e indicates storage Figure 1: Architectural
organisation of KBTDA 357 2.3. A functional overview of KBTDA When
KBTDA is applied to a specific database application, it first derives,
with the involvement of the database designer, specific knowledge
about that application (using the knowledge builder), and stores this
specific knowledge in its knowledge base. It then accepts a
transaction (which is either predefined or specified on-line), converts
it into its internal form (an And/Or tree) and performs the following
processing on the And/Or tree : (a). optimisation, which attempts to
improve the efficiency of the transaction; (b). safety verification,
which checks whether the transaction preserves the consistency of
the database; (c). amendment, which corrects any errors detected
during safety verification; (d). optimisation, as step (c) may introduce
new redundanc ies; (e). analysis, which attempts to detect potential
semantic errors that may exist in the transaction.

Database and Expert Systems Applications.pdf

121. Another application area is based on the fact that temporal

databases not only store temporal data but themselves evolve in
time. This means the behaviour of a temporal database can be
described in the framework presented in this paper. Especially the
relation of current temporal data to the history of the database can be
expressed in terms of the query language.

Database and Expert Systems Applications.pdf

In Hazber et al. (2016), the authors describe a method that applies

122.
25 rules to build an ontology from an RDB schema and to convert
RDB data into ontology instances, represented by RDF triples, which
populates the previ- ously built ontology. The proposed approach,
connecting to an RDB using a JDBC driver, extracts metadata and
data and uses it to construct an RDFS-OWL ontology.

Ontology learning from relational database a review.pdf

 5.1 Object structure inversions A recurring data structure in advanced
123.
applications is a graph, where attributes are attached to the nodes
and the edges. For example, an electronic CAD contains nodes that
describe compo nents, resistors, transistores, etc., and the edges
represent wires on the print. Edge attributes could be thickness,
length constraints, and magnetic flux.

Database and Expert Systems Applications.pdf

4 THE ADAMS SYSTEM ADAMS is a system that enables the user to

124.
perform statistical table manipulations. It provides functions to
express queries, to navigate through queries, to define a GRASS
schema, and a sub-schema, to navigate through meta-data, to load
tables, and finally to display tables and analyse data. In ADAMS the
user interaction is supported by a multi-window graphical interface.

Database and Expert Systems Applications.pdf

The framework can connect to a database through a database

125.
analyzer in order to extract meta-data and data from it and produce
an OWL-File containing Owl concepts and instances. This approach
has been used in the Semantic Web project of Renmin University of
China. In this method, a relational scheme in the third normal form (3
NF) is required.

Ontology learning from relational database a review.pdf

Typically, our experience is that a large number of homonyms cannot

126.
be identified by analyzing application code, data dictionary, or
schema definition. Multiple external definitions result from differing
usage of the data 647

A Requirement-Based Approach to Data Modeling and Re-

engineering.PDF

127. A part from storing documents in a database, STUFF also man ages
document structures, user interface schema ( UI schema), and
transmission control data in a database, called SGML-DB. That is,
SGML-DB manages not only document data and their schema but
 also their handling schema ( UI schema and transmission control
data).

Database and Expert Systems Applications.pdf

128. In order to solve these name conflicts, a type defi nition can contain a
renaming clause 2.4 Views At the conceptual level, a database
application can be seen as a set of tasks manipulating the data. Each
task can be described as a set of operations. Some of these
operations are run by users through a human interface[3] and some
are run by others operations.

Database and Expert Systems Applications.pdf

129. This project is supported by the ’ KI· Yerbund North Rhine-

Westphalia’, fo ... n~ed by the Minister for Science and Research of
North Rhine-Westphalia withm the framework of the co-operation ’
Applications of AI’, This program became rather complex, because it
contained a lot of coded knowledge about the structure of and the
access on stored data. Since the FASTBUS project would possibly be
an application of co-operating XPS, this sort of knowledge must ~.
available to other XPS [8]. To enable access to knowledge, It IS
necessary that the knowledge is explicitly stored and that retrieval
operators for the stored knowledge are available.

Database and Expert Systems Applications.pdf

2 Query Formulation in Multidatabase Systems The idea of extending

130.
the relational data model with connectors has been proposed in [
ECR86]. The application ot this concept to the formulat. ion of
multidatabase queries has been discussed in [ ECR87].

Database and Expert Systems Applications.pdf

According to the definition in [1] the architecture concerning the data

131.
access attempted in the FAW WINHEDA project is seen first of all as a
loosely coupled fed eration of distributed and heterogeneous
database systems. This definition is very similar to the definition for
FDBS given in [2]. The autonomy of the participating components is
 maintained, the partial integration on a global level does not restrict
local operations and application programs.

Database and Expert Systems Applications.pdf

132. In the database field, the two main and widely used techniques to
represent a data model (let’s call them conventional techniques) are
the entity- relationship model [1] and the object-oriented model [2]
which are otherwise mutually convertible [3]. However, these
conventional techniques do no longer provide expressivity that is
sufficiently complete to semantically interpreted and widely reused
data outside a restricted field of application [4]. The current trend in
data integration is, therefore, the use of knowledge to enhance the
process [4], [5].

Generating_Relational_Database.pdf

133. As shown in the article information management for the mining

industry must be considered as a domain, which exceeds the current
relational data base technology. Therefore extensions of commercial
database systems are necessary to cope with all requirements.

Database and Expert Systems Applications.pdf

Another problem faced in today's database systems is the lack of a

134.
natural way to specify complex queries. It is caused by the gap
between the user's way of thinking and the query languages used in
most systems. Although a lot of work has been done in the area of
user interfaces for data base systems no query language comes
close to the natural query specification process used by humans.

Database and Expert Systems Applications.pdf

135. Then these fragments and not tAe relations of the relational scheme
are materialized. We further develop a scheme for maintaining the
consistency of a database made up offragments (which include at
tributes of the left or right side of a split functional dependencies) of a
non- 3NF relation by introducing the concept of update clusters and
virtual attributes. The methodology results in a database design
where the database operations access less amount of irrele vant
 data in comparison to the design where the base relations are
materialized.

Database and Expert Systems Applications.pdf

136. Thuy et al. (2014) introduce a method called RDB2 RDF, which
connects to a relational database and, using select queries, can
extract meta-data and data from it to generate an ontology file
reporting both owl concepts and instances. The paper considers that
many ontology learning works proposed at that time performed a
conversion from RDB to ontology without considering that usually, in
such databases, some relational columns are also similar to others in
the name: duplicate columns, representing the same information can
lead to data redundancy.

Ontology learning from relational database a review.pdf

137. e., the RDF/ XML syntax that is used to publish and share ontology
data over the Web, and the frame-like style abstract syntax that is
abstracted from the exchange syntax for facilitating access to and
evaluation of the ontologies (being this the reason for describing our
approach using the abstract syntax in the present paper). Typically,
an OWL DL ontology consists of a set of axioms built using OWL
identifiers and constructs. In the following, Definition 2 [29,31], we
give a concise definition of an OWL DL ontology that is suitable for
capturing the knowledge extracted from a relational database.

OWL Ontology Extraction from Relational.pdf

138. Once data is integrated, a sound mechanism for linking tuples to

entities can be very valuable for knowledge discovery and ontology-
based data access [7]. In this context, the reversibility between the
components of an ontology and those of a relation schema is an
essential point to take into account when defining the conversion
process. Two reversibility features can be defined: the structure
reversibility, the ability to reconstruct or identify an ontological
construct from a relational construct; the tuples reversibility, the ability
to reconstruct individuals (i.

Generating_Relational_Database.pdf
 IV. DISCUSSION Ontologies are used as knowledge models to
139.
define axiomatically the application domain while the relational
schema is used as a logical data model to store, modify, and retrieve
in a secure way a large amount of data. In the context of data
integration, the role of ontologies is twofold.

Generating_Relational_Database.pdf

140. tSupported by Deutsche Forschungsgemeinschaft under grant

En184/1 Numerous attempts have been made to enhance data
models and database technology with the capability to handle time.
Many ap proaches extend the relational model [3, 7 J. Researcll in
this area faces the problem of preserving the orthogonality of the
relational model.

Database and Expert Systems Applications.pdf

141. Formally, using learning approaches, ontologies can be constructed

from various sources of information including structured sources,
such as a relational database, semi-structured sources, such as
dictionaries, or unstructured sources, such as web pages [14]. The
majority of the studies in the literature focus on relational database
as a source of information for several reasons. Firstly, around 70% of
data on the web is stored in relational databases [15].

A novel approach for learning ontology from Relational db.pdf

Firstly, approaches based on an analysis of relational schema. Sec-

142.
ondly, approaches based on analysis relational data.

A novel approach for learning ontology from Relational db.pdf

143. 6) Handle knowledge and schema evolution: Knowledge is in

constant evolution. This implies changes to ontologies with ensuing
repercussions on the related relational schema. The schema must,
therefore, cope with it while maintaining earlier knowledge
interpretations and preserving coherent data [17].

Generating_Relational_Database.pdf
 The actual project aims at the development of a relational database
144.
supporting the complex tasks of markscheiderology and mine
planning in general. These tasks are shortly described in the
following chapter as an introduction to the characteristics of the
application domain. Chapter 3 summarizes the previous computer
support, the existing data basis, and application programs.

Database and Expert Systems Applications.pdf

To access all segments of one route would require an algorithm

145.
similar to that in the Delphi environment, which successively
detennines and retrieves all segments connected to the beginning
and end segments. The knowledge about the structure of the data
acquisition tree and the routes as well as their evaluation is
algorithmically incorporated in the access routines of the FASTBUS
system management. By coupling XPS and KBMS such knowledge
would be stored externally as rules, and together with the intensional
query mechanism would thus simplify the FASTBUS system
management.

Database and Expert Systems Applications.pdf

1 Introduction The main thrust of research vested in post-relational

146.
systems aims at supporting novel application domains, such as office
automation, geographics, elM/robotics, VLSI design, and astronomy.
These en vironments require database modelling and processing
facilities not being offered by commercial DBMSs. In particular, the
mismatch of application programming language and database
language have revived interest in the design of database
programming languages ( DBPL), that extend the early work in the
late seventies on Pas cal/R [20], PLAIN [18], and PS-Algol [2].

Database and Expert Systems Applications.pdf

Bakkas et al. (2013) provide a method that extracts the RDB schema
147.
directly from the database to convert the RDB meta-data and data
into an owl ontology file with owl concepts and instances. This
method operates on two lev- els, applying two different algorithms:
the first algorithm is based on reverse engineering; it then extracts
 the RDB schema (database schema is assumed to be normalized 3
NF) and converts it into the ontology model ( TBOX).

Ontology learning from relational database a review.pdf

148. We applied SGML as the common specification language for the three
components in SGML-DB: document structures, user inter face
elements and transmission control data. This greatly increases
portability of the applications as well as the documents. STUFF has
facilities for constructing document-based applications to access the
components in the SGML-DB and interpret them.

Database and Expert Systems Applications.pdf

149. Rationale and Design of Serendip, a Database Programming

Language IVIichel Adiba Christophe LE~cluse Philippe Richard LGI-
IMAG B.P. 53X 38041 Grenoble Cedex, France Abstract In this
paper, we propose a database program ming language. This
language, named Serendip is designed in order to provide features
from se mantic data models and from programming lan guages.
From the programming languages world, we took the notions of
abstract data types and gen eral computing.

Database and Expert Systems Applications.pdf

Using current database techniques, one can avoid data redundancy,

150.
and the remaining overall consistency checking is automatically
performed by the system, whereas the administrator only has to
define the specific constraints. The formulation of semantic integrity
constraints, however, in terms of relational database techniques gets
rather difficult. So - in order to satisfy the completeness and
correctness requirements - it should be assured for example, that
there is no gap, i.

Database and Expert Systems Applications.pdf

2)- Distributing this set of positions as follows: a)- for i=1 to ( NP-l) do
151.
associate to the processor i the positions that are between «i-l)*([(2
n-L+ l)x(2n-l+ 1)+ I] JNP)+ 1) and (i*([(2 n-L+ l)x(2n-l+ 1)+ 1]/ NP) b)-
associate to the NPth processor the positions that are between « NP-
 l)*([(2 n-L+ l)x(2n-l+ 1)+ 1]/ NP)+ 1) and «2 n-L+ l)x(2n-l+ 1)+ 1) 3)-
Each processor executes partial fuzzy search in its associated set of
positions 5. Conclusion The main contribution of this paper can be
described as the pro position of a new Quadtree-based data
structure allowing a fuzzy search of pattern in an image database.
We have investi gated different types of manipulations with this
structure, and we have shown that it is well adapted for content-
oriented retrieval and fuzzy search.

Database and Expert Systems Applications.pdf

152. The two above mentioned classes of object oriented data models
cannot guarantee type safetr of database operations at compile time.
We argue that the lack of type safety in object bases constitutes a
much more severe problem than in object oriented programming
languages: an object base is a highly shared, persistent resource
which is modified by a variety of more or less knowledgeable users.
Furthermore, many database facilities, e.

Database and Expert Systems Applications.pdf

In order to realize such demand, consider the semantic

153.
understanding the summarization that was not pursued sufficiently in
the past. We proposed a new automatic method of summarization,
and this method infers the retrieval method for multimedia files and
the processing method for multimedia, by utilizing the analogy of a
semantic structure which is given as template and user selected
semantic structure of summarization. In addition, it was confinned
that data capacity will be decreased less than 1/10 compared with
the fonner database, by applying this method to an example of map
summarization from a practical residential map database.

Database and Expert Systems Applications.pdf

The DBOM application enables the design and maintenance of high

154.
quality ontologies by providing correctness and minimally redundant
data. The correctness quality is provided by the capture of the
intuitions of domain experts which is facilitated by a conceptual-
concerned collaboration with the designer. This collaboration also
benefits from a knowledge representation language abstraction and
fast access to a realistic, richly instantiated ABox.
 Lecture Notes in Artificial Intelligence.pdf

The next way to represent graphs is an adjacency list, according to

155.
which the graph is represented as array L, each element of which
denotes vertex i and contains another array Li with the numbers of
vertices j connected to the i-th vertex. There are several approaches
to the software implementation of adjacency lists: using collections,
step arrays, or other dynamic data structures depending on the
programming language, as well as representation as a table with 2
columns, where the first column indicates the vertex number and the
second column specifies all adjacent to it ( Fig. 3).

Graph to RDBMS.pdf

Thus, we consider the relational schemas and data, rather than the
156.
conceptual schemas, as the important source of knowledge (i. e.,
domain semantics) to be extracted when generating OWL ontologies.
In order to acquire natural semantics from a given relational
database, we must do an in-depth analysis of the conceptual
correspondences between database forward engineering and
reverse engineering.

OWL Ontology Extraction from Relational.pdf

Related work includes work on extracting complex objects from

157.
databases [2, 22], structuring knowledge bases [25~, and storing
business rules in knowledge base modules [8]. Unlike these system
we use the same extended OSQL query language as a uniform rep
resentation of both persistent data and task models. Task model
OSQL queries are optimized using techniques from optimizing
relational databases and Datalog [7, 20].

Database and Expert Systems Applications.pdf

158. EXPERIENCES WITH SUPER, A DATABASE VISUAL ENVIRONMENT 1

Annamaria AUDDINO(*), Eric AMIEL(**) and Bharat BHARGAVA(***)
(*) Ecole Poly technique Federale, DI, Laboratoire de Bases de
Donnees - Lausanne, Switzerland (**) INRIA Rocquencourt - B.P.
105 Le Chesnay Cedex, France ("’) Department of Computer
Science - Purdue University - West Lafayette, USA ABSTRACT We
 present our experiences with building SUPER, a database
environment based on a strucrurally object-oriented entity-
relationship data model, called ERC+. SUPER is designed to be a
semantically rich user-friendly front-end to existing relational or
object-oriented database systems. We focus on the functionalities of
visual direct manipulation interfaces of SUPER, in particular the
schema and the query editors.

Database and Expert Systems Applications.pdf

IMPLEMENTATIONAL ApPROACHES The presented concepts of

159.
visual virtual objects, their impact on knowledge augmented visual
databases and on interpretative visual user interfaces are not bound
to a specific implementation environment. The necessary data
structures can be mapped to relational or object oriented database
systems without violating any fundamental concepts. In any of the
two database models there are special features that can be exploited
to optimize certain application components.

Database and Expert Systems Applications.pdf

The nature of a relational database management system implies that

160.
handling cyclic updates of large amounts of measured data, as is the
case in process control applications.

Database and Expert Systems Applications.pdf

3: Architecture of the Information System Already in the first phase of

161.
the stepwise realization of the proposed integrated information
system data for several applications are provided via the SQL
interface: - systems dealing with risk assessment and protection -
graphical systems for map construction All geometric data exported
from the database can directly be processed by graphical systems
like DIGMAP and AutoCAD to produce a graphical output.

Database and Expert Systems Applications.pdf

Graphical data defmition interfaces have achieved a large

162.
consensus, A number of commercial tools exist, which offer graphical
 facilities for the definition of a database schema, according to
concepts of the entity relationship (ER) approach [9].

Database and Expert Systems Applications.pdf

163. Generally, we can assume that the system design ers are not
available. Therefore ways and means should be identified to achieve
also later at least a partial, partly au tomated and application specific
integration of various data sources with fhe participation of the
involved database ad ministrators and users.

Database and Expert Systems Applications.pdf

If we adopt a relational model for the storage of facts about a patient,

164.
we can implement a blackboard as a ~et of database views that can
be independently manlpulated. Each user can derive a private view
from the specified context, locking a view before updating its data.
Each view is accessed directly and locked for the shortest possible
amount of time.

Database and Expert Systems Applications.pdf

In a fourth steps, this federated schema is transformed to external

165.
schemas in data models that the user can easily understand. The
question is whether schema integration as proposed for static
concepts can be applied for deriving an integrated BPM schema. In
[11] the straight-forward application of schema integration of static
aspects to behavioral aspects is doubted and further research in this
area is encouraged.

Lecture Notes in Artificial Intelligence.pdf

166. Now let us analyze the time complexity of the algorithm

SchemaTrans. The same reason as with the algorithm
TabTypeIdentification, we can ignore the instance data analysis
operations in the algorithm SchemaTrans. In addition, since the
operations in Step 1, i.

OWL Ontology Extraction from Relational.pdf

 Third, the structure of relations in a database differs from the
167.
structure of ontological entities. " Ontological" views can be
generated to provide a view of the ontology structure. Even more,
through these views, modification procedures can be generated to
provide better access and standardize data manipulation.

Generating_Relational_Database.pdf

168. models. Finally, we resolve conflicts and produce an The most critical
items are those shown in the integrated logical data model with a
traceability matrix. intersection, i. e., elements that are shared by the
two Then, migrating the existing data base to a relational data
systems and are directly related to pay.

A Requirement-Based Approach to Data Modeling and Re-

engineering.PDF

169. RedSoar uses abduc- tive assembly of antibody hypothe- ses to

construct a best explanation of the test data. In the task, the test data
are the manifestations; anti- bodies are the "disorders" or expla-
nations. RedSoar is directly imple- mented in Soar's production-rule
language and can be described by listing all the rules in the
knowledge base, such as those in Figure 5c.

Task-Structure Analysis for KM.pdf

170. sl161 is operation Comp { } MS : = getcomp " Motor_ Starter Comp;

(query_db 2 (string MS)’1"") = 1 Figure 5 Example Pruning Rule with
Query design separates these tasks into different submodules so
that, if necessary, they can be implemented as separate concurrent
processes accessing the relational DBMS. It is important to minimize
the delay a sensor data update may incur because of an concurrently
executing diagno sis.

Database and Expert Systems Applications.pdf

Another important task of a database is to make stored information

171.
accessible to the users such that desired information can be
extracted in an easy and natural way. This means, the data model
 must be accompanied by an expressive and powerful query
language.

Database and Expert Systems Applications.pdf

172. A user query typically consists of a mixture of precise and im precise

search criteria. Rather than treating these two parts sepa rately, we
chose a unified approach. A functional data base query language is
extended by including a set of elementary simi larity functions, thus
adding infonnation retrieval functionality.

Database and Expert Systems Applications.pdf

The blackboard implementation is parallel to the one used by the

173.
relational database models to man age the facts and refers to the
concept of context (7). As in the database a view is introduced to
describe subsets of the content of the database a context is
introduced to partition the data instandes and to cut across all the
relationships in data model. It is the unified frame in which users of
the same organiza tional entity can work cooperatively but inde
pendently.

Database and Expert Systems Applications.pdf

[12] By default, the application listeners also echo all events to a

174.
MySQL database, providing a permanent record of the user’s
interaction with tracked applications. Because the TaskTracer system
relies on Microsoft’s Component Object Model (COM) technology
[13], it works only on the Microsoft Windows platform. While a multi-
platform tool would be preferable, many knowledge workers use the
Windows platform and in some cases, similar data can be gathered
on other platforms.

Lecture Notes in Artificial Intelligence.pdf

175. Moreover, with the opportunity to easily access data, new needs will
emerge, and existing needs may change. The impact when
integrating knowledge change that implies schema evolution can be
very large. Consequently, the conversion process needs to be
defined in a way to facilitate structure modification and extensibility.
 Generating_Relational_Database.pdf

2) First translate relational data schema to an intermediate model,

176.
and then translate into ontology model from intermediate model.

An Improved Ontology Learning Algorithm from Relational Schema.pdf

177. The data type di∈D in database schema was mapped to data type
symbol ( ) id DT in OWL ontology.

An Improved Ontology Learning Algorithm from Relational Schema.pdf

Relational database systems have proven very successful in

178.
business data processing applications. The primary reason of this
success is that they provide a simple table-view of data and impose
little preconceived structures. However, current relational database
systems cannot efficiently support repetitive access of large amounts
of data required by CAD application programs.

Database and Expert Systems Applications.pdf

V. CONCLUSION Ontologies are definitely starting to be ―popular‖

179.
and they are now used in different forms. They are indeed a very
promising approach to bring formal semantic to relational databases
in order to enhance data interoperability. Nevertheless, in the context
of using ontologies to generate a relational database, many issues
remain to maintain the full expressivity of ontologies, among them:
preserving property cardinalities and axiom expressivity, handling
knowledge and schema evolution, handling missing information, and
maintaining schema documentation.

Generating_Relational_Database.pdf

those approaches try to capture as much domain semantics as

180.
possible from the combination of relational schema and data,
drawbacks still exist as follows: (1) some important OWL class
axioms, such as the Disjoint Classes and Equivalent Classes axioms,
are ignored during the ontology construction process; (2) cardinality
constraints, i. e., owl:minCardinality, owl:maxCardinality
and owl:cardinality, are not correctly or naturally created in the
 resulting OWL ontology; (3) the rdfs:subClassOf axiom is always
generated from any primary-foreign key, but actually a primary-
foreign key could also express an one- to-one (or one-to-many)
binary relationship but not necessary an is-a hierarchy. Despite of
their weakness, the existing approaches set up a foundation for the
proposed work and are of valuable reference to our in- depth
research.

OWL Ontology Extraction from Relational.pdf

For these reasons some database systems, which have the functions
181.
to handle vague data and vague queries, have been reported so far
(for example, see Duckles and Petry[2], Motro[3], Raju and
Majumdar[4], Morrissey[5], Umano[6]) and all of these except
Morrissey[. 5] are based on extensions of the relational database
model to the fuzzy relational database model, since the relational
database model has an established logical foundation.

Database and Expert Systems Applications.pdf

182. High flexibility and efficiency is realized through the use of an object-
oriented paradigm, cache-like mechanisms, and data compression
algorithms. DB has been proved effi cient not only in the Stratus
knowledge based system, but also in more traditional data
processing applications, such as a tephigram display program, a
contouring display pro gram, and a numerical analysis program to
compute vertical motion.

Database and Expert Systems Applications.pdf

The second aspect is the missing database storage of con text

183.
information which provides the meaning to data val ues. This leads to
the challenging demand for storing meta knowledge about the
application domain represented by the conceptual scheme. In the
future, the modeling of the basic concepts and notions of an
application domain will be very important.

Database and Expert Systems Applications.pdf

As a consequence of these needs and as the main part of the paper,

184.
a retrieval mechanism is presented by means of an ex tension of a
 traditional data base query language. We conclude by presenting
both the architecture of our system and the test data employed.

Database and Expert Systems Applications.pdf

185. For the integrated database, we take an approach to write var ious
data and knowledge in a single knowledge representation language,
QUIXOTE, which is designed at ICOT for deductive and object-
oriented database ( DOOD). As a protein function database is a typical
one with complex data and inference rules, we start to describe it in
QUIXOTE as a part of the integrated database.

Database and Expert Systems Applications.pdf

186. In order to design an effective integrated database by means of a

new concept, we have to do two works. Firstly, we should translate
each existing databank into a database in new DBMS, so that
syntactic mismatches would disappear. It is also impor tant to discuss
what kind of schema we should choose for them, ·In order to avoid
semantical overloading of a term "database", I use a term "databank"
for a collection of data and "database" for data related to a data
model or DBMS or how to parse valuable knowledge written in their
comments.

Database and Expert Systems Applications.pdf

187. In Ghawi and Cullot (2007), the authors propose a general

interoperability architecture that uses ontologies to explicitly describe
the semantics of information sources and web ser- vices to help the
communication between the different com- ponents of the
architecture. We are interested in the paper’s main focus: a tool, part
of the general architecture, called DB2 OWL, which connects to a
database, extracts meta- data from it and uses them to generate an
owl ontology file automatically. The tool also generates a mapping
document that preserves the set of transformations made.

Ontology learning from relational database a review.pdf

188. detail in considering the relational database information, the mapping

rule been taken, as well as the ontology specification language were
 different due to different applications that the ontology obtained
through this method confronted. The follow problems would be
resulted in if applied these methods directly in learning ontology
based on relational database: only a rough, lightweight ontology can
be obtained owning to the casual consideration of the corresponding
relation between relational data schema information and ontology
concept; the mapping rule be concluded still stayed on theoretical
level being short of practical operability resulted from taking into
account of the inclusion. and dependence relationship between
attributes as well as the relation between data tuples.

An Improved Ontology Learning Algorithm from Relational Schema.pdf

1) Relational schema The main content of relational database

189.
schema consisted of relational data structure and integrity constraint
declaration. The basic table structure gave definitions to the structure
of relation table, attribute of column, as well as the data type and its
length, etc.; integrity constraint defined the constraint of data
imposed by semantics, including the global restriction on relation
layer, the table constraint on tuple layer, as well as the column
constraint on attribute layer, the above two part of information was
stored in the data dictionary of database as tuple data ( Yiqing etc.,
2012). Definition 1 presented a formal definition of relational
database schema based on the research issue of ontology.

An Improved Ontology Learning Algorithm from Relational Schema.pdf

Others present the results of user queries as relational tuples rather

190.
than as objects of the data model [7. 13]. As the user is not provided
with the same level of abstraction of database schema
representation. there is a lack of consistency. Multiple
representations of the data. that is being manipulated. are often
neither equi\’alent nor Slmultaneously displayed {l4J. The global view
of manipulated data is partitioned into complementary
representations [17J.

Database and Expert Systems Applications.pdf

191. The key to obtain ontology concept and its relation from relational
data schema was to set up the mapping rule from relational database
schema to ontology. The formal definition of relational schema and
 ontology was shown as follows, as well as the conceptual model
reflecting the practical significance of the data.

An Improved Ontology Learning Algorithm from Relational Schema.pdf

192. STUFF applies SGML ( Standard Generalized Markup Language) to

describe document structures, and all documents developed by
STUFF are stored in SGML-DB. In SGML-DB, not only document
contents and document structures but also their handling schema
(user interface schema and transmission control data) are stored, so
modifications of the application, such as changing document struc
tures and altering user interfaces) become easier.

Database and Expert Systems Applications.pdf

During the past several years, many researchers observed that

193.
conventional database systems are not adequate for CAD
applications [2, 3, 4, 5, 6]. Some of them investigated the data
modelling issues and made various proposals [3,4,7,8,9, 10, 11].
Very few researchers [12, 13] have discussed the issues of
supporting rapid development of new design tools.

Database and Expert Systems Applications.pdf

5.2.3 Application of Weight Ranking Algorithm The application of the

194.
weighting algorithm just presented requires a parser to understand
the natural language specifi cations in the multimedia data
descriptions and the user queries. As stated earlier, the descriptions
are parsed and stored in the system as predicates. The queries are
pro cessed as follows.

Database and Expert Systems Applications.pdf

195. The SUPER environment consists of the following four visual tools:
The schema editor is a visual data definition interface allowing
designers to build an ERC+ schema and supporting two modes of
interaction. The query editor is an editor that provides the user with
direct and visual manipulation facilities for the specification of queries
and updates. The view definition tool provides the user with an
interface allowing to build views over an existing database schema.
 Database and Expert Systems Applications.pdf

The data structure of a panel in the ZPD database consists of non-

196.
spatial attributes like number, name, etc. and of spa tial attributes
containing the point coordinates of the panel. Dependent on the
context, the relevant aspect of the geome try of a panel may be
defined by the first and the last position of the face during the mining
of the panel. The positions of the face are geometric data of the
working panel, which are acquired monthly.

Database and Expert Systems Applications.pdf

First, map data that becomes the target of map summarization is

197.
retrieved from the OMS by using a procedure ( selecCdomain and so
on) registered in the template class, then formalized into lists, and
the base of the analogical inference domain D2 is obtained. In
addition, this selecCdomain method translates map data into the
coordinates of which a arrival place becomes an origin. This method
can both reduce and adjust the scale.

Database and Expert Systems Applications.pdf

198. Commercially available and efficient database systems are suitable

for a consistent and persistent administration of the incurred
information especially in the so-called standard applications (e. g.
administration of basic patient data, examination results, sickness
developments, and mainly statistical analyses).

Database and Expert Systems Applications.pdf

ISRA 2012. https:// doi. org/ 10. 1109/ ISRA. 2012. 62192 58 Zhang
199.
L, Li J (2011) Automatic generation of ontology based on data- base.

Ontology learning from relational database a review.pdf

At ICOT, we have several projects related to molecular biology,

200.
including the development of DBMS and the design of a knowl edge
representation language [12]. We have developed a DBMS,
Kappa[17], based on a nested relational model, where GenBank and
PIR are stored, and will develop some applications to help bi
 ologists. We are also developing a deductive and object-oriented
database ( DOOD)[16] language named QuIXOTE [13].

Database and Expert Systems Applications.pdf

201. The Object-oriented approach has recently received a great deal of

attention from the area of database management systems ( DBMS's)
for new applications such as CAD-CAM. AI. etc .. The well estab
lished technology of relational DBMS's is not able to provide effec
tive and efficient solutions to the problems which these applications
raise. on one hand because of the lack of high level data abstraction
primitives. and on the other hand because of the strong separation
be tween data and operations on them.

Database and Expert Systems Applications.pdf

In comparison with these OMSs we proposed and devel oped InORM

202.
database system [14] as an OMS which is based on an relation-object
model (or an integrated rela tional and object-oriented data model). It
is fully object ()ri(~nted according to the " manifesto" [4]. The
interface to I nORM is EQL that is an object-oriented extension to the
SQL query language [1].

Database and Expert Systems Applications.pdf

We use non-procedural extensions to OSQL as the language to

203.
express what type of changes are of interest for a given application.
This is achieved by the programmer specifying a query (view) whose
result is monitored for change. The programmer thus registers
interest in a class of database state changes and delegates to the
DBMS to generate a plan to infer when these value states change
because of database updates.

Database and Expert Systems Applications.pdf

204. First consider personalized information search and retrieval tasks in

databases and information systems. The classical relational model
that is still predominant in today’s practical database applications
uses relational algebra to specify rigid selection predi- cates that
allow selecting objects with certain characteristics from usually large
 data sets. Though this model is applicable in a variety of simple
cases, e.

Lecture Notes in Artificial Intelligence.pdf

205. Data-Structure Builder for VLSI/ CAD Software DoohunEum Artificial

Intelligence Section Electronics and Telecommunications Research
Institute Daejun, 305-606 South Korea Toshimi Minoura Computer
Science Department Oregon State University Corvallis, OR 97331,
USA Abstract Relational database systems have successfully solved
many business data processing problems. The primary reason of this
success is that the relational data model provides a simple, yet
flexible view of data as tables. In studying VLSI/ CAD data, we
noticed that they are often represented in formats similar to relational
tuples.

Database and Expert Systems Applications.pdf

Currently, academic and practical work is being done in the direction

206.
of formalizing the statement of requirement specifica tions and
providing computer support for them. Representative approaches of
this work are: i) CASE products [5] that partially fo=alize specifications
by some sort of computer-supported diagramming - DFD, ER, state
transition, etc. -and dictionary or repository documentation, and
which attempt to interface with 3,d generation languages, data base
products or 4th generation languages for code generation. ii)
Languages like SREM [1], Taxis [8], Paisley [13] and others that
formalize specifications in a way which is close to the computer
implementation and thus are able to execute specifica tions. iii)
Object-oriented programming and design, which provide
fo=allanguages like OPAL [9], IRIS [7] and others [11] that are
suitable for analysts. iv) Fo=allanguages like CML [4] and others that
fo=alize specifications in a way which is close to users views of the
system but that have not yet been successful in either providing
specifica tions that are processable themselves or generate code in a
suitable language that implements the specification.

Database and Expert Systems Applications.pdf

6 Discussion We have described an architecture which has been

207.
imple mented to support database applications that are sensitiye to
 changes in an underlying heterogeneous data sources. Using such a
system one writes applications that adapt to change rather than
prohibit change as is customary in traditional database transaction
systems. We used the mediator con cept [26] to identify three kinds
of mediators which we found import:ant in such an architecture: 1.

Database and Expert Systems Applications.pdf

208. SPREAD VIEWS Alessandro Campioli, Luciano Lucchesi Systems &

Management Vicolo S. Pierino 4,56100 Pisa, Italy Abstract The data
type spreadview is introduced. Spreadviews gather together features
from the spreadsheet based technology and the relational data base
field. Operations on spreadviews allow both the manipulation of data
representation and the transformation of data via relational
operations which are issued via a spreadsheet oriented interface.

Database and Expert Systems Applications.pdf

An important part of this ontology focuses on drug related data, a

209.
field with a high update rate which requires storage in a database.
Starting from the fact that "databases are similar to knowledge base
because they are usually used to maintain models of some domain of
discourse"[3], the idea of DBOM is to tackle the problem of database-
to-ontology mapping.

Lecture Notes in Artificial Intelligence.pdf

 Vol.:(0123456789)1 3 Journal of Ambient Intelligence and
210.
Humanized Computing https://doi.org/10.1007/s12652-
023-04693-8 ORIGINAL RESEARCH Ontology learning from
relational database: a review Rosalba Mosca1 · Massimo De Santo1
· Rosario Gaeta1 Received: 22 February 2023 / Accepted: 28 August
2023 © The Author(s) 2023 Abstract A relational database ( RDB) is a
digital database that uses components (such as constraints, tables,
keys, etc.) to manage data in a structured manner. Because of these
components, RDBs are considered ’poor’ from a semantic point of
view, precisely because of the structure-oriented nature of the
components used. One way to eliminate this limitation is to transform
the RDB into an ontology.

Ontology learning from relational database a review.pdf

In the database community, the problems concerning the integration

211.
of heterogeneous databases were raised long ago. Initial research in
heterogeneous databases was largely directed towards the issues of
resolving schema and data heterogeneity conflicts across multiple
auto- nomous databases [27], and of developing a global schema to
provide integration [28–30]. Some of these researches are worthy of
mention since they offer results that could indicate potential solutions
for ontology mapping and merging.

document ontology2.pdf

212. (b) Or~anizational Objects may either be fact or rule type objects.
Fact objects correspond more to data base components, such as
person data, appointments and so on. They are usually designed
using standard database design techniques.

Database and Expert Systems Applications.pdf

The data model adopted in our system is an extended re lational data

213.
model. Despite some drawbacks the relational model has great
advantages: It is well known, widely used and has a firm theoretical
basis. For our purpose, we extend the relational model to capture
media data types and, as shown below, we also extend the query
language to allow the manipulation of media data and facilitate the
query specification process.
 Database and Expert Systems Applications.pdf

By considering FA_expressions and rules as FA occurrences we get

214.
a system that makes no distinction between data and programs.
However, to adopt the philosophy "everything is an object," we
should define a FA for each major syntactic opera tions of the
language. The syntactical checks would be incorpo rated in the
schema of these FAs and the semantics ones would be defined in the
rules attached to these FAs.

Database and Expert Systems Applications.pdf

Kngwledge Base Management Systems In the coupled system of

215.
Delphi Expert and Oracle, knowledge about the structure as well as
knowledge about an access to this structure is hidden in the
application program. An investigation of exemplary queries with
POSTGRES and the concept of deductive DBS [7] demonstrated that
systems which are able to use knowledge for the deduction of data
considerably reduce the volume of the application program (see
below). The development of XPS within the FASTBUS project is still in
the initial state.

Database and Expert Systems Applications.pdf

The conceptual schema of this data base is presented in figure 1.

216.
The model distinguishes three kinds of types: the mediatic object
type ( MOT), the abstract object type ( AOT) and the constructed
object type ( COT).

Database and Expert Systems Applications.pdf

217. g. having pain in the back), and the ordering of the retrieved objects
according to precise or im precise search criteria (e. g. ordering by
age or ordering by simi lar case histories). Arithmetic computations
as well as selecting and sorting data items according to precise
criteria can be ex pressed in a conventional database query
language such as SQL.

Database and Expert Systems Applications.pdf

 In order to cover a. ll of these aspects, we could not simply apply a
218.
data model, data base language, representation schema, or
knowledge engineering tool. For a serious approach we had to
identify and to model carefully the interface between reliable medical
knowledge and heuristics to support the process of finding a final
diagnosis.

Database and Expert Systems Applications.pdf

Abstract The aim of converting relational database into Ontology is to

219.
provide applications that are based on the semantic representation of
the data. Whereas, representing the data using ontologies has
shown to be a useful mechanism for managing and exchang- ing
data. This is the reason why bridging the gap between relational
databases and ontologies has attracted the interest of the ontology
community from early years, and it is commonly referred to as the
database-to-ontology mapping problem.

A novel approach for learning ontology from Relational db.pdf

220. 2.3 Logics and Inferencing In our approach we rely on (i) F-Logic as
representation language for our mapping model (cf. [7], “F” stands for
“ Frames”) and (ii) Ontobroker as the inference engine to process F-
Logic (cf. [8]). F-Logic combines deductive and object-oriented
aspects: “F- logic ... is a deductive, object-oriented database
language which combines the declar- ative semantics of deductive
databases with the rich data modelling capabilities sup- ported by the
object oriented data model” (cf. [10]).

Lecture Notes in Artificial Intelligence.pdf

2 The Serendip language In this section, we present the language

221.
Serendip. Our goal is to define a database language which mixes the
computational power of programming languages and concepts of
semantic data models. \;I, Te do not define new semantics features
but in tegrate in Serendip a set of concepts which are widely
encountered in existing semantic models and widely accepted by the
database community of research.

Database and Expert Systems Applications.pdf

 3.1 Definitions and Background As mentioned before, multimedia
222.
data consists of unfor matted data such as text, image, voice,
signals, etc. in addi tion to alphanumeric data. We define a
multimedia database management system ( MDBMS) as a system that
manages all multimedia data and provides a mechanisms to handle
concurrency, consistency, and ~ecovery in addition to pro viding a
query language and query processing.

Database and Expert Systems Applications.pdf

1 Introduction Recently, the importance of accommodating impre

223.
cision in database systems is paid mnch attention (for example, see
Motro[l]), and several efforts have been done to store and/or query
an imprecise data in databases. Indeed, for example, very-large
knowledge bases ( VLKD), CAD databases including a lot of de sign
knowledge, OIS(office information systems) applica tions and
databases for groupwares should include hu man knowledges, and
so, should contain a lot of vague data, which are difficult, impossible
or needless to be de fined precisely. To handle such a vague data in
the usual database framework, it requires to add/rewrite many
complicated application programs and/or to do a rad ical change
against the conventional database schemas which handled only
precise data.

Database and Expert Systems Applications.pdf

224. In our view a schema contains the knowledge regarding the structure
and semantics of its underlying object-base which not only describes
the actual data structure and organization within the system but also
the semantics of the problem domain. Unfor tunately, this type of
knowledge is buried deeply in the schemas, and one needs to rely on
an interactive environment to analyze schemas, extract and structure
this body of knowledge. There are two sorts of comparisons
considered here: one is based on the structure, while the other is
based on the semantics of the schemas.

Database and Expert Systems Applications.pdf

225. While operative in a standardized and multi-user ~perating system

environment (i. e., UNIX), rela uonal databases offer a realistic
platform for black board development and implementation. The
 relational data model allows a classification of clinical entities and
functions involved and stand ard relational query language provides
a uniform interface for data defmition and data manipulation.

Database and Expert Systems Applications.pdf

Keywords—Ontology; relational database; database modeling;

226.
knowledge model; ontology to relational database I.
INTRODUCTION Information systems are now at the center of
decisions in many areas (healthcare, economic, industrial,
manufacturing and so on). A huge amount of data is being generated
every day from different sources. Organizations desire to reuse this
data for many kinds of analyses to enhance decision-making.

Generating_Relational_Database.pdf

The relationship of data types between database and OWL ontology

227.
was described in table 1.

An Improved Ontology Learning Algorithm from Relational Schema.pdf

228. As the discussion concerning geographic (and CAD) databases has

shown, mapping geometric information to database relations and
queries is a non-trivial problem. Even for geometric search problems
in mine planning, relational query facilities often are not sufficient.
Consider for example topological scanning (cf. chapter 6 for details):
if there were a neighborhood relation between points, the transitive
closure of this relation must be constructed for getting all relevant
points.

Database and Expert Systems Applications.pdf

229. (2) Node design Secondly, individual nodes are specified. In this
phase, the concept of database abstraction is helpful to organize
nodes, as described in Section 2. A hierarchy of "is-a" relationship is
also useful when combining the internal data structure with the
objects seen at the hu man interface.

Database and Expert Systems Applications.pdf

 lThroughout this document, the "user", here can refer either to an
230.
application that makes use of the database or to a person that
queries interactively the database 2 An SA consists of an hourly
report that contains meteorological observations of temperature,
clouds, etc., sent from a large number of stations.

Database and Expert Systems Applications.pdf

231. In order to exploit the expressive power of OWL, Li, et al. [13] firstly
explicated a set of rules with formal notations for translating RDB
schema into OWL ontology through analysis of relational schema and
data. The rules were organized for learning classes, properties,
hierarchy and cardinality.

OWL Ontology Extraction from Relational.pdf

The result- ing ontology contains only classes and properties while
232.
the instances are not loaded, but they remain in the databases in
such a way that they can be retrieved in response to a user query.
The paper, starting from 3 table cases with its 6 map- ping rules,
describes useful rules for converting database elements into classes,
data properties, object properties, and hierarchical class structures.
However, it does not define any conversion rule capable of building
axioms starting from RDB base constraints (like a not null, unique,
and primary key), which are typically required for a complete
mapping of real relational databases.

Ontology learning from relational database a review.pdf

233. Nevertheless. relational systems still represent a landmark as re

gards the management and the manipulation of persistent data. Fur
thermore. with respect to the interaction point of view relational
systems show superior features profitable for the end users: query
lan guages are based upon declarative paradigms. and query models
satis fy the property of closure under query (the result of querying a
relation is still a relation). This lets end users easily extract informa
tion from the database. possibly through an incremental process in
case of complex queries.

Database and Expert Systems Applications.pdf

 Knowledge Base Management Systems in the Field of High Energy
234.
Physics Renate Meyer Gunter Schlageter FernUniversitlit Hagen
FeithstraBe 140 D-5800 Hagen ( Germany) Abstract The huge
amount and the complexity of data that occur in high energy physics
experiments require the use of knowledge based techniques.
Conventional coupling of expert systems and data base systems
leads to complex application programs on top of the data base
systems which makes explicit access to the knowledge about the
stored data difficult or impossible. Therefore, knowledge base
management systems are considered which are based on a
deductive database system with external rule management.

Database and Expert Systems Applications.pdf

235. 2.2 Object Structures In the example schema there can be

distinguished between data sorts on the one hand and object and
relationship sorts on the other. The language interfaces are defined
by a couple of functions and predicates. In a logics framework such
interfaces are called database signatures.

Database and Expert Systems Applications.pdf

Dadjoo and Kheirkhah (2015) presented a method for transforming a

236.
relational database into an ontology in which the input of the system
is a relational database, written in SQL Data Definition, and its output
is an ontology model in the OWL structure that will be produced from
the knowledge extracted from a relational database. Even if the
authors do not specify anything, from the input and the evaluation
pre- sented in this work, we can deduce that the method imports only
the concepts but not the instances of the owl ontology. The method is
based on three stages: in the first, the rela- tional database receives
the desired information (metadata) as input and the database tables
are classified according to it, then an intermediate conceptual model
is created using the information from the first stage.

Ontology learning from relational database a review.pdf

Ontology construction based on relational data model refers to the

237.
ontology construction having in the relational schema of data source.
For instance, Tzacheva present a method to embed ontology
knowledge into a relational database through triggers and improve
 query time by forward computing inferences ( Tzacheva, 2013).
Kharlamov etc. show how Semantic Technologies implemented in
their system optique to simplify complex diagnostics by providing an
abstraction layer -ontology -that integrates heterogeneous data (
Kharlamov etc.,

An Improved Ontology Learning Algorithm from Relational Schema.pdf

238. Introduction A distributed heterogeneous database system is a

system which interconnects already existing autonomous database
systems to support global applications that access data items in
more than one database [3, 10]. Other names proposed for such a
network are: federated database system [12], multi database system
[7), decentralized system [11), etc. These systems are characterized
by the autonomy ofthe individual sites as well as the cooperation
among them.

Database and Expert Systems Applications.pdf

In a multilevel secure database ( MLS) environment security labels

239.
such as "top-secret" or "secret", con sist of linearly ordered sensitivity
levels and these la bels are assigned to database components and
users by a database or security administrator. Provid ing security
labels for each attribute of a relational sche~ or even for subset of
domains of attributes leads to enormous processing overheads while
simply protecting files is not sufficient in most environments.
Choosing views as the granularity of protected data for the support of
mandatory access controls was first proposed by [ Clay83] and today
several research projects (for e.

Database and Expert Systems Applications.pdf

240. The structure of the paper is as follows: section 1 defines in formal

way the spreadview data type, section 2 introduces the operations
defined on the spreadviews, in section 3 we give the semantics in
relational terms of the spreadviews, while some interesting extension
to the basic data type are exposed in section 4.

Database and Expert Systems Applications.pdf

 2 The Lixto Software Suite 2.1 General Overview The Lixto Suite
241.
solution provides tools to access, extract, transform, and deliver
information from various semi-structured sources like Web pages to
various customer systems. The Lixto software is 100% based on
Java technology and standards like XML schema, XSLT, SOAP and J2
EE. Internally, the software uses the logic-based data extraction
language ELOG [5].

Lecture Notes in Artificial Intelligence.pdf

In a first prototype, the hybrid expert shell BABYWN [3], which is the
242.
platform for the mine planning expert system, was coupled with the
relational data base management sys tem INGRES [4] (fig. 2).

Database and Expert Systems Applications.pdf

When the work started on the project, there was no available

243.
database tailored for meteorological data that met our requirements.
Frame-like representations, relational lan guages, etc., traditionally
used in knowledge based systems, have plenty of flexibility but are
slow and memory consum ing. Oommercial databases also provide
some degree of flex ibility but require a significant programming effort
in order to tailor them to the levels of functionality and performance
required by the project.

Database and Expert Systems Applications.pdf

 Although many recent DBPL papers [17, 1, 7, 16, 3] aim at these
244.
potential markets, few have taken the requirements imposed by them
as a driving force for language design. To partially alleviate this
situation, we believe that the application domain characteris tics
sketched in this paper have a significant impact on the syntax and
semantics of a general purpose DBPL, such as: union types and type
discrimination, to deal effectively with heterogeneous data structures,
classification, to (automatically) organize objects by struc ture,
behavior, and constraints, triggers, to model semi-autonomous
processes or active ob jects, Abstract Data Types, to extend the type
system and compiler optimizer.

Database and Expert Systems Applications.pdf

245. Mandatory access control is based on the fol lowing principle:

Database components (databases, files, relations, views, tuples,
attributes, domains) are classified by specific security labels, called
clas sification. Users and applications that have access to database
components have a security label called clearance. For a successful
data access, the security policy of an organization requires that the
clearance of a user must be at least as hi~h as the classification of
the database component he/she wants to access.

Database and Expert Systems Applications.pdf

That work builds on an abstract approach regarding real-world

246.
objects instead of schema components of relational databases, like it
is done in [8]. On the role of identifiers in the integration process refer
to e. g. [20,21]. Different data models for schema integration have
been proposed, e.

Lecture Notes in Artificial Intelligence.pdf

data model l databases and tables automatically generated by CASE

247.
tools using re-engineered data models l screen/report design and
implementation via CASE tools using re-engineered data models l
linkage between the legacy data elements to the as-is normalized
data model used by the data extraction Program l linkage between
the to-be data element to the as-is normalized data model used to
 store the extracted legacy data to the to-be database tables l data
quality requirements specified in the re-engineered data model 644

A Requirement-Based Approach to Data Modeling and Re-

engineering.PDF

length length of data : : <button>insert<string> INS <

248.
execCommand>insert <message>during inserting bug report
<form>insert_form < afterService>sho~ output_form <
resultForm>output_form < fieldValue id=bug_no> BUG_NO_field
Figure 8: example of execution button Serpent, developed at
Software Engineering Institute 45 Mode, Smalltalk general purpose
UIMS, developed at U niver sity of North Carolina STUFF's UI
schema realizes the separation of user interface as well as UIMS.
The main difference is that UIMS still requires pro gramming efforts to
control the user interface, while STUFF's user interface elements
contain user interface controls as well as user in terface definitions.
So programming to build the user interface is not required in STUFF,
anymore.

Database and Expert Systems Applications.pdf

In the remainder of the paper we shall use both the SET and NELIST
249.
data types, in designing an expert database system for a route plan
ning application.

Database and Expert Systems Applications.pdf

Another important aspect of a multimedia database sys tem is the

250.
content retrieval of media data. In [9], we intro duced the approach of
contents based search by means of natural language descriptions.
This approach is related to research on artificial intelligence (An and
information re trieval ( IR).

Database and Expert Systems Applications.pdf

A comprehensive system is currently being devel oped that will

251.
provide additional officer qualifICa tion information in the database
and allow more do main expertise information to be incorporated in
the knowledge base. This effort includes the addition of the
 promotion status attribute in the officer data base to provide
information that is helpful in deter mining the optimum billet rank. It
also includes the addition of the Additional Qualification Designa tor (
AQD).

Database and Expert Systems Applications.pdf

5 Future Developments and Con clusion The database interface

252.
developed during the Stratus project is successful in two aspects. It
offers the flexibility to inte grate different representations of data
under a uniform syn tax, and it provides the efficiency required for
many different applications related to this project, in addition to the
knowl edge based system itself. It has been operational for more tl-.

Database and Expert Systems Applications.pdf

Moreover, the ExER-scheme of the fed erative scheme provides a

253.
more powerful data basis for the application, than the mere
combination of the single systems would. In this case, top down and
manual means the man ual construction of the application-oriented
ExER scheme and the manual build up of the corresponding relation
ships between ExER and application objects from above as well as
the mapping of database contents onto these rela tionships, based
on information within the federative level.

Database and Expert Systems Applications.pdf

In this paper the spreaduiews and their operations are formally

254.
defined and their usefulness is shown via a number of examples of
their use. We present also a sketch on how to provide formal
semantics to spreadviews in terms of the standard notions of
relational algebra. Indeed, spreadview operations can be considered,
at least partly, a user oriented way of performing transformations on
the relations in a data base.

Database and Expert Systems Applications.pdf

For implementation, the knowledge has been mapped to relations

255.
and horn clauses of PROLOG-DB, a relational data base
management system providing an interface to Prolog. Thus,
 diagnostic strate gies (represented by clauses) can immediately be
applied to facts from the knowledge base (section 3.2).

Database and Expert Systems Applications.pdf

256. Thus, the knowledge is mapped to relations and clauses of

PROLOG-DB, a relational data base management system providing
an interface to Prolog. Diagnostic strategies (represented by clauses)
can im mediately be applied to facts from the knowledge base.

Database and Expert Systems Applications.pdf

OL provides potential opportunities for semantic integration and, at

257.
the same time, outlines new challenges related to its use ( Ma and
Molnár 2022). Using learning approaches, ontologies can be
constructed from various sources of information, including structured
sources, such as a relational database; semi-structured sources,
such as dictionaries; or unstructured sources, such as web pages (
Maedche and Staab 2004). For several reasons, most stud- ies focus
on the relational database as an information source.

Ontology learning from relational database a review.pdf

258. Building shareable and (re)usable data access mechanisms including

automated verification and inference mechanisms for knowledge
discovery needs to use a common knowledge model with a secure,
coherent, and efficient database. For this purpose, an ontology
provides an interesting knowledge model and a relational database
provides an interesting storage solution. Many papers propose
methods for converting ontology to a relational database.

Generating_Relational_Database.pdf

259. Pointers link related records and provide traversal paths. We call the
internal data structure thus constructed a

Database and Expert Systems Applications.pdf

, rk to r if the BCKPTR clause is provided. The resultant data structure

260.
 is shown in Fig. 3-1 (b).

Database and Expert Systems Applications.pdf

Readcif is a library routine that builds a data structure from a . cif file
261.
in Manhattan geometry. Fig.

Database and Expert Systems Applications.pdf

262. Interfaces are implemented to existing data fIles describing the

structure of the mine.

Database and Expert Systems Applications.pdf

There is also the problem of the appropriate consid eration of the

263.
different versions of one single text, respec tively the problem of the
names and words not contained in the published text, but only in the
notes or comments which have been added to the same text. Where
various indexes are to be cumulated, there will soon be the prob lem
of translating different (natural) languages concerning various
elements of the data base.

Database and Expert Systems Applications.pdf

264. 102 Venecia, see Venice Venetia, see Venice Despite of all these
difficulties it will be important not to demand too much of the
capacities of the editor and his collaborators and it will be necessary
to find a structure of data for the input which is as simple as possible.
This will, of course, be achieved by the strict separation of the input
of the data themselves on the one hand and of all means for
identifying, translating etc. on the other hand. It must be the choice of
the editor to trust these fields of work to different collaborators.

Database and Expert Systems Applications.pdf

Lt Wood is a 1307 ( Non- flying aViatIOn officer) stationed at Naval

265.
Air Sta tion Glenview, Illinois with a PRD of September 1991. He has
no homeport preference in the data base. He states that he would
like to be transferred to Atlanta, Georgia.
 Database and Expert Systems Applications.pdf

Specifying predicates: predicates are stated to select only relevant

266.
data. Formatting the output: the editor is provided with data items
that are to be included into the structure of the result. Displaying
resulting data.

Database and Expert Systems Applications.pdf

2.1 Principle of Data Distribution The principle of storing and

267.
distributing data consists in inver ting the search. This inversion is
interpreted as the linking of each prefix to the set of images where it
occurs. So, the search processing uses directly the data structure to
determine the iden tifiers of the image, where a particular prefix
occurs.

Database and Expert Systems Applications.pdf

Note that the data base operations only differ in their input
268.
parameters. Only for a new tuple ( i. e. no duplicate error results from
the IN SERT ) another task is defined.

Database and Expert Systems Applications.pdf

Our assumptions are as follows: a. File Structures: The data structure

269.
of each index . is based on a B-tree [6,14,15,17].

Database and Expert Systems Applications.pdf

Relationship abstractions are useful when the de signer cannot

270.
specify the const~aints in a relati? nship at the designing phase. The
designer can recogmze the constraints and improve the structure by
analyzing the data.

Database and Expert Systems Applications.pdf

The care of the overall coherence and consistency of shared informa

271.
tion is taken by the transaction manager of the common data base.
Finally, unrelated messages can be originated with replications and
 no attempt to maintain the consistency among such copies is
necessary. This type of interactions may coexist and serve
complementary purposes.

Database and Expert Systems Applications.pdf

- bom clear The cache with all structure data is cleared .

272.

Database and Expert Systems Applications.pdf

It should be noted that this number covers only the index and the
273.
minimal information for the structure records. Memory used for other
suppor ting data and texts are not considered.

Database and Expert Systems Applications.pdf

Fig. 10: Binary tree for article nodes of fig. 2 7 Present and Future
274.
Work Presently, the BOM system is implemented with the following
restrictions: The generation of the dynamic data structure in

Database and Expert Systems Applications.pdf

4 EFFECTS OF INTERNATIONALITY ON DATA MODELLING The

275.
explanations given above already indica~d . th~t internationality has
effects on the organlzatwn s information structure and, hence, on
data modelling. It also became apparent that those differences are
not only due to the generally increased amount of data, but also to
the necessity of accounting for more differentiated information
structures.

Database and Expert Systems Applications.pdf

The overall structure pf the ISACS system, including data flow, is

276.
shown in figure 1. The real or simulated process data are
continuously being updated in the Process Database, and hence
made available to COSSs and the MMI. Some COSSs are running on
a continuous basis, e.

Database and Expert Systems Applications.pdf

 The informations which form the hypertextual data base were
277.
essentially deduced from the italian historical-noble Encyclopedia by
Vittorio Spreti ([12]), whose work was taken as base, enriched by
archive researches, mostly for what concerns the

Database and Expert Systems Applications.pdf

DESIGN AND IMPLEMENTATION OF UnPatient Since not all relevant

278.
diagnostic procedures can be structured by conventional data
modelling techniques2 , we tried to identify computable structures,
which do not render diagnosis difficult, but structure medical reality
accurately.

Database and Expert Systems Applications.pdf

This base of data can be completed and extended through an input

279.
component programmed with SQL * Forms.

Database and Expert Systems Applications.pdf

280. In order to have comparable results, data collection tools were

standardized across employers and countries. However, sector-
specific questions were incorporated into the overall questionnaire
structure.

Labour market ASSESwcms.pdf

Fig. 4 shows part of the structure that was created from the data
281.
provided by the employees. The part that is shown in the figure
focuses on a subset of knowledge used in e-Learning projects
(domain specific competencies).

Lecture Notes in Artificial Intelligence.pdf

 The main idea to achieve the improvement of a retrieval performance
282.
is to con- struct, as far as possible, a separate index structure for
each individual configuration of personal data.

Lecture Notes in Artificial Intelligence.pdf

The personal data in case of the regarded formula for temporary life
283.
insurance products is reflected through the age parameter. Therefore
index structure can be constructed for every age-value using
insurance products restricted to the selected age. After a customer
provides his age and his requirements the corresponding index
structure is chosen and the products are configured with respect to
the customer’s requirements.

Lecture Notes in Artificial Intelligence.pdf

0.65 0.69 0.73 0.77 0.81 0.85 NB BN 1NN 3NN 15NN C45 gram -
284.
gram+ avg global 0.60 0.65 0.70 0.75 0.80 0.85 0.90 NB BN 1NN
3NN 15NN C45 ant1 ant2 ant3 avg group Fig. 2. Classification
accuracies for two main pathogen clusters (left) and for b_lactam
antibiotics clusters (right) 4.5 Tracking Concept Drift Most DM
algorithms assume that data is a random sample from some
stationary distribution, while real data in clinical institutions are
gathered over long time periods (months or years) and therefore
naturally violate this assumption. Kukar [5] states that even in most
strictly controlled environments some unexpected changes may
happen due to fail and/or replacement of some medical equipment,
or due to changes in personnel.

Lecture Notes in Artificial Intelligence.pdf

g. daily, weekly, or monthly) uploads the processed data into the final
285.
data base storage, the data warehouse.

Lecture Notes in Artificial Intelligence.pdf

Integrating Semi-structured Data into Business Applications 473

286.
different colour. Conditions can be defined, allowing the program to
 identify the desired data even if the structure of the Web page slightly
changes. Fig.

Lecture Notes in Artificial Intelligence.pdf

287. This structure corresponds to the XML output that will later be
generated by the wrapper. After loading a Web page with relevant
data into the Lixto software, at first a pattern named article is defined.
This pattern later recognizes lines with article information.

Lecture Notes in Artificial Intelligence.pdf

Fig. 6. System structure overview 3.2 Tire Data Extraction with Lixto
288.
The generation of the wrapper agents to extract data in online
pricelists from tire selling Web sites is conducted analogous to the
procedure described in chapter 2.2. In addition, many of these Web
sites require logging in to the site (authentication), and then filling out
request forms (what tires are of interested) before the result page
with the information needed is displayed and can be extracted.

Lecture Notes in Artificial Intelligence.pdf

3.4 Loading and Processing the Data in Pirelli’s BI System Data in

289.
the Oracle 9 data base extracted by the Lixto software is loaded into
the BI data warehouse following a predefined schedule. Once
integrated in the BI software,

Lecture Notes in Artificial Intelligence.pdf

data segment i Satzlänge Satzidentifikation BDT Datenfeld Satzart 1

290.
1 1 0..* 1 1 has determines i has 11..* <<instance from>><<instance
from>> Nomenclature UML-Metamodel-Level (M2) Generic structure
UML-Model-Level (M1) 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 Fig.

Lecture Notes in Artificial Intelligence.pdf

These techniques stem from the deductive data base community and
291.
are optimized to deliver all answers instead of one single answer as
 e. g. resolution does.

Lecture Notes in Artificial Intelligence.pdf

This is a hierarchical data structure that contains all of the relevant

292.
entities, the relationships between them, the rules, axioms, and
constraints of the domain.” Pinet states that an ontology should
primarily contain [39]: “a vocabulary of terms, a set of term definitions
that identify concepts and fix the term interpretation, a modelling of
the domain of interest to represent relationships between concepts
and an agreement of a community of ontology users about term
definitions and the domain structure.” Roussey et al. propose
classifications of ontologies in [40].

Formal Ontologies in Information Systems.pdf

The O2 data definition language [22), is used to describe a schema.

293.
A schema consists of classes related by an inheritance relationship.
A class describes the internal structure(type) of objects and their
behavior(methods).

Database and Expert Systems Applications.pdf

294. We have taken the route to develop a database programming

langnage, called Goblin, as an intermediate step towards a domain
specific DBMS, i. e. with a domain specific data model, query lan
guage, and user interface. Its design has produced a balanced solu
tion between common practice (and expertise) to write applications in
a mixture of C and SQL and the need for a new full-fledged high level
programming language to obtain a seamless interface to the
database management system.

Database and Expert Systems Applications.pdf

Our first experiment with InterSect shows that the extended hypertext
295.
data model can support both the modelling of the application and the
hypertext structure of instances. We benefit from the mechanisms of
the object oriented datanbase management sys tem, especially the
version mechanism and complex entity type definition mechanism.
We are following this experimental approach because we would like
to find out practically how object oriented database can support
 hypertext systems and how such a combination can be used as a
solution to solve some of the problems of the next generation
hypermedia systems pro posed by Halasz[2].

Database and Expert Systems Applications.pdf

To reason about a particular problem domain requires not only the

296.
ability to describe both the structure and behavior of its components,
it also requires representing component dynam ics. Therefore, an
important aspect of data intensive applications is the demand for
representing changes in state and behavior: ob jects of interest do
not remain static with regard to the rest of the environment they must
also possess the ability to evolve. Unfortu nately, dynamic aspects of
object data models such the evolution of objects, the management of
type changes [3), [4] as well as the notion of dynamic configuration in
which the object components are not bound but specified according
to user requirements [5) have received only a marginal treatment so
far.

Database and Expert Systems Applications.pdf

One of our goal is to have a data model that can be used to support
297.
a rule based language with object-oriented flavors. Meta variables
hide the structural difference between type and its subtypes, thus
clear the way for the unification algo rithm, which, at current form,
can not handle predicates with different numbers of arguments.
Through meta variables, a type and its subtypes have the same
structure at a higher level, which makes inheritance staightforward.

Database and Expert Systems Applications.pdf

Additionally, in the discovery phase, we can build an initial look at the

298.
list of data that we have chosen in order to determine whether it
contains a large number of necessary metadata. It can be clearly
seen from Table 3, that, the relational database Ecommer- ceDB and
Iscommerce did not contain sufficient semantics to start building
ontology. For instance, EcommerceDB database contains 3 tables,
20 columns, 4 PKs, 2 FKs, and 100 instances.

A novel approach for learning ontology from Relational db.pdf

 [ AB88] and [ SC86] have independently defined an algebra for non-
299.
first normal form relations. More recently, FAD [ BA87j, a full data
programming language including algebraic operators for complex
objects, has been specified. Recently, there have been a number of
studies about powerset algebra, which is obtained by adding this
operator to the nested algebra.

Database and Expert Systems Applications.pdf

7 Applications To describe the relation of the information system to

300.
various applications in greater detail, in the following paragraph some
programs are presented which claim that all data are available in one
integrated database. Especially knowledge based approaches for
risk assessment presuppose a quick and easy access to actual and
complete information about a mine and its environment.

Database and Expert Systems Applications.pdf

For the requirements of EIS, the following properties of OODBMS are

301.
important: - A collection of data that should be treated as a unit at a
cert ain level of the application can be declared to form a composite
object, Rnd the OODBMS provides opera tions for manipulating
composite objects as a whole. In contrast to this approach, in
relational databases the data belonging to a single object often is
spread over several re lations. thus requiring expensive joins for
most operations on the ohject.

Database and Expert Systems Applications.pdf

302. A. Issues and Challenges An ontology and a relational database

(relational theory) represent facts using different modeling construct
[18]. An ontology is defined using classes, individuals, axioms,
properties (object properties and data properties), datatypes, and
annotations. For more detail please refer to [8], [19].

Generating_Relational_Database.pdf

on the Mgt. of Data, Jnne 1986 [11] M.R. Stonebraker and et. al.,
303.
The POSTGRES Data Model, Proceedings of the 13th VLDB
Conference, Brighton 1987 [12] M.M. Zloof, Office-By-
 Example:A business language that unifies data and word
processing and electronic mail, IBM Systems Journal, VOL.

Database and Expert Systems Applications.pdf

304. Database programming languages Dre the lead ing point of two
independent trends. On one hand, the programming language
community has felt the need to manipulate bulk data, and to keep
them on secondary storage in a comfortable way. This have led to
the persistent programming languages field[6].

Database and Expert Systems Applications.pdf

While the degree of optimization attained is dependent on the nature

305.
of the rules and the query, very efficient strategies are found for a
wide range of queries, The effectiveness of the technique was
demonstrated on an example from a route planning application,
REFERENCES [1) R. Agrawal, p, Devanbu, " Moving selections into
linear least fixpoint queries", IEEE International Conference on Data
Engineering, 1988, (2) A, Aho, I. Ullman, " Universality of data
retrieval languages" , confer- ence on POPL,1979, (3) F, Banciihon et
al, " Magic sets and other strange ways to implement logic
programs", ACM International Symposium on PODS, 1986, [4] F.
Banciihon, R. Ramakrishnan, "An amateur's introduction to recur
sive query processing strategies", ACM SIGMOD Conference, 1986,
(5) C. Beeri, R. Ramakrishnan, "On the power of magic", ACM
interna tional symposium on PODS, 1987.

Database and Expert Systems Applications.pdf

The central data control unit will interrogate the network monitors at
306.
regular intervals or on special request. The data retrieved has to be
preprocessed into relevant information and stored in a local
Performance Database, or has to be delivered directly to the
requesting application.

Database and Expert Systems Applications.pdf

307. If sufficient data have been entered, the output op tions are manifold.
The program provides adjustable al phabetical order for special,
 language specific characters, it enables you to print either the
normalized forms of words and names or the words as they are
written in the source text, and it supplies the option of additional sort
ing according to dates etc. The typographic module can produce hard
copies for correction or files.

Database and Expert Systems Applications.pdf

308. The meta knowledge-base is used to describe the available

reasoning techniques and semantic, data constructs and to organize
the final application knowledge-base.

Database and Expert Systems Applications.pdf

309. The knowledge-bases KB_a, KB_b contain specific, organizational

knowled ge that pertain only to the enterprise being modelled.
Finally, the actual facts and organizational data of the enterprise are
contained in the KIr.. Data knowledge-base.

Database and Expert Systems Applications.pdf

310. The facts and rules stored in the meta-KB contain the names of all
the generic, organizational, and data mini-KBs available in the
educational application class. Furthermore the meta-KB contains the
facts and rules for merging and integrating the generic and specific
knowledge-bases.

Database and Expert Systems Applications.pdf

A cluster index is created when the objects are inserted and

311.
physically clustered on secondary storage. Defining the internal
secondary storage location of the objects. a deletion of the clustCl’
index involves a global reorganization of all data. Although not
explicitely excluded, this possibility will lead to a complete
reorganization of both the cluster index and the link table.

Database and Expert Systems Applications.pdf

However, many applications handling pictures, need to manipulate

312.
 this kind of data directly.

Database and Expert Systems Applications.pdf

[32] M. Zloof, " Office-By-Example: a business language that unifies

313.
data and word processing and electronic mail," IBM Research
Journal, Vol 21, No 3, 1982.

Database and Expert Systems Applications.pdf

220 To be able to understand natural language different items are

314.
needed. Firstly, we need a grammar for a subset of the English
language that defines the syntactic scope of our nat ural language
processing component. Then we need a parser for the Document
object content data or for the queries.

Database and Expert Systems Applications.pdf

315. That means that a specifically prepared and dedicated visual object
is presented within a predefined application step. This action is
completely driven by the content of a controlling application. Usually
there is nor object related structural data nor any contextUlJl
knowledge contained within the visual object itself.

Database and Expert Systems Applications.pdf

There are even reasons that might justify the parallel usage of
316.
various concepts. For example, a combined program-oriented and
declarative description might considerably increase application
flexibility and performance, but may contemporarily have a negative
impact on data consistency and redundancy.

Database and Expert Systems Applications.pdf

Let us assume that Delphi Expert is coupled with a KBMS instead of a

317.
DBS. Then up to now the knowledge hidden in the application
program will be stored explicitly in rules. In order 301 to derive data
by means of this knowledge the intensional query mechanism is
necessary.
 Database and Expert Systems Applications.pdf

Depending on the application this graph is ei ther viewed as nodes

318.
with component edges or, conversely, edges with components nodes.
Such data structures are describe in a OODBMS through object
references with an inversion constraint.

Database and Expert Systems Applications.pdf

F. Rabitti, A Model for Multimedia Documents in Office Au tomation,

319.
D. Tsichritzis (ed.), Springer-Verlag, 1985, ISBN, 3- 540-15129-X,
pp.227-250 J.W. Schmidt, Some high level language constructs for
data of type relation, ACM Trans. on Database Systems, Vol. 2, no.
3.
(Sept 1977),247-261.

Database and Expert Systems Applications.pdf

The second interface is used for the control of the dis tributor
320.
module, which in turn controls the input and the output data stream
from the activated application programs and the multimedia device
drivers which serve as the presen tation tools of the virtual meeting
room.

Database and Expert Systems Applications.pdf

These data structures have a wide range of appli cations, e. g. bill-of-

321.
material applications ( BOM).

Database and Expert Systems Applications.pdf

322. In the following, the specific effects on data modelling will be

examined. The thesis is that internationality affects the data
modelling process as well as the structure of the particular data
models.

Database and Expert Systems Applications.pdf

 To avoid the interpretation of SQL procedures for each data base
323.
access, the use of Stored Procedures, i. e. pre-<:ompiled SQL
procedures stored in the data dictionary, is extensively used in
ISACS. By simply passing parameters to procedures ready for
execution, performance is substantially enhanced.

Database and Expert Systems Applications.pdf

324. While planners provide some of the most advanced and de manding
applications for the mediator architecture, the ar chitecture also
supports ordinary application programs that retrieve distributed data
through mediators, e. g. to produce weekly production summary
reports.

Database and Expert Systems Applications.pdf

Informing applications that data views which the ap plication depends

325.
on have changed.

Database and Expert Systems Applications.pdf

Page 9 of 22Ben Mahria et al. J Big Data (2021) 8:25 Transformation

326.
of the check constraint As mentioned in [49], Check constraints are
conditions that validates the data in a table. In this work, we propose
a rule for transforming the CHECK constraint as data range restriction.

A novel approach for learning ontology from Relational db.pdf

Complete data consistency as each interviewer is guided by the

327.
script programmed into the survey application.

Labour market ASSESwcms.pdf

328. - Incorporates a File Transfer Protocol ( FTP) client, an application

that resides at each of the participating universities to automate data
transfer to the SAGE server.

Lecture Notes in Artificial Intelligence.pdf

 It is worth mentioning that applications of the latter kind are
329.
particularly attractive to many learners, because they prove – at least
implicitly – that the studies undertaken are based on the most recent
information and deal with truly practical data. It is important to pay
attention to such opportunities to motivate students [1,2,3,4].

Lecture Notes in Artificial Intelligence.pdf

330. g. data and event handling). A RIM determines semantics of data

objects. Decisions and eligibility criteria are specified by the object-
oriented expression language GELLO.

Lecture Notes in Artificial Intelligence.pdf

331. The integration of the ontology in XIMSA enables the patient to

control drug prescription regarding data contained in his SEHR which
is created and maintained within the web-based XIMSA interface.
The overall goal of the SEHR is to store health related information
concerning a particular patient. The formalism adopted for the SEHR
is the semistructured XML language.

Lecture Notes in Artificial Intelligence.pdf

332. Further on the technical level, CAKE has monitored the interactions
between IC and CAKE, therefore, the initial workflow is enhanced
with this request for chemical materials. Both the request and the
response are captured in the context application data of the IC’s
workflow instance. CAKE monitors this context for extracting critical

Lecture Notes in Artificial Intelligence.pdf

Bröckers, A., Lott, C.M., Rombach, H.D., Verlage, M.: MVP-L

333.
language report version 2 (1997) 13. Wodtke, D., Weißenfels, J.,
Weikum, G., Dittrich, A.K., Muth, P.: The mentor workbench for
enterprise-wide workflow management. In Peckham, J., ed.

Lecture Notes in Artificial Intelligence.pdf

 A negotiation of language barriers for interpreting textual data 4
334.
Introduction of the Papers The following pages contain some of the
papers, presented at the workshop. In con- trast to the papers of the
workshop proceedings, these new version will discuss the topics in
more details. They include the feedback and discussions of the
workshop as well as new content for completion.

Lecture Notes in Artificial Intelligence.pdf

Volume 2185 of Lecture Notes in Computer Science., Springer-

335.
Verlag (2003) 19–33 10. Hasselbring, W.: Web data integration for e-
commerce applications.

Lecture Notes in Artificial Intelligence.pdf

This language has a formally defined meaning and is an ontology

336.
lan- guage for the Semantic Web. OWL 2 ontologies (the latest
language version) provide classes, properties, individuals, and data
values and are stored as Semantic Web documents ( W3C 2023).

Ontology learning from relational database a review.pdf

2012) comment, owl-full typically is not fully complained with

337.
reasoning activity, and for this reason, an ontology modeled in OWL-
Full may be less useful than an OWL-DL Ontology in terms of
possible inference on the data.

Ontology learning from relational database a review.pdf

338. In database systems, the data provided is assumed to be relatively

univocal in that there is a relatively well agreed upon schema by
which this data is interpreted into information. The more one
progresses towards document systems (i. e. systems which provide
data access in the form of free-text) the more ambiguous and
equivocal the data becomes.

Database and Expert Systems Applications.pdf

 ISACS belongs to a class of computer based systems with very little
339.
proven experience from the point of view of how to use traditional
database technology. This is mainly due to the fact that in process
control environments where the demand for real-time response is
essential, home-made database solu tions have been used in almost
all situations. The reason for introducing a relational database in an
environment like ISACS, was the need for a flexible and modem tool
for han dling the heterogeneous types of data which are present in
the system.

Database and Expert Systems Applications.pdf

INEKS - an Information System for Medical Application Roland

340.
Zimmerling University of Oldenburg Computer Science Departtnent
P.O Box 2503 D-2900 Oldenburg Abstract This Paper describes the
development of the information system INEKS for the Stadtische
Kliniken Oldenburg. After building the database with the relational
database management system ORACLE and programming of the data
input-component by the ORACLE-tool SQL * Forms the main topic of
the development is the computer-aided, scientific evaluation of those
data sets for research into the area cancer epidemiology ( INEKS).
Both classical, conventional applications (office automation,
statistics) and tools will be developed for relating data pemanent
saved in databases to temporal values, so as the researcher involved
in medicine are able to verify their hypothesises.

Database and Expert Systems Applications.pdf

341. Re-engineering products are captured in the dictionaries of a CASE

tool (i. e., in the form of a business process decomposition hierarchy,
as-is data model, normalized logical data model, and linkages among
data objects) and are supplemented with traceability matrices in
spreadsheets. The re-engineered data products are used as follows:
(1) migration of the legacy databases to relational database
management systems, (2) automatically generation of databases and
applications for migration from mainframes to client-server, (3)
enterprise data standardization, (4) integration of disparate
information systems, (5) re-documentation, (6) data quality
assessment and assurance, and (7) baseline specifications for future
systems.
 A Requirement-Based Approach to Data Modeling and Re-
engineering.PDF

Since our data model is mapped into nested relations, most class
342.
operators match nested relational model operator definitions.
However, we have studied set operators with more attention,
especially in situations where the participating classes do not have
the same schema. Recently, this aspect of class creation by set
operations has been analyzed by [ RU90).

Database and Expert Systems Applications.pdf

The reviewed method of the graph representation can be used when

343.
developing information systems with a distributed architecture, in
which one of the relational systems for the database management is
responsible for the data storage.

Graph to RDBMS.pdf

344. Similarities and differences in the data model of 02 (V I) and of

KEETM are shown in the table below.

Database and Expert Systems Applications.pdf

Hypotheses (assumption) are treated into different contexts. The

345.
contexts are organized into a hierarchy, the root of which is the
database. An A TMS is used to maintain the consistency of the
contexts in the tree and of data inside a context.

Database and Expert Systems Applications.pdf

346. The data is supplied by the Polytechnic Central Admission System (

PCAS) and includes the applicants qualifications and references. The
database could be updated to include all information for courses
which award BTEC qualifications.

Database and Expert Systems Applications.pdf

 We have adopted the same terminology as in [ RU90) and according
347.
to our data model, we have been able to obtain alternate definitions
of set operators. This has helped us analyze how inheritance and
object sharing are preserved after set operator application. Finally,
we have made a few

Database and Expert Systems Applications.pdf

348. In this case, a bug report and a test data are selected and sent to the
person who has been already assigned. As shown in the example,
document transmission flow can be easily specified (and modified)
because it is managed in the database.

Database and Expert Systems Applications.pdf

Up to now, we only have presented the definition of data types in

349.
Serendip. The notion of view provides the connection with the
database.

Database and Expert Systems Applications.pdf

while TRUE do begin read message; if "broadcast message" then{ it

350.
contains all database statements and predicate names} repare all
database operations else { message: ( predicate: Q, tuple: t) } for
each rule with pred. Q in the rule body do begin open cursor C for
according SELECT using t; fetch C; build new tuple tJ\new; determine
head predicate P; while NOT end-of-cursor do begin INSERT INTO P
VALUES ( tJ\new); if NOT duplicate-error then Define_ Task ( P,
tJ\new ); fetch C; build new tuple tJ\new; end end {for/else} end;
(while) Fig. 4: Server for the data parallel computation From a non-
linear rule we generate N database operations if there are N clique
predicates in the rule body.

Database and Expert Systems Applications.pdf

351. This typing strategy has its roots in the programming language LISP;
one representative data model adhering to thiS’ is FAD [2].

Database and Expert Systems Applications.pdf

 The coupling of Babylon and the FGD-Interface (fig. 3) is now being
352.
developed. On the database side another data source managed by
the DASDBS Geokernel [11, 12] is under realisation.

Database and Expert Systems Applications.pdf

The next section describes this conceptual view of the data. We then
353.
outline the architecture of the database in terface and its actual
implementation. Some performance results are provided and we also
give an overview of the cur rent and future developments.

Database and Expert Systems Applications.pdf

Only one option during the call indicates to a slave that it is dealing
354.
with the database interface, and the only additional action from the
slave will be to add a special character to the output when all the
data from one request has been transmitted. ThiR character signifies
the end of the transmission to the master module. Upon call, the
slave module will load one file of data into real memory.

Database and Expert Systems Applications.pdf

These elements (i. e., classes and instances) could, but do not have
355.
to refer to database tables and rows; at the beginning of the building
up process they refer to those elements. Initially all places are empty,
only the transition prepare global data dictionary can be fired.

Database and Expert Systems Applications.pdf

356. A significant difference with previous domains is that the databases in

astronomy have a tendency to accumulate information. Raw data
obtained from observations is calibrated, summarized, and in
terpreted in scientific reports. Integration of all this information within
the database is necessary to supports the researcher.

Database and Expert Systems Applications.pdf

Another complicating aspect is the querying mode encountered in

357.
scientific databases. A researcher often can not identify the data of
 interest with a single request. Instead, he will browse the database
by posing approximate or classification queries until the portion of
interest is located; the working more is browsing and data dredging
within the context of a general classification framework.

Database and Expert Systems Applications.pdf

We believe that the proposed database organiza tion has built-in

358.
multilevel secure capabilities. Phys ical fragments can be classified
according to the sen sitivity of the contained data by different labels
of classification. By obtaining the fragment accessed by less users,
the most sensitive area of the database can be determined.

Database and Expert Systems Applications.pdf

386 ation (becauee they do not have data relevant for that operation)
359.
can proce&ll another database operation.

Database and Expert Systems Applications.pdf

360. IT the total number of versions of all data items is K, then overwrite
the "oldest" version stored in the database.

Database and Expert Systems Applications.pdf

id (A particular node, as specified at some higher level) this_data

361.
(The data associated with this. node) history jist (A list of previously
visited nodes) all... nodes (All nodes in the database) The functions
are: node...lc:ind(nodejist, kind) _ nodejist (from nodejist,
extract nodes of a particular kind) link...lc:ind(linUist, kind)
- linkjist (from linkJist, extract links of a particular kind)
links1rom(nodejist) _ linkjist (from nodeJist, extrac: .

Database and Expert Systems Applications.pdf

The purpose is that not only data stored in the databases shoulo
362.
reflect specific needs within an organization but also that the
interfaces should be customized in an easy manner to reflect
different user requirements and to provide a virtual memory to the
 user. Information is produced from data stored in the database
containing raw data, i. e the standardized default values.

Database and Expert Systems Applications.pdf

363. For the molecular biology, the major benefit is that data which was
difficult to store in databases can now be stored. It is also easy to
retrieve whatever data we want when we use QUIXOTE. It is powerful
in knowledge description and enables us to retrieve complex data by
means of the deductive mechanism.

Database and Expert Systems Applications.pdf

Specific SYBASE facilities for making high speed copying of bulks of

364.
data into the database is also being used to enhance performance
further.

Database and Expert Systems Applications.pdf

Mter generating the transfer file by MUMPS the data are read by a
365.
progrllIl\ written in PRO*C and inserted into the INEKS database.

Database and Expert Systems Applications.pdf

366. this language shell encapsulates information about locatio,) and

access mechanisms for all data.

Database and Expert Systems Applications.pdf

This emphasizes the need for a hybrid approach: “convert the

367.
content into database tables for data mining, but store the original
CDA document as well”.

Lecture Notes in Artificial Intelligence.pdf

A key element of the all of the gathered data — TaskTracer database

368.
records, Internet Explorer’s history data, and the TaskExplorer
database — is that every item is time-stamped with the client
computer’s clock. Thus, we can weave together a complete, ordered
 sequence of items. Moreover, in addition to the TaskTracer and
browser history data, we also have the work produced by the test
participants.

Lecture Notes in Artificial Intelligence.pdf

The World Wide Web, the largest database on earth, holds a huge
369.
amount of relevant information. Unfortunately, this data exists in
formats intended for human users.

Lecture Notes in Artificial Intelligence.pdf

In this business case, the Lixto Software was integrated in the Pirelli
370.
BI infrastructure in 2003 within a timeframe of two months. Tire
pricing information of more than 50 brands and many dozens of tires
selling Web sites are now constantly monitored with Lixto ( Pirelli
prices and competitor prices). The data is normalized in the Lixto
Transformation Server and then delivered to an Oracle 9 database.

Lecture Notes in Artificial Intelligence.pdf

371. After activating the PirelliTireMonitor service in the Transformation

Server, the Oracle 9 database is incessantly supplied with new data.

Lecture Notes in Artificial Intelligence.pdf

6 depicts the resulting decision table for the Bene1 data set. Clearly,
372.
the top-down readability of such a DT, combined with its conciseness,
makes it a very attractive visual representation.

Lecture Notes in Artificial Intelligence.pdf

Fig. 4. Overall Architecture As central database we have a HR-Data

373.
Warehouse. In this HR-DW most of the HR- data from legacy-
systems is integrated in one place.

Lecture Notes in Artificial Intelligence.pdf

 Methods that make a translation of meta-data and an import of the
374.
data in the database, producing OWL Con- cepts, Properties, and
Instances.

Ontology learning from relational database a review.pdf

Abstract The widespread use of relational Database Management

375.
Systems ( DBMS) has meant an increase in. the number of application
databases. Having to cope With such a large amount of data
especially when used in decision making systems leads to a number
of problems. The introduction of Expert Systems ( ES) has enabled
us to apply the domain knowledge of experts to stored data, perhaps
already existing in a Database ( DB).

Database and Expert Systems Applications.pdf

However, given the fact that the majority of current Web data sources
376.
are powered by RDBs, our approach can be widely applied in
ontology development of Semantic Web applications whose
underlying data sources are modeled in the relational model and thus
can act as a gap- bridge between existing Web data sources and the
Semantic Web. For instance, using our approach, an ontology
extracted from the underlying RDB of a deep web site can be
employed to annotate the dynamic web pages generated by the web
site. This kind of applications, so-called “deep annotation”, has been
addressed in [33].

OWL Ontology Extraction from Relational.pdf

377. Scenario 1 is to upgrade the current policy for calculation of pay and
the lower level system implementation for current needs by migrating
the models; we have cross-finctional integration between the existing
data base to a relational data base by creating new personnel
system representing personnel functions, and physical components
from the as-is normalized data the payroll system representing pay
functions; we have model. inrra-system integration within each
migration system Scenario 2 is to expand system functionality. We
would model as it relates to tbe calculation of pay that is part of frost
modify the as-is normalized data model into the to-be the re-
engineering effort that prepares it for integration; normalized data
model by capturing new business and finally we have inter-system
 integration since we need requirements. In addition, we integrate
strategic, tactical, to resolve data conflict between the two re-
engineered and operational level data models with the re-engineered
data models representing the data requirements of the two “as-is
normalized data model”.

A Requirement-Based Approach to Data Modeling and Re-

engineering.PDF

We use the concept of a frame as the packaged structure which is

378.
used to organize and retrieve knowledge in the knowledge-base and
assist the reasoning process. The concept of frame used in the
knowledge base is equivalent to that of object in the object Typet i,k
Related Type tj,n Semantic Relationship S Constraint 1 Assertion
Resolution Figure 2: Frame-The Structure of The Knowledge Base
model which underlies the disparate information sources in the
distributed environment. We introduce this sharp distinction for
reasons of clarity as frames are used to capture and convey meta-
knowledge deployed for the purpose of schema analysis and
integration, whereas objects stored in the object-base are used to
reflect data and knowledge regarding modeled domain entities, see
Figure 2.

Database and Expert Systems Applications.pdf

As for table Ti, the set of all tuples on it can be showed as tupler( Ti);
379.
A referred to a finite set of column name, aj( Ti) was the column
name of column j in Ti ; D stood for the name set of a Data Type, and
each of the data type name was the type-name predefined by DBMS,
such as integer; DOM represented the mapping of the specific column
aj( Ti) to its data range(data type), namely, a nonblank column set A(
Ti) existed for each table name Ti∈T, and each column a( Ti. )∈A( Ti)
had a relational predefined data type datatype(a( Ti))∈D as its data
range; PK was primary key constraint: T had one and only one
primary key pkey(T) solely determined each line of instance data in T,
moreover, it can be pkey(T) A(T) (be called single primary key that
just entity table can have and only have), or be pkey(T) A(T)(be
called composite primary key that only association table can have
and only have); FK presented foreign key constraint. : T may have
foreign key fkey(T,R) of 0~n (n≥l) that quoting R single primary key of
other tables, which should satisfy: fkey(T,R)∈A(T), dom(fkey(T,R))
 dom(pkey(R))∪{null}, pkey(R)∈A(R), In which, dom (*) meant the
range of “*”;

An Improved Ontology Learning Algorithm from Relational Schema.pdf

380. The direct mapping to relational terms would be too far away from
the user's resp. application's view. More adequate formal description
methods are offered by data models currently developed in the
context of object oriented database systems (c. f. [19], [20], [21],
[22]). The general definition of object oriented database systems and
their characteristics (e.

Database and Expert Systems Applications.pdf

381. CONCLUSIONS AND FUTURE WORKS In this paper we have presented

experiences with building SUPER, a comprehensive database user
environment using the ERC+ data model. SUPER is intended to be a
semantical front-end environment to existing relational or object-
oriented database systems. It is based on the direct manipulation of
objects and functio,ns.

Database and Expert Systems Applications.pdf

382. 1 Introduction The demand for using database systems in application

areas such as graphics and image processing, computer aided
design ( CAD) as well as geography and cartography is considcmbly
increasing. The important characteristic of these applications is the
occurance of spatial objects. The management of spatial objects
imposes stringent new requirements on soca11ed spatial database
systems.

Database and Expert Systems Applications.pdf

383. Database design based on views is not limited to the relational data
model; it can be suitably applied to any data model which supports
the concept of a view. This methodology can be uniformly applied for
designing centralized databases and fragmenta tion scheme for
distributed databases. This model has builtin authorization
mechanism as the user ac cessing the database is limited to the part
of the database spanned by the views he/she accesses.
 Database and Expert Systems Applications.pdf

The combination of data retrieval and information retrieval requires

384.
the formulation of queries consisting of both precise and imprecise
query components. We have designed our hypermedia information
system to deal with such queries in an integrated manner. We
decided to take a unified approach when extending a database query
language so that it can also handle imprecise search criteria.

Database and Expert Systems Applications.pdf

1 Introduction New concepts of database management systems (

385.
DBMS) are anxiously awaited in molecular biology. DBMS are used for
stor ing and statistically analyzing data, both of which play important
roles in molecular biological research. When we treat molecular
biological data, we find that the traditional relational database model
is not suitable for representing them.

Database and Expert Systems Applications.pdf

Secondly, we have to construct a knowledge base which has var ious

386.
knowledge items supplementary to them, so that semantic
mismatches would be reduced. For example, if a certain attribute had
its own rule to access data, or another table which explains
meanings of its values, they act as knowledge to make its seman tics
clear.

Database and Expert Systems Applications.pdf

Thus developing approaches and tools for extracting OWL ontologies

387.
from RDB is helpful in bridging the gap between the existing Web
data sources and the Semantic Web. This paper proposes a formal
approach to automatic extraction of OWL ontologies from RDB using
database reverse engineering ( DBRE) technologies. The DBRE-
based approach first identifies different relational structures to
capture the natural domain semantics hidden in the relational
schemas and data.

OWL Ontology Extraction from Relational.pdf

 The recommendation of the ES is given and then stored. At the end
388.
of a session the data entered by the user is saved along with the
recommendation. The independent module updates the applicants
relational tuple accordingly.

Database and Expert Systems Applications.pdf

structures, but also for definiug UI schema and transmission control

389.
data.

Database and Expert Systems Applications.pdf

Mapping Language In this section, we show a BNF grammar for the

390.
major constructs of the mapping language for writing data conversion
scripts, and we then explain the semantics of those constructs. In
describing the grammar, we use the following conventions.

Database and Expert Systems Applications.pdf

[10]), can access the needed DIGMAP data via the database
391.
correctly.

Database and Expert Systems Applications.pdf

The next phase is concerned with the implementation of the deposit

392.
data: geological infonnations, seams, qUality parameters and so on.
Integration of the CAD-system TEKTODRAFf, programs for
calculating the pressure of strata, and numerical applications like
calculation of coal reserves are going on. Furthermore a substantial
Part of the future work is devoted to integrity checks, verification and
practical tests at a mine.

Database and Expert Systems Applications.pdf

Hence, instead of natural language descrip tion, we use captions to

393.
describe multimedia data. Captions are a natural but special, stylized
way of writing descrip tions with a subset of natural language and not
as difficult to parse and interpret as general natural language.
 Database and Expert Systems Applications.pdf

3.3 Scientific data In contrast to relational DBMS that can handle only
394.
a fe," data types required for business and administration data, EIS
should be able to manage a diversity of data typps that occur in
scientific data, e. g. spatial data, temporal data and statis tical data.
For these kinds of data, appropriate data types, operators and
predicates have to be supported by the DBMS.

Database and Expert Systems Applications.pdf

This paper is organized as follow: in Section 2, we expose the

395.
problem that we want to solve, so we define the chosen data
structure, we precise its characteristics, and we describe the data file
organization. The fuzzy search operation is analyzed in Section 3. In
Section 4, we suggest a parallel processing to manipulate data, then
we conclude in Section 5.

Database and Expert Systems Applications.pdf

We have suggested a parallel processing for the fuzzy search using

396.
this data structure. In a forthcoming work, we will study the behavior
of this structure using parallel processing.

Database and Expert Systems Applications.pdf

Introduction In the mass of papers which appeared in the last years

397.
on the topic of deductive processing, the need for parallel al gorithms
is generally acknowledged, as response times are often
unacceptable. A lot of energy was put in the area of parallel
deductive languages, but the parallel access of data in a deductive
database is only rarely considered.

Database and Expert Systems Applications.pdf

308 Table 2: Database performance breakdown (times are in ms for

398.
an HP 9000/380-7 mips workstation) Loading time Memory
requirements Compressed data size Fetch through DB cache hit
cache miss Direct fetch cache hit cache miss I Modules I OBS-DB I
SON-DB I GRl-DB 311 121 560 1080Kb 460Kb 800Kb 422Kb 51Kb
 637Kb 9.3 9.3 nla 11.7 20.4 20.5 0.5 1.4 nla 0.6 13.0 15
approximately 1s. This includes all SA's, wind and temper ature
soundings, and 6 variables at 9 levels over a grid of 25 X 25 from the
RFE numerical model. This constitutes ap proximately 250 000
individual records.

Database and Expert Systems Applications.pdf

399. ion algorithnm proposed in the liter ature for homogeneous DDBMS,
decompose a «uery int. o a sequence of basic relational oper ations,
such as selui-joins, and data moves.

Database and Expert Systems Applications.pdf

400. Comparison With the Object-Oriented Manifesto [21 An object-

oriented database always consists of a database and an object-
oriented data model [5]. In our case the database is ORACLE and the
data model we implemented in C+ +.

Database and Expert Systems Applications.pdf

401. Relational Database Organization Based on Views and Fragments

Gunther Pernul* Kamalakar Karlapalem Shamkant B. Navathe
College Of Computing Georgia Institute Of Technology Atlanta
GA30332 e-mail: [email protected] Abstract Traditionally
data is organized at the logical level in relational databases on the
basis of its semantics. But there are more abstractions of the real
world to be represented. A part of this missing semantics is that of
views.

Database and Expert Systems Applications.pdf

402. 6.1 Secure Databases Two different concepts of security modeling of

database information are discussed in the literature: (1).
Discretionary access control is controlling the access from users to
data by granting access privi leges. The granting of privileges is
under the discre tion of the users themselves.

Database and Expert Systems Applications.pdf

 Introduction Recently, several authors in the area of database
403.
concurrency control have pointed out that, by maintaining multiple
versions of data items, we can achieve concurrency control
algorithms of enhanced performance [1,2,7,9,10,11,13,14,15,16,17].
Multiple versions of data items increase the degree of concurrency
because they significantly reduce the contention of transactions
during their concurrent access to the database. The higher degree of
concurrency results since out-of-order read-only transactions can be
serviced by reading appropriate older versions of data items.

Database and Expert Systems Applications.pdf

In order to represent the database the user makes use of a par tially
404.
ordered, connected, direct and acyclic oriented graph model, the
GRASS[7] graph. This graph is made up of the following node types: -
S nodes: identify the statistical phenomenon associated with the ST. -
T nodes: identify the ST of the databases and the relevant data type.

Database and Expert Systems Applications.pdf

405. I also introduced a DOOD language QUIXOTe, designed at ICOT:’

Its great expressive power allows facts to be described in so many
ways, that we are discussing a standard format for description.
QUIXOTe is suitable for describing data and knowl edge which could
not be described before, and enables us to use them through
programs.

Database and Expert Systems Applications.pdf

406. 4.2 Accessing Single Nodes To get the starting point for the tree
operations, a function to find any article node, is provided:
bp_sel_node 4.3 Tree Operations To search in structure data,the
following functions are defined: - bp sel top down one level (use-
what) For ~ne entry node all subordinate nodes of the next lower
level are found.

Database and Expert Systems Applications.pdf

407. Integrators are meditators which, using schema inte gration and data
conversion facilities [10], integrate heterogeneous data
 representations to be presented uni formly to other mediators.

Database and Expert Systems Applications.pdf

Hence, spreadviews are not merely a spreadsheet like interface for

408.
relational data bases in that they allows data manipulation also at the
presentation level. If, furthermore, spreadviews are also programmed
in the spreadsheet style, as it will be discussed in section 4, the
system presents the characteristics which are summarized below.

Database and Expert Systems Applications.pdf

Access to all views is granted by the database administrator. Users

409.
can access the data from a ter minal network. Updating and and data
manage ment .

Database and Expert Systems Applications.pdf

410. me c tdiagnose Figure 2: lNEKS schema After-care (nachsorge):

Under this entity set infonnation concerning the after-care dates and
examinations of the patient are combined, e. g. start of after-care and
after-care results.

Database and Expert Systems Applications.pdf

The permeability between the DB system and DB-external

411.
administration component should be fulfilled in that views from the DB
could be transformed into the DB-external data structures (update?,
consistency?), and vice versa, stabilized, permanently interesting
DB-external data could be adopted into the DB by adjustment of the
schema.

Database and Expert Systems Applications.pdf

Therefore, it is necessary to build a vocabulary of these terms for

412.
simplifying the development phase. The Development does not only
include the data and schema acquisition, but provides also the phase
for integrating these two components. The post-development
 encompasses several other tasks such as alignment, merging and
integration, etc.

A novel approach for learning ontology from Relational db.pdf

413. In order to have comparable results to the Gulf, the data collection
tools used for Ethiopia and the Gulf countries were similar, apart from
the different sectors included. Hence, sector- specific questions were
incorporated into the overall questionnaire structure.

Labour market ASSESwcms.pdf

Therefore, powerful and user-friendly tools for extracting and

414.
integrating information from various different Web sources, or in
general, various heterogeneous semi-structured data sources are
needed. In this paper we describe a solution how data from public
information sources, in particular from the World Wide Web, can be
retrieved and normalized to structured data formats automatically.
We also illustrate how this data can be automatically integrated
afterwards in – often complex – Web Intelligence applications.

Lecture Notes in Artificial Intelligence.pdf

415. Transcription of interviews (in Amharic language) and field notes

were mainly used in capturing data for this research. Unfortunately,
only in a few (3 out of 15) incidences recording were possible. Most
of the participants refused to be recorded on tape.

Unemployment Experience of Youth in .pdf

416. [23] S. Auer, S. Dietzold, J. Lehmann, S. Hellmann, and D.

Aumueller, “ Triplify: light-weight linked data publication from
relational databases,” in Proc. of the 18th Int’l Conf. on World Wide
Web, J. Quemada, G. León, and Y. S. Maarek, et al., Eds., New
York: ACM, pp. 621–630, 2009.

OWL Ontology Extraction from Relational.pdf

Several alternatives can be explored, including: (i) extending

417.
(privately or locally) general purpose resources, such as WordNet or
 schema. org, towards specific domain knowledge, (ii) sharing the
recovered knowledge (publicly) as linked open data.

Ontology matching state of the art and futur.pdf

418. [18] R. Fagin, L. M. Haas, M. A. Hernández, R. J. Miller, L. Popa,

and Y. Velegrakis, “ Clio: Schema mapping creation and data
exchange,” in Conceptual Modeling: Foundations and Applica- tions.
Springer, 2009, pp. 198–236.

Ontology matching state of the art and futur.pdf

[126] A. Doan, P. Domingos, and A. Halevy, “ Reconciling schemas

419.
of disparate data sources: A machine-learning approach,” in Proc.
20th International Conference on Management of Data ( SIGMOD),
2001, pp. 509–520.

Ontology matching state of the art and futur.pdf

Object-oriented languages implement some of the most prominent

420.
features (for example inheritance and object identity) that can be
found in most semalltic data models (see [11]), and these semantic
data models are a basis for the design of database system
applications.

Database and Expert Systems Applications.pdf

421. 1 Introduction The well known form notion is traditionally used to

build screens and to describe some database user dialog in order to
access and update data [27], [30], [23]. Most of 4th Generation
Languages offer a form concept [11] but the approach is rather
artificial be cause of the use of SQL as a programming language.
Further, in office automation, the form notion has been used to
increase the database system capabilities with some specific tools
such as word processing, editors, electronic mail, and office
procedure automatization [31], [32], [14], [29], [7], [13], [20].

Database and Expert Systems Applications.pdf

 Incremental Queries Given a LOCO knowledge base consisting of a
422.
set of object tenns as described above. we obviously would want to
retrieve infonnation from it with minimal human effort. Unlike data
objects which are stored in the permanent database. queries are
processed interactively during a work session. As such, it is difficult to
build a system that supports a generalized query reuse scheme. nor
is it easy to define a query procedure in one session and use it in
another. or to combine queries.

Database and Expert Systems Applications.pdf

423. The use of instances together with op erations is redundant from a

programming point of view in the same way as properties and opera
tions are in an abstract data type definition. The Serendip language
provides the designer with both notions because they correspond to
two different design choices. As for properties, we shall see in the
following subsection that instances can be stored or computed from
other elements.

Database and Expert Systems Applications.pdf

Fig. 2-4 shows the data structure (structured view) used by program
424.
presim for the logic simulation of the circuit. The current presim
program using a file system uses about 22 pages of programming
statements to construct this structured view.

Database and Expert Systems Applications.pdf

user appI"-",,,,~ ~-,,;:’-D ~ _ j _ -t -r qu'ri~ DB i_ ctJ""y : application : :

425.
db : ~~~ . -.., Figure 1: The architecture of DB day of data. Spawning
that process in effect loads the data from disk to the computer's main
memory.

Database and Expert Systems Applications.pdf

 ranslations. The proh lelll of data mod~l translation ha" hePII dis
426.
cussed in [ FS~L] and practical solutioH" arp available in t. he form of
relational ’I",’ry in terfacf's to Inajor (’ oIl11l1el'cia.

Database and Expert Systems Applications.pdf

The semantics of the data is regained, at least partially, by the user

427.
interpretation and/or high level application programs.

Database and Expert Systems Applications.pdf

428. In order to op timize the execution of the database operations, data

partitioning plays an important role.

Database and Expert Systems Applications.pdf

388 A database DB is a finite collection of data items denoted x,y,z,

429.
.... Each data item x E DB is a sequence of versions storing its
consecutive values denoted X~I’ x;" ... , X~g’ where the sup~script is
the index of the version and the subscript is the index of the
transaction that creat~d it.

Database and Expert Systems Applications.pdf

We assume four types of database operations: a read operation r( x),

430.
a write operation w(x), a commit operation c, and an abort operation
a. A read operation r( x) returns the value of a version of a data item
x. A write operation w(x) creates a new version of a data item x.

Database and Expert Systems Applications.pdf

A safe contin uation of an active transaction Tk of a MV schedule

431.
mvs( T) is a such continuation of Tk, that read operations of Tk are
never re jected due to unavailability of data item versions. A
continuation of a MV schedule mvs( T) is a sequence of database
operations of active transactions of mvs(T) and possibly some new
trans actions. A continuation of a MV schedule mvs( T) contains all
continuations of its active transactions.
 Database and Expert Systems Applications.pdf

nllt. t - NOoCtlt:tl fig. 4; data base query interface Vi, !.’

432.

Database and Expert Systems Applications.pdf

1 Introduction Future computing environments will have large

433.
numbers of workstations connected via communication networks.
Work stations will have powerful computation capabilities; server
stations store, maintain, and do inferences over local data and
knowledge-bases, or information bases. Each informa tion base is
maintained locally by human experts and is likely to be autonomous
from other information bases.

Database and Expert Systems Applications.pdf

434. Both administrative and medical data for each patient are recorded
on the encounter report with a definite structure and format. An
encounter report is completed not only for each patient in the clinical
department, but also for emergency department visits. The encounter
report compiled by physician contains requests about tasks to be
performed by various clinical departments as laboratory tests,
physical examination etc ..

Database and Expert Systems Applications.pdf

Computer assistance in epidemiological cancer research attains a

435.
new quality only at the point when the data permanently stored in the
INEKS database can be temporarily set in relation to hypothetical
values. Assumptions of the doctors can thus be verified on the basis
of the extensive stored data material and possibly gain relevance to a
degree that justifies an extension of the database.

Database and Expert Systems Applications.pdf

If the store had so-called print-on-demand facilities they could

436.
download the content and print out the book in a matter of minutes. A
similar concept is very common in some music stores. Customers
 can chose song titles out of a large data base and get them burnt on
a CD immediately.

The_Business_Model_Ontology_a_propositio.pdf

437. Thus, it cannot be easily processed by computer programs.

Advanced data extraction and information integration techniques are
required to process Web data automatically. Increasing demand for
such data leads to the question of how this information can be
extracted, transformed to a semantically useful structure, and
integrated with a “ Web-ETL” process into a Business Intelligence
system using Web Intelligence.

Lecture Notes in Artificial Intelligence.pdf

Algorithms are always designed to work with a specific data

438.
structure, and the choice of the way to represent the data
significantly affects the methods of the data processing and the
effectiveness of these methods.

Graph to RDBMS.pdf

A variety of tools [24] use different mapping mechanisms and

439.
languages, making it difficult to share and reuse the mappings.
Therefore, the W3C has recently standardized the RDB-to-RDF
mapping mechanism and language, namely Direct Mapping [25] and
R2RML [26]. All existing mapping approaches/tools generate RDF
data expressed as instances of target RDFS/ OWL ontologies.

OWL Ontology Extraction from Relational.pdf

2 Hierarchy Translation into Nested Relations 2.1 Nested Relations In

440.
the past years much attention has been paid to structured relations.
The deficiencies of the relational model for supporting complex object
applications are well documented. This has lead to the development
of more general data models, in particular the nested relational data
model that generalizes the flat relational model by allowing relation
valued attributes.

Database and Expert Systems Applications.pdf

 32 considerations on the meaning of other nested relational
441.
operators in our approach of classes. Currently. we are applying the
data model defined in this paper to the Qffice 1L0cument Architecture
( ODA) hierarchical data structures. ODA [ OD88] is a ISO standard
model for office document structure and processing.

Database and Expert Systems Applications.pdf

442. 3.2 Heterogeneous data structures In contrast to classical data

models like the hierarchical, tbe network and the relational model,
OODRMS are no long~r bMed on the Msumption of a uniform structure
of the data to be maJ\llged by the system. Objects with identical
structure form object classes, which in turn are elements of an inheri
tance hierarchy. Due to the inheritance mechanism, a certain clMS
inh~rit8 the ~I~ments of the internal structme as well as the operators
applicable to ohj~cts of this c1f1AS from its super class.

Database and Expert Systems Applications.pdf

1007/ 978-3- 540- 92673-3_ 11 Codd EF (1970) A relational model of

443.
data for large shared data banks. Commun ACM 13(6):377–387.
https:// doi. org/ 10. 1145/
362384. 362685 Dadjoo M, Kheirkhah E (2015) An approach for
transforming of relational databases to owl ontology.

Ontology learning from relational database a review.pdf

The experimental results indicate that: (1) the total time complexity of
444.
our ontology extraction approach, including the table-type
identification algorithm TabTypeIdentification and the schema
translation Algorithm TabTypeIdentification ( D ) Input: A relational
database D including its schema ( ), , , ,S = N attr DT pk fk and
instance data. Output: All table types identified. Tables ET RT← ∪ ;
assign false to all auxiliary predicates; while Tables ≠ ∅ do { Get a
table T ET RT∈ ∪ ; { } TTables Tables← − ; if T has no foreign key
and one primary key then { ( ) normEntityTab T true← ; continue}; if T
has exactly one foreign key 1( )fk T and one primary key ( )pk T such
that 1( ) ( )fk T pk T⊂ then { ( ) weakEntityTab T true← ; continue}; if
T has exactly two foreign keys 1 2( ), ( )fk T fk T and one primary key
( )pk T such that .
 OWL Ontology Extraction from Relational.pdf

We now describe the data structure used by the pointers for each
445.
kind of relationship.

Database and Expert Systems Applications.pdf

446. A CLIPS demonstration application, ’ TRACE’, using some system

features has been implemented. This application produces several
requests to the monitor system and performs some simple
interpretation of the retrieved data. Picture 6 gives a sample screen
of this application.

Database and Expert Systems Applications.pdf

When the query processor receives a query the first task is to

447.
decompose the query into subqueries affecting only conventional or
media part. The conventional subquery is passed to the conventional
data manager without modifica tions. For the text description, the
query processor calls the natural language parser to obtain the
equivalent query pred icates.

Database and Expert Systems Applications.pdf

e. that reflects the structure of the source data. Essentially, the

448.
Datamap tool described allows the maintenance engineer to navigate
round the intermediate representation to identify suspect RuIes. This
is achieved using two directed biparteid graphs which graphically
display the connections between elements within individual Rules
and the connections between the Rules themselves.

Database and Expert Systems Applications.pdf

Indeed, the use of any data structure that process grid representation
449.
of spatial data, generates an image space where each inserted
image is coded and linked to a speci fic structure. Inserting 2 images
using quadtree structure, gene rates 2 quadtrees. So, each image
has its own set of prefixes, and the searched pattern also has its
proper set.
 Database and Expert Systems Applications.pdf

Supporting User In1~ra(:tions with OODn's: A Declarative Approach:

450.
F. Staes Origin/fechnology Support HCM-524 NL - 5611 CA Eindhoven
The Netherlands Abstract L. Tarantino University of L’ Aquila Dipt. di
Ing. Elettrica Poggio di Roio I - 6704 L’ Aquila Italy In this paper we
discuss the graphical interaction environment to the object-oriented
knowledge base sysiem KIWIS. This environment provides both
customizable views on the data and several interaction paradigms
with different complexity.

Database and Expert Systems Applications.pdf

451. A meta variable in a type hides part of structural detail in the subtype.
Through the instantiation of meta variable, a type hierarchy is built
up, with its root being the most abstract data type, and all the leaf
types being detailed structures. The types between the root node and
leaf nodes expose the hidden structure to a certain degree.

Database and Expert Systems Applications.pdf

In this scenario visual data objects and positionally dependent textual

452.
objects are mapped from a visual database to a specific VUI. The
process of mapping visual objects involves different conceptual
steps: In a first step it is a pure logical operation to retrieve the
relevant basic image, the related graphics and annotation texts from
the database. In a second step, logical and physical aspects must be
considered.

Database and Expert Systems Applications.pdf

453. 266 database. Most of the structural knowledge is bound to

dedicated program code and has primarily no external appearance.
The database mainly contains the visual objects and some, related
secondary data.

Database and Expert Systems Applications.pdf

1 Introduction The monitoring and diagnosis of failures in complex

454.
real-time engineering devices, such as robots or process control
 systems, is an important application area for knowledge-based ( KB)
systems. These devices typically require constant supervision and
are often situated in re mote or hazardous locations. A device is
usually moni tored by a set of sensors which continually produce
streams of data indicating the states of the various com ponents of
that device.

Database and Expert Systems Applications.pdf

Diagnosis of a fault requires data about one or more components of

455.
the device and a general knowledge of the structure and the
expected behaviour of the device. Two types of data are used in the
diagnosis: sensor data, which describes the state of the device, and
engineering data, which describes properties of the components
such as maintenance schedules and reliability projections. The
sensor data used in the diagnosis may be both current and historical.

Database and Expert Systems Applications.pdf

This definition can be a simple binding with a variable from another

456.
source, or a complex computation involving mathematical and log
ical operations with several variables from different sources. Thus the
exact definition of a variable could vary with the time or the exact
location. The user defines the variables through a set of commands
to DB, which incorporate a small high level language having the
capability to manipulate the meteorological data by identifying only
the conceptual data structures.

Database and Expert Systems Applications.pdf

Additionally, there are many techniques such as peculiar file

457.
management or a high-speed retrieval mechanism in various
commercialized OODBs. In this OMS fundamental mechanism, there
is a special speed-up mechanism for retrieving a partial hierarchical
structure, by treating the objects’ tree structure as the first order
structural cache and applying the B-tree index mechanism to
thetrll21.

Database and Expert Systems Applications.pdf

 The requirements posed by this area on a DBPL can be sum-
458.
marized as follows: It should support heterogeneous data structures,
it should support a general general reference mechanism, it should
support (declarative) aggregation of objects, and it should support
querying the database both by physical aggre gation and by
predicates over individual document properties.

Database and Expert Systems Applications.pdf

351 Let us fix the tpflllinologj A mt /rj'r,,,,j, , l’ a formalism for the

459.
definition of models. In turn. a model is a formalism for the
description of schemes, which describe the structure of Instances,
which finally contain the actual data. We use the term concept to
refer to an element of a scheme, the term construct to refer to
co'rnponents of models, and the term metaconstruct for components
of the metamodel.

Database and Expert Systems Applications.pdf

The number of fragments after decomposition de pends on the

460.
number of horizontal and vertical de compositions. Sometimes we
have to do more joins in our approach compared to th .. traditional
approach of storing the base relations, but the number of tu ples
involved in the join is always less than or atmost equal to the
traditional approach. In most cases we have to join fewer tuples than
in the traditional ap proach as we cluster the data according to the
access ing behavior of the users thus reducing the number of
irrelevant tuples.

Database and Expert Systems Applications.pdf

The natural overwrite protocol (nop) may be defined as fol lows.

461.
When a write operation create a new version do: 1. IT the total
number of versions of all data items is less than K, then add this
version to the database; otherwise, 2.

Database and Expert Systems Applications.pdf

462. 2.2.1 Data Sorts The data sorts for the example schema are given in
the following way: sorts: int, string, date, titne, ... function . : o : .... int
 + : int x int -+ int square : int .... int length : string .... int makedate : int
x int x int .... date month : date .... 8t";ng etc.

Database and Expert Systems Applications.pdf

463. The predicates and functions for data sorts have a fixed semantics
for all database states. The sets 0’; (8) are not disjoint for different
states. This allows state-independent object identification, which is an
important prerequisite for dealing with object behaviour [23, 21.

Database and Expert Systems Applications.pdf

This is one of the differences between our language and the

464.
approach of [ 10J which was taken as a basis for de velopping it. In [
lOJ safeness is achieved by prohibiting names of data sorts as
ranges in the declaration list. If a variable of a data sort is needed, its
range has to be specified by a term.

Database and Expert Systems Applications.pdf

465. The data base must allow to preser ve the participants for each year
of the rally (the RALLYMANs) and to follow the participants of the
current rally (the COMPETITORs). A TEAM is made up of one Or
several compe titors, the number of competitors depending on the
type of ve hicle (for example one for a motorbike, two for a car, three
for a truck). A competitor must be recommended by a participant from
one of the previous rallies.

Database and Expert Systems Applications.pdf

466. 2 LOGICAL MODEL AND USER MODEL ADAMS is a system which can
be used to manage a statistical data base containing macro-data.
The macro-data are obtained by the aggregation of data referring to
individual events. The macro-data are described using other data,
known as meta-data.

Database and Expert Systems Applications.pdf

d) Providing advice on the design of programs for assisting access to

467.
administrative data banks containing juridical and technical
 information (urban zoning regulations, technical regulations on
building and environment) to be installed in Offices of the Public
Administration [ SIOTUA] These pro grams would be used by jurists
in the Administration as part of their daily work.

Database and Expert Systems Applications.pdf

We showed how such a concept smoothly fits into a traditional query

468.
language. The concepts mentioned above are currently tested on
real-world medical hypennedia data consisting of text, slides, x-rays,
and videotapes.

Database and Expert Systems Applications.pdf

469. The use of computer systems in medical area has rapidly grown
during the last few years. This is not restricted to im age processing
systems but also to other application fields. Nowadays, in the better
equiped hospitals, most of the data concerning a patient can reside
in a computer.

Database and Expert Systems Applications.pdf

A very useful data structure of a more complex type is a directed

470.
ordered acyclic graph ( DOAG) which is very appropriate for bill of
material processing.

Database and Expert Systems Applications.pdf

Mediators continuously monitor these invariant data and no tify the

471.
planner when the invariants change to a significant extent. Let's call
these mediators monitors. Traditional DBMSs are passive since they
passively respond to requests from application programs.

Database and Expert Systems Applications.pdf

Thus, for implementation a hybrid system, namely Prolog-DB (a data

472.
base coupled with a logical programming lan guage) had to be used.

Database and Expert Systems Applications.pdf

 Subsequently, the case record is stored in a data base. On the basis
473.
of the case record a structured text document (medical report) is
generated using a predefined rule-based template. It consists of four
parts: basic patient data, differentiated report of symptoms, system
diagnoses (automatically inferred) and examiner comment (free text).

Lecture Notes in Artificial Intelligence.pdf

474. Semi-automatic Data Migration in a Self-medication Knowledge-

Based System 381 drugs available in France. For each drug, the
database regroups all the data of the SPC plus extra information such
as opinions of the authors and a drug rating.

Lecture Notes in Artificial Intelligence.pdf

data neural net rule set decision table validation direct consultation
475.
program codeif ... then ...

Lecture Notes in Artificial Intelligence.pdf

476. As O„ Leary (2004:227) suggested identifying data location and

accessibility is crucial in any research process. A week after my
arrival in Ethiopia I have contacted the Addis Ababa City Bureau of
Labor and Social Affairs. I have been provided some published
secondary data and reports (produced in Amharic language) and
long list of registered unemployed youth from which 15 were picked
based on the above-mentioned sampling procedures.

Unemployment Experience of Youth in .pdf

Examples of this kind of data are such things as Time and

477.
Attendance data or Allowance In this section, we will use a payroll
system, a personnel Categories which are kept only within the payroll
system. system, the pay calculation application and related data The
third subset includes elements that are not shared, but 649

A Requirement-Based Approach to Data Modeling and Re-

engineering.PDF
 To implement our visual environment and the ERC+ data model. we
478.
chose to use toolboxes [2, 18]. The toolbox approach is not only a
good software engineering approach. but also particularly well-suited
for implementing visual direct manipUlation interfaces as well as the
data models. The toolbox approach has been shown to provide both
low-level extensibility of database systems and support for user-
friendly database environment.

Database and Expert Systems Applications.pdf

Coupling the relational DBS Oracle with the programming

479.
environment [10] one gains from advantages of DBS like integrity and
security of data, concurrent access, and efficiency by set oriented
working method and optimized access. The structure used by the
programming environment is a complex object; and to access it
requires a fixpoint operator. Relational DBS provide neither fixpoint
operators nor to store complex objects.

Database and Expert Systems Applications.pdf

480. In the best case, the mapping process is based on a conceptual

scheme and an ad equate database system is used. The result of
this mapping process is a stock of data, stored in the specific syntax
of the database system, with little openly represented seman tics.
Parts of that data, and therefore parts of the knowl edge about the
universe of discourse will be translated into user information via
application programs and/or database query languages and lead to
an increase of the users spe cific knowledge.

Database and Expert Systems Applications.pdf

The InterSect_ DM is the data model of our prototype sys tem

481.
InterSect. As we described above, the main reason for the problems
of hypertext systems is that the data model of current hypertext
systems is too simple. We have chosen an object oriented database
as an information repository for our approach because of its superior
capabilities for modelling semantics which are described· by defining
the appropriate database schema.

Database and Expert Systems Applications.pdf

 One of the technical challenges faced during the design and
482.
implementation of this project was the fact that the source databases
of funded research from the various universities were dissimilar in
design and file format. The manipulation of the source data was one
of the most important issues dealt with, since the credibility of the
sys- tem would ultimately depend on the consistency and accuracy of
the information. Manipulating the data included the process of
cleansing the data, followed by the data transformation into the
relational model, and ultimately the databases migration to a
consistent format.

Lecture Notes in Artificial Intelligence.pdf

2.1 From RDB to ontology A relational database is a digital database

483.
based on the rela- tional data model proposed by Codd (1970). To
manage data in a structured form, RDBs use several components
(such as tables, constraints, keys, etc.). After thoroughly analyz- ing
the information system, designers establish a concep- tual model
used to create databases.

Ontology learning from relational database a review.pdf

V. CONCLUSIONS This paper presents a formal approach to

484.
automatic extraction of OWL ontologies from RDBs using database
reverse engineering technologies. The core contribution of this work
is that the proposed approach is more formal and can extract richer
and more natural domain semantics from RDBs compared with the
existing solutions. There are similar solutions to learning OWL
ontology from other kinds of data sources like XML documents [32].

OWL Ontology Extraction from Relational.pdf

 The data from the applicant's relational tuple is passed as a
485.
communication file to the expen system. Using data in the file the ES
decides whether to ask questions on the applicant's qualifications,
experience etc. If further data is needed by the ES about a specific
applicant then a new request is put to the user to enter the missing
data directly.

Database and Expert Systems Applications.pdf

Functions may appear in both rules and queries, and query

486.
optimization uses term rewriting in the marmer of OBI [11] in addition
to distributing selections. This approach leads to a clean integration
of abstract data types and func tions into the DS algorithm. We
present an example of a route plan ning application, to illustrate our
approach to query optimization.

Database and Expert Systems Applications.pdf

At the beginning of a program execution, the generated code reads

487.
the design data from the database for initial C-structure building.
Since the major ponion of a typical VLSI/ CAD program is CPU-
intensive, the disk access overhead at the beginning of a program
execution is not excessive. Fig.

Database and Expert Systems Applications.pdf

488. L-CATA's search strategy attempts. to intelligently prune the direct

flight data~e’ s search spac~ ’ Yhilst carrying out this retrieval. As well
as USIng system he~ stIcs to carry out the pruning, L-CATA makes
use of the constramts and

Database and Expert Systems Applications.pdf

The Data Analysis Module ( DAM)is the inter face between the ADMS
489.
and the device. It receives the real-time sensor data from the device,
samples the data according to rates set by the system operator and
passes the data on to the Data Management Module for insertion into
the database. The Data Analysis Module triggers the diagnosis
process whenever it detects a fault in the in coming data.
 Database and Expert Systems Applications.pdf

Then the method is applied to them in order to retrieve data from the
490.
database. The intensional query mechanism has been implemented
without any additional optimization methods.

Database and Expert Systems Applications.pdf

A sub query specifies the data to be obtained from an individual

491.
database, and a global query eval uation plan specifies how to
process the data obtained from the queries. Before a sub query is
sent to its target. LDBMS for evaluation, it may need to be translated
into the t.

Database and Expert Systems Applications.pdf

492. The ExER operators realize the ExER model concepts, while
application operators serve for the enduser system in teract ion. In
addition, the following ExER operators have also been implemented
respectively are in the implementa tion process: show data; choose
into application; declare keys; declare reference; declare
generalization; declare group ing; declare aggregation; declare
multivalued; load instances; 331 delete instances. The current state
of the application opera tors is: declare synonym; reload instances;
show application data; water quality comparison; department water
quality comparison.

Database and Expert Systems Applications.pdf

Once the robot tasks have been prototyped, the production cell will
493.
be simulated against a mock up state. In essence, this amounts to
producing derivable database states that reflects the reachable cell
states. The simulation analysis involves statistical aggregation of
measurement data, such as the average production time of a piece,
and the recognition of critical intermediate states, such as two robot
arms in deadly embrace awaiting the other to leave a 3-D subspace.

Database and Expert Systems Applications.pdf

 In a multi version database system, read-only transactions are never
494.
rejected if all versions of data items are retained. How ever, all
versions cannot be retained forever in any multiversion database
systems due to the limited storage space and process ing overhead.
Since storage space is always limited, the total number of versions of
data items stored in the database is also limited.

Database and Expert Systems Applications.pdf

The decisions which of the existing versions to overwrite to create

495.
new versions of data items depend on the overwrite pro tocol used
by a concurrency control algorithms. Most of concur rency control
algorithms designed (or proposed) for MVDBSs apply the overwrite
protocol which we called the natural over write protocol (nap).
According to the nap, if some write opera tion must overwrite a
version of a data item, it always overwrites the oldest venion stored
in the database [3,5,7].

Database and Expert Systems Applications.pdf

496. This version is either added to the DB, when the current number of
versions of data items is less than [(, or it replaces a version of a data
item stored in the database, when the current number of versions of
data items is equal to [(. A transaction terminates with either a
commit, c, or an abort, a, operation. We assume a transaction model,
in which all write operations of a transaction are executed as a single
indivisible step together with a commit operation.

Database and Expert Systems Applications.pdf

b) Providing advice on the construction of com puter systems for

497.
access to juridical data banks to be installed in Offices of the Public
Administration [ SIJA] or in Parliaments [ SICA]. These programs
would be used by jurists in the administration as part of their daily
work. Their activities could in volve interpretation or application of the
law.

Database and Expert Systems Applications.pdf

 Data retrieval means searching for structured information. This
498.
activity consists of data base searches which are naturally sup ported
in a hypermedia environment because of the existence of so much
structured information. A frequently occurring infor mation need
necessitates capabilities for the statistical analysis of stored data.

Database and Expert Systems Applications.pdf

499. Hence, in terms of IT services this requires an Application

Infrastructure, Communications Management, Data Management
and Security for bookkeeping and monitoring JAZZ and CASH
turnovers as well as for generating management views on
transaction data. Furthermore, it requires services in IT Management
and Architecture and Standards because Ergonomics, a partner, is
managing the CASH-system and the bookkeeping application.

The_Business_Model_Ontology_a_propositio.pdf

The generation of the ABOX The process of generating the A-Box is

500.
conducted using the R2RML language [52] that plays an important
role for completing the data acquisition phase. Generally, the algo-
rithm receives a SQL file that includes statement represented by SQL
DDL. We then use the Database Metadata Extraction Engine ( DMEE)
that analyzes the SQL file and extracts automatically the metadata
from it.

A novel approach for learning ontology from Relational db.pdf

6 Conclusion The implementation of the original SAGE ELS revealed

501.
the many limitations of that system architecture, namely the
requirement to transfer the data from each of the university
databases to a SAGE database and manually integrated it to the
SAGE database. Even though partially automating the cleansing and
integration process produced some productivity gains, the data
integration proved to be expensive from the perspective of the
human resources required as well as the requirement for a cen-
tralized database to store the data. In addition, this same limitation
prevented the system to be easily scalable to include other experts at
other universities.
 Lecture Notes in Artificial Intelligence.pdf

What makes a particular task difficult? When does it happen that

502.
small changes in the data result in dramatic changes of the
generated tree? How much does the task complexity depend on the
size of the database given?

Lecture Notes in Artificial Intelligence.pdf

Based on the monitored interactions the context-based data already

503.
collected is enriched, which ultimately allows the WE to build the
application data within the context that can be denoted as repository
for all requests, responses, and inputs of the user agents.

Lecture Notes in Artificial Intelligence.pdf

504. Data integration covers methods to extract data from internal or

external data sources such as ERP systems3 or database systems.
The data is transferred into a processing area allowing further data
transformations like data “cleaning” and data normalization. A load
process contains a scheduler which regularly (e.

Lecture Notes in Artificial Intelligence.pdf

If capacious data stocks have to be merged or used as a shared

505.
knowledge base, concepts of integrating the data are needed to
combine these data without loosing meta data. Several knowledge
integration approaches can be used to merge and to combine
heterogeneous data sources or to integrate them by using concepts
of inter- operability. It turned out that a formal handling of semantics
speeds up this integra- tion process.

Lecture Notes in Artificial Intelligence.pdf

506. In his ‘mathesis univer- salis’, he required a universal formal

language (lingua universalis) to represent human thinking by
calculation procedures and to implement them to mechanical
calculating machines. An ‘ars iudicandi’ should allow every problem
to be decided by an algo- rithm after representation in numeric
 symbols. An ‘ars iveniendi’ should enable users to seek and
enumerate desired data and solutions of problems.

Lecture Notes in Artificial Intelligence.pdf

507. Examples of this base by creating new physical components from the
to-be type of data are an Employee-Id and the employee’s
normalized data model . associated Pay Grade. The second subset
includes elements that are not shared by the systems but which are
5. Our Model Integration Approach directly related to pay.

A Requirement-Based Approach to Data Modeling and Re-

engineering.PDF

508. Graphical User Interface The goal of a graphical user interface is to

support the query specification process allowing the user to efficiently
use the database system. It should allow inexperienced us ers to
retrieve data from the database without having to know a specific
query language. In today's database man agement systems the user
is forced to think in terms of data model and query language, differing
a lot from his way of thinking.

Database and Expert Systems Applications.pdf

SYSTEM DESIGN As indicated earlier, the TAR officer Placement Sys

509.
tem (T ARPS) is designed as an expert database sys tem that
couples the officer and billet databases to an expert system [4J. The
placement officer inter acts with the system by providing officer
informa tion. The reqnired officer attributes are then re trieved from
the officer database, and passed to the rule base where it is
processed by an inference engine to produce a list of query criteria.
These query crite ria plus officer input is passed to the billet database
to produce a list of billets that match officer quali fications, billet
requirements and the officer re quest Figure 2 is a diagram showing
the system ar chitecture [5J.

Database and Expert Systems Applications.pdf

510. As mentioned before, an inverted index is called a relation index if it

is defmed over the primary key or surrogate of a single relation. In
addition, an arbitrary number of different set oriented access paths
 may be roodeled within one or many clusters. As the data objects
and their clustering is dynamic an additional structure, called link
table (see chapter 4), that enables a dynamic referencing to the
clustered objects is necessary.

Database and Expert Systems Applications.pdf

Registration data (basic attributes of objects), descriptive data (object

511.
descriptors, references), structural information (structure of virtual
objects), and operational descriptions (object method declarations)
are organized in the logical part of the visual database. An interpreter
and transfonnation process, proprietary to a specific VUI, is required
for the integration and "materialization" of a logical object in its final
representation environment. In a first step the virtual visual object
declaration must be interpreted, dissolved into sub-components and
mapped into VUI internal, proprietary data and process structures.

Database and Expert Systems Applications.pdf

A view in this data model can only be specified by a DBA. It is a very

512.
weak constraint on the global schema, because it encompasses all
the transactions accessing a specific part of a database. A view is
defined by using the followin~ syntax (note that it is possible to define
a view havmg access to attributes from several relations): vmw .......

Database and Expert Systems Applications.pdf