Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/2773
Title: Database interrogation using conjunctive queries
Authors: Bielecki, M
VAN DEN BUSSCHE, Jan 
Issue Date: 2003
Publisher: SPRINGER-VERLAG BERLIN
Source: DATABASE THEORY ICDT 2003, PROCEEDINGS. p. 259-269
Series/Report: LECTURE NOTES IN COMPUTER SCIENCE
Series/Report no.: 2572
Abstract: We consider a scenario where a client communicates with a database server by posing boolean conjunctive queries, or more generally, counts of conjunctive queries. We investigate to what extent features such as quantification, negation, or non-equalities axe important in such a setting. We also investigate the difference between a setting where the client can pose an adaptive sequence of queries, and a setting where the client must pose a fixed combination of queries.
Notes: Warsaw Univ, Warsaw, Poland. Univ Limburg, Diepenbeek, Belgium.Bielecki, M, Warsaw Univ, Warsaw, Poland.
Document URI: http://hdl.handle.net/1942/2773
ISSN: 0302-9743
DOI: 10.1007/3-540-36285-1_17
ISI #: 000181548600017
Category: A1
Type: Journal Contribution
Validations: ecoom 2004
Appears in Collections:Research publications

Show full item record

SCOPUSTM   
Citations

4
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

2
checked on May 21, 2022

Page view(s)

40
checked on May 20, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.