SQL/NF: A query language for ¬1NF relational databases

Roth, Mark A.; Korth, Henry F.; Batory, Don

doi:10.1016/0306-4379(87)90021-4

Cited by 116 publications

(26 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, there are several differences with respect to the proposed SQL extensions (see, e.g., [27,28,29]) for processing NF 2 relations. (i) Our interface does not contain any explicit restructuring expressions -all restructuring is specified implicitly in the form.…”

Section: Informetrics Through Advanced Data Managementmentioning

confidence: 99%

A user‐oriented interface for generalised informetric analysis based on applying advanced data modelling techniques

Järvelin

Ingwersen²,

Niemi³

2000

Journal of Documentation

View full text Add to dashboard Cite

This article presents a novel user‐oriented interface for generalised informetric analysis and demonstrates how informetric calculations can easily and declaratively be specified through advanced data modelling techniques. The interface is declarative and at a high level. Therefore it is easy to use, flexible and extensible. It enables end users to perform basic informetric ad hoc calculations easily and often with much less effort than in contemporary online retrieval systems. It also provides several fruitful generalisations of typical informetric measurements like impact factors. These are based on substituting traditional foci of analysis, for instance journals, by other object types, such as authors, organisations or countries. In the interface, bibliographic data are modelled as complex objects (non‐first normal form relations) and terminological and citation networks involving transitive relationships are modelled as binary relations for deductive processing. The interface is flexible, because it makes it easy to switch focus between various object types for informetric calculations, e.g. from authors to institutions. Moreover, it is demonstrated that all informetric data can easily be broken down by criteria that foster advanced analysis, e.g. by years or content‐bearing attributes. Such modelling allows flexible data aggregation along many dimensions. These salient features emerge from the query interface‘s general data restructuring and aggregation capabilities combined with transitive processing capabilities. The features are illustrated by means of sample queries and results in the article.

show abstract

Section: Informetrics Through Advanced Data Managementmentioning

confidence: 99%

A user‐oriented interface for generalised informetric analysis based on applying advanced data modelling techniques

Järvelin

Ingwersen²,

Niemi³

2000

Journal of Documentation

View full text Add to dashboard Cite

show abstract

“…The nested relational and complex-value data models Ozsoyogly and Yuan 1987;Roth et al 1987;Roth 1988;Colby 1989;Levene and Loizou 1993;Abiteboul and Beeri 1995] developed during the past decade allow tuple components of a relation to be possibly nested tuples, sets or even relations.…”

Section: Complex-value Deductive Languagesmentioning

confidence: 99%

Deductive database languages

Liu

1999

ACM Comput. Surv.

View full text Add to dashboard Cite

Deductive databases result from the integration of relational database and logic programming techniques. However, significant problems remain inherent in this simple synthesis from the language point of view. In this paper, we discuss these problems from four different aspects: complex values, object orientation, higherorderness, and updates. In each case, we examine four typical languages that address the corresponding issues.

show abstract

“…[14,15] extend the relational algebra and calculus to manipulate nested relations. There are numerous prototype systems built based on nested relation data model [5].…”

Section: Introductionmentioning

confidence: 99%

NF-NR: A practical normal form for nested relations

Ling

Yan

1994

Journal of Systems Integration

View full text Add to dashboard Cite

We propose a normal form for nested relations, called NF-NR, which Two approaches to NF-NR database design, namely the restructuring rules approach and the ER approach, are discussed. We relate NF-NR to ER-NF, a normal form of ER defined earlier, by defining a simple mapping from an ERD in ER-NF to a set of nested relations in NF-NR. This approach effectively removes ambiguities and redundancies on a semantic level and hence gives a set of nested relations with clean semantics and yet in good normal form. A set of desirable properties for any normal form for nested relations are described and an evaluation of several existing normal forms isgiven based on this set of properties. The evaluation shows that NF-NR improves over previously proposed normal forms in various aspects and is a more practical normal form for nested relations.

show abstract

SQL/NF: A query language for ¬1NF relational databases

Cited by 116 publications

References 7 publications

A user‐oriented interface for generalised informetric analysis based on applying advanced data modelling techniques

A user‐oriented interface for generalised informetric analysis based on applying advanced data modelling techniques

Deductive database languages

NF-NR: A practical normal form for nested relations

Contact Info

Product

Resources

About