Conceptual graphs for relational Databases

Boksenbaum, Claude; Carbonneill, Boris; Haemmerlé, Ollivier; Libourel, Thérèse

doi:10.1007/3-540-56979-0_8

Cited by 8 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, in the real word, relationships between objects play an important role. In the field of relational databases [17] or information systems engineering (e.g. Merise [18]), the importance of relations has already been recognized.…”

Section: Current Logical Approachesmentioning

confidence: 99%

A Logical Relational Approach for Information Retrieval Indexing

Ounis

Huibers

1997

Electronic Workshops in Computing

View full text Add to dashboard Cite

In a relational indexing approach (see e.g. Farradane's work), information is carried by a fixed set of relationship types over an underlying set of terms. The idea is that the essence of the meaning of information is encapsulated in the relationships between terms. The importance of relationships is now widely recognized within many fields such as relational databases and knowledge representation formalisms. These fields have substantially improved our understanding of relationships and the problems involved in trying to formalize them. However, although those relationships can be correctly represented by almost all the well-known formalisms in such fields, they are not exploited as much as the objects by concrete operations. In information retrieval, previous attempts at managing relationships have mainly addressed structural aspects, and exclude the manipulation of index expressions by relational operations. This paper suggests a prime use of the relation properties through a logical framework, in a way that it can improve the effectiveness of the matching operation.

show abstract

Section: Current Logical Approachesmentioning

confidence: 99%

A Logical Relational Approach for Information Retrieval Indexing

Ounis

Huibers

1997

Electronic Workshops in Computing

View full text Add to dashboard Cite

show abstract

“…As far as we know, this topic has not yet been studied. Several proposals have been made on querying relational databases with conceptual graphs [10][11][12]. Many studies have been conducted in an annotation context (e.g.…”

Section: Introductionmentioning

confidence: 99%

Query-Answering CG Knowledge Bases

Leclère

Moreau

Conceptual Structures: Knowledge Visualization and Reasoning

View full text Add to dashboard Cite

Conceptual graphs are a good choice for constructing and exploiting a knowledge base. In several of our projects (semantic portal for e-tourism, exploitation of digital object corpus, etc.), we have to query such bases. So it is natural to consider queries and bases as simple graphs and to compute the set of all projections from a query to a base. However, there is a problem of the return of this set of projections to the user. More generally, the main issue is about the definition of the notion of answers in an query-answering system made of knowledge bases formalized by graphs (Conceptual Graphs, RDF (Resource Description Framework) , Topic Maps, etc.). In this paper, we study several notions of answers and some of their characterizations. We distinguish between notions of answers by subgraphs of the base and answers by creation of result graphs. For the last type of answers, we define completeness, non-redundancy and minimality criteria of the answer sets and propose several notions of answers w.r.t these criteria.

show abstract

Towards a Unified Querying System of Both Structured and Semi-structured Imprecise Data Using Fuzzy View

Buche¹,

Haemmerlé²

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Conceptual graphs for relational Databases

Cited by 8 publications

References 4 publications

A Logical Relational Approach for Information Retrieval Indexing

A Logical Relational Approach for Information Retrieval Indexing

Query-Answering CG Knowledge Bases

Towards a Unified Querying System of Both Structured and Semi-structured Imprecise Data Using Fuzzy View

Contact Info

Product

Resources

About