✦ LIBER ✦

An extension of SQL for querying graph relations

✍ Scribed by Joachim Biskup; Uwe Räsch; Holger Stiefeling

Book ID: 113230372
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 1005 KB
Volume: 15
Category: Article
ISSN: 0096-0551
DOI: 10.1016/0096-0551(90)90011-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Extension to SQL for Mining Associati

An Extension to SQL for Mining Association Rules

✍ Rosa Meo; Giuseppe Psaila; Stefano Ceri 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 162 KB

Usability of SQL and menus for database

Usability of SQL and menus for database query

✍ J. Steve Davis 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 511 KB

Translation of SQL queries into a graph

Translation of SQL queries into a graph structure: Query transformations and pre-optimization issues in a pipeline multiprocessor environment

✍ Maria Spiliopoulou; Michalis Hatzopoulos 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Alpha: an extension of relational algebr

Alpha: an extension of relational algebra to express a class of recursive queries

✍ Agrawal, R. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 704 KB

OPT++ : an object-oriented implementatio

OPT++ : an object-oriented implementation for extensible database query optimization

✍ Navin Kabra; David J. DeWitt 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 163 KB

Deferred-query: An efficient approach fo

Deferred-query: An efficient approach for some problems on interval graphs

✍ Chang, Maw-Shang; Peng, Sheng-Lung; Liaw, Jenn-Liang 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB 👁 2 views

This paper introduces the idea of a deferred-query approach to design O(n) algorithms for the domatic partition, optimal path cover, Hamiltonian path, Hamiltonian circuit, and maximum matching problems on interval graphs given n endpoint-sorted intervals. The previous best-known algorithms run in O(