✦ LIBER ✦

PSQL: A query language for probabilistic relational data

✍ Scribed by Debabrata Dey; Sumit Sarkar

Book ID: 108416118
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 888 KB
Volume: 28
Category: Article
ISSN: 0169-023X
DOI: 10.1016/s0169-023x(98)00015-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

PRL: A probabilistic relational language

✍ Lise Getoor; John Grant 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 685 KB

An approximate user-complexity measure f

An approximate user-complexity measure for relational query language systems

✍ Gary W. Hansen; James V. Hansen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 837 KB

UQL: A UML-based Query Language for Inte

UQL: A UML-based Query Language for Integrated Data

✍ M. N. Grinev; S. D. Kuznetsov 📂 Article 📅 2002 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 50 KB

An Extended Relational Data Model For Pr

An Extended Relational Data Model For Probabilistic Reasoning

✍ S.K.M. Wong 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 648 KB

Multidimensional Data Model and Query La

Multidimensional Data Model and Query Language for Informetrics

✍ Timo Niemi; Lasse Hirvonen; Kalervo Järvelin 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

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