Sciweavers

143 search results - page 7 / 29
» Query Order and the Polynomial Hierarchy
Sort
View
DAWAK
2006
Springer
14 years 2 months ago
Extending Visual OLAP for Handling Irregular Dimensional Hierarchies
Comprehensive data analysis has become indispensable in a variety of environments. Standard OLAP (On-Line Analytical Processing) systems, designed for satisfying the reporting need...
Svetlana Mansmann, Marc H. Scholl
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 10 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
ICDT
2011
ACM
242views Database» more  ICDT 2011»
13 years 2 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
14 years 5 months ago
Bounded Queries and the NP Machine Hypothesis
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
Richard Chang, Suresh Purini
DOOD
1995
Springer
128views Database» more  DOOD 1995»
14 years 2 months ago
Authorization Analysis of Queries in Object-Oriented Databases
Abstract. A simple model for method-based authorization is defined and an algorithm is presented for testing in compile-time whether a given database schema violates authorization...
Hiroyuki Seki, Yasunori Ishihara, Minoru Ito