✦ LIBER ✦

A graphical query language for simulation databases

✍ Scribed by A. Oberweis; V. Sänger

Publisher: Elsevier Science
Year: 1994
Weight: 729 KB
Volume: 17
Category: Article
ISSN: 0745-7138
DOI: 10.1006/jmca.1994.1024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Visual query languages for entity relati

Visual query languages for entity relationship model databases

✍ Hock C. Chan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 319 KB

More and more relational database systems for microcomputers are providing visual interfaces, such as query by example (QBE). At the same time, experimental studies are providing more support for the theory that the end users can perform better with the entity relationship (ER) model than with the r

A Query Language for NC

✍ Dan Suciu; Val Tannen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 660 KB

We show that a form of divide and conquer recursion on sets, together with the relational algebra, expresses exactly the queries over ordered relational databases which are NC-computable. At a finer level, we relate k nested uses of recursion exactly to AC k , k 1. We also give corresponding results

On Instance-Completeness for Database Qu

On Instance-Completeness for Database Query Languages involving Object Creation

✍ Marc Andries; Jan Paredaens 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 838 KB

In 1978 Bancilhon and Paredaens introduced a notion of completeness for relational database languages on instance-level. Their criterion was subsequently called BP-completeness. Since then, it was used frequently in the context of other database models. However, its application in the context of lan

EquiX—A search and query language for XM

EquiX—A search and query language for XML

✍ Sara Cohen; Yaron Kanza; Yakov Kogan; Yehoshua Sagiv; Werner Nutt; Alexander Ser 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB 👁 1 views

A graphic database for interactive CAD

✍ Ikuo Oyake; Hirotaka Mizuno; Masayuki Yamagishi 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 134 KB

A Fast Algorithm for Query Optimization

A Fast Algorithm for Query Optimization in Universal-Relation Databases

✍ Francesco Mario Malvestuto; Marina Moscarini 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 640 KB

The method of the canonical connection introduced by Maier and Ullman provides an optimal procedure for query processing in universal-relation databases. We present an algorithm for computing canonical connections in a database scheme which is more efficient than the classical algorithm based on tab