PIQUE: A relational query language without relations

Maier, David; Rozenshtein, David; Salveter, Sharon C.; Stein, Jacob; Warren, David S.

doi:10.1016/0306-4379(87)90008-1

Cited by 21 publications

(5 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(COLLEGE-NAME = "ARTS") means the same as (COLLEGE-NAME != "ARTS"). As in [15], we have a more complex relational operator "not" in which the query display STUDENT-ID…”

Section: Connectionsmentioning

confidence: 98%

“…Query languages based on the tuple calculus (e.g., PITS [15], VERDI [30], and the System/U query language l Joseph A. Wald and Paul G. Sorenson [13]) allow more complicated queries to be formulated using several connection schemes.…”

Section: Connectionsmentioning

confidence: 99%

“…Universal relation interfaces [14][15][16][17]21, 291 attempt to provide logical data independence by presenting a simple view in which a user is allowed to express queries in terms of attributes only. Such queries are called conceptual queries.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Explaining ambiguity in a formal query language

Wald

Sorenson

1990

ACM Trans. Database Syst.

View full text Add to dashboard Cite

The problem of generating reasonable natural language-like responses to queries formulated in nonnavigational query languages with logical data independence is addressed. An extended ER model, the Entity-Relationship-Involvement model, is defined which assists in providing a greater degree of logical data independence and the generation of natural language explanations of a query processor's interpretation of a query. These are accomplished with the addition of the concept of an involvement to the model. Based on involvement definitions in a formally defined data definition language, DDL, an innovative strategy for generating explanations is outlined and exemplified. In the conclusion, possible extensions to the approach are given.

show abstract

“…(COLLEGE-NAME = "ARTS") means the same as (COLLEGE-NAME != "ARTS"). As in [15], we have a more complex relational operator "not" in which the query display STUDENT-ID…”

Section: Connectionsmentioning

confidence: 98%

Section: Connectionsmentioning

confidence: 99%

See 1 more Smart Citation

Explaining ambiguity in a formal query language

Wald

Sorenson

1990

ACM Trans. Database Syst.

View full text Add to dashboard Cite

show abstract

“…There are two major approaches to this problem, the universal schema interface (Maier and Ullman, 1983;Maier et al, 1987) and the implicit join (Litwin, 1985). There is a fundamental difference between PMs in our approach and joins in both of the above approaches.…”

Section: Introductionmentioning

confidence: 99%

Computing access relevance for path-method generation in OODB and IM-OODB

et al. 1996

View full text Add to dashboard Cite

A path-method (PM) is a mechanism to retrieve or to update information relevant to one class, in an object-oriented database (OODB), that is not stored with that class but with some other class. The PM traverses a chain of classes and connections that ends at the class where the required information is stored. However, it is a difficult task for a user to write PMs. This is because it might require comprehensive knowledge of many classes of the conceptual schema. But a typical user has often incomplete or even inconsistent knowledge of the schema.Currently we are developing a system, called Path-Method Generator (PMG), which generates PMs automatically according to a naive user's requests. One algorithm of PMG uses numerical access relevance between pairs of classes as a guide for the traversal of an OODB schema. In this paper we define the notion of access relevance to measure the significance of the (indirect) connection between any two classes in an OODB and present efficient algorithms to compute access relevance. The manual PM generation in an interoperable multi object-oriented database (IM-OODB) is even more difficult than for one OODB since a user has to be familiar with several OODBs. We use a hierarchical approach for developing efficient online algorithms for the computation of access relevances in an IM-OODB, based on precomputed access relevances for each autonomous OODB. In an IM-OODB the access relevances are used as a guide in generating PMs between the classes of different OODBs.

show abstract

“…In fact, some subjects thought that some of the two table join tasks had been given before since they were so much like the earlier tasks in other respects. This power of DataTalker is similar to the universal relation interface as described by Maier, et al [25]. SQL also provides a similar though more limited functionality with views which was not included in this experiment.…”

Section: Joinsmentioning

confidence: 85%

An exploratory study of ad hoc query languages to databases

Bell

Rowe

[1992] Eighth International Conference on Data Engineering

View full text Add to dashboard Cite

This paper describes an exploratory study peqormed to compare three different interface styles for ad hoc query to a database. Subjects with wide ranging computer experience performed queries of varying dificulty using either an artificial, a graphical, or a natural language interface. All three interfaces were commercial products. The study revealed strengths and weaknesses of each interface and showed that interaction with the natural language interface was qualitatively different than interaction with either the graphical or artijicial language systems.

show abstract

PIQUE: A relational query language without relations

Cited by 21 publications

References 8 publications

Explaining ambiguity in a formal query language

Explaining ambiguity in a formal query language

Computing access relevance for path-method generation in OODB and IM-OODB

An exploratory study of ad hoc query languages to databases

Contact Info

Product

Resources

About