𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounded query classes and the difference hierarchy

✍ Scribed by Richard Beigel; William I. Gasarch; Louise Hay

Publisher
Springer
Year
1989
Tongue
English
Weight
817 KB
Volume
29
Category
Article
ISSN
0933-5846

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounding queries in the analytic polynom
Bounding queries in the analytic polynomial-time hierarchy
✍ Herbert Baier; Klaus W. Wagner πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 1004 KB

In a previous paper the present authors (Baier and Wagner, 1996) investigated an S-V-hierarchy over P using word quantifiers as well as two types of set quantifiers, the so-called analytic polynomial-time hierarchy. The fact that some constructions there result in a bounded number of oracle queries

On the computational complexity of query
On the computational complexity of querying bounds on differences constraints
✍ Vittorio Brusoni; Luca Console; Paolo Terenziani πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 891 KB

Given a consistent knowledge base formed by a set of constraints, efficient query answering (e.g., checking whether a set of constraints is consistent with the knowledge base or necessarily true in it) is practically very important. In the paper we consider bounds on differences (which are an import

Search for the Blind : A schema independ
Search for the Blind : A schema independent query method using concept hierarchy and keywords
✍ Dong-Ha Lee; Su-Woong Kim; Gabrielle Methou; Jeon-Young Lee πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 265 KB

Some database schema is very complex and it changes more frequently than the past. On the other hands, in such application database as scientific database and decision-support database, the importance of ad-hoc queries is expected to increase. Therefore the ability of a system to support ad-hoc quer