Semantic Representations And Query Languages For Or-Sets

DMCA

Semantic Representations And Query Languages For Or-Sets (1993)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Leonid Libkin , Limsoon Wong

Venue:	IN PROCEEDINGS OF 12TH ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS
Citations:	36 - 16 self

BibTeX

@INPROCEEDINGS{Libkin93semanticrepresentations,
    author = {Leonid Libkin and Limsoon Wong},
    title = {Semantic Representations And Query Languages For Or-Sets},
    booktitle = {IN PROCEEDINGS OF 12TH ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS},
    year = {1993},
    pages = {37--48},
    publisher = {}
}

OpenURL

Abstract

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 have obtained 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.

Keyphrases

query language semantic representation conceptual level database query situation theory partial information similar notion disjunctive information conjunctive information large class upper bound adequate expressive power limited form

DMCA