Results 241 to 250 of about 331,075 (300)

Normalization of relations and PROLOG

open access: yesCommunications of the ACM, 1986
A program for the normalization of relations that is written in Prolog has several advantages relative to programs written in conventional programming languages: notably, conciseness and clarity. The program presented here implements several normalization algorithms and is suitable for the interactive design of small database applications and as a ...
Georg Gottlob
exaly   +3 more sources
Some of the next articles are maybe not open access.

Related searches:

Storing Normalized XML Documents in Normalized Relations

The Fifth International Conference on Computer and Information Technology (CIT'05), 2005
This paper studies the XML storage in relations. Unlike traditional techniques, it considers the semantics expressed by functional dependencies. We propose an algorithm for mapping DTD to relational schema, which preserves not only the content and structure but also the semantics of original XML documents.
Zijing Tan   +3 more
openaire   +1 more source

Normal Forms for Partitions and Relations

1999
Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard tree-like presentation of terms. Many of these approaches reveal a specific interest towards their application in the "distributed and concurrent systems" field, but an exhaustive comparison between them is dificult ...
BRUNI, ROBERTO   +2 more
openaire   +2 more sources

On Normalization of Relations in Relational Databases

Programming and Computer Software, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Equivalence relations, invariants, and normal forms, II

SIAM Journal on Computing, 1984
Summary: For an equivalence relation E on the words in some finite alphabet, we consider the recognition problem (decide whether two words are equivalent), the invariant problem (calculate a function constant on precisely the equivalence classes), the normal form problem (calculate a particular member of an equivalence class, given an arbitrary member)
Andreas Blass, Yuri Gurevich
openaire   +1 more source

Normalized-scale Relations and Their Concept Lattices in Relational Databases

Fundamenta Informaticae, 2009
Formal Concept Analysis (FCA) is a valid tool for data mining and knowledge discovery, which identifies conceptual structures from (formal) contexts. As many practical applications involve non-binary data, non-binary attributes are introduced via a many-valued context in FCA.
Yuxia Lei, Yuefei Sui, Cungen Cao
openaire   +2 more sources

Home - About - Disclaimer - Privacy