Sciweavers

3341 search results - page 269 / 669
» On Bounded Queries and Approximation
Sort
View
DBPL
2003
Springer
130views Database» more  DBPL 2003»
15 years 12 months ago
Attribute Grammars for Scalable Query Processing on XML Streams
We introduce the new notion of XML Stream Attribute Grammars (XSAGs). XSAGs are the first scalable query language for XML streams (running strictly in linear time with bounded mem...
Christoph Koch, Stefanie Scherzinger
DEXAW
2006
IEEE
139views Database» more  DEXAW 2006»
15 years 8 months ago
Consistent Query Answering By Minimal-Size Repairs
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...
Andrei Lopatenko, Leopoldo E. Bertossi
DBSEC
2006
160views Database» more  DBSEC 2006»
15 years 8 months ago
On Finding an Inference-Proof Complete Database for Controlled Query Evaluation
Abstract. Controlled Query Evaluation (CQE) offers a logical framework to prevent a user of a database from inadvertently gaining knowledge he is not allowed to know. By modeling t...
Joachim Biskup, Lena Wiese
IANDC
2006
102views more  IANDC 2006»
15 years 6 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
STACS
2009
Springer
16 years 1 months ago
Quantum Query Complexity of Multilinear Identity Testing
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
Vikraman Arvind, Partha Mukhopadhyay