𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Semantic Representations and Query Languages for Or-Sets

✍ Scribed by Leonid Libkin; Limsoon Wong


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
875 KB
Volume
52
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

✦ Synopsis


Or-sets were introduced by Imielinski, Naqvi, and Vadaparty for dealing with limited forms of disjunctive information in database queries. Independently, Rounds used a similar notion for representing disjunctive and conjunctive information in the context of situation theory. In this paper we formulate a query language with adequate expressive power for or-sets. Using the notion of normalization of or-sets, queries at the structural'' and conceptual'' levels are distinguished. Losslessness of normalization is established for a large class of queries. We obtain upper bounds for the cost of normalization. An approach related to that of Rounds is used to provide semantics for or-sets. We also treat or-sets in the context of partial information in databases.


📜 SIMILAR VOLUMES


A query language for discovering semanti
✍ Timo Niemi; Janne Jämsen 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 270 KB 👁 1 views

## Abstract In contemporary query languages, the user is responsible for navigation among semantically related data. Because of the huge amount of data and the complex structural relationships among data in modern applications, it is unrealistic to suppose that the user could know completely the co

A set-oriented method definition languag
✍ Elisa Bertino; Giovanna Guerrini; Isabella Merlo 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 571 KB

## Abstract In this paper we propose a set‐oriented rule‐based method definition language for object‐oriented databases. Most existing object‐oriented database systems exploit a general‐purpose imperative object‐oriented programming language as the method definition language. Because methods are wr

Index sets for ω-languages
✍ Douglas Czenzer; Jeffrey B. Remmel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB

## Abstract An ω‐language is a set of infinite sequences (words) on a countable language, and corresponds to a set of real numbers in a natural way. Languages may be described by logical formulas in the arithmetical hierarchy and also may be described as the set of words accepted by some type of au

EquiX—A search and query language for XM
✍ Sara Cohen; Yaron Kanza; Yakov Kogan; Yehoshua Sagiv; Werner Nutt; Alexander Ser 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB 👁 1 views