Sciweavers

143 search results - page 4 / 29
» Query Order and the Polynomial Hierarchy
Sort
View
COCO
2001
Springer
108views Algorithms» more  COCO 2001»
14 years 1 months ago
Bounded Query Functions with Limited Output Bits
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
Richard Chang, Jon S. Squire
ICCS
1997
Springer
14 years 20 days ago
The CG Mars Lander
The name of the system is \THE CG MARS LANDER", which stands forType Hierarchy Enhanced CGMatching And Retrieval SystemLinear Associative N-tuple Deductive Embedded Representa...
Gil Fuchs, Robert Levinson
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
13 years 8 months ago
Call to order: a hierarchical browsing approach to eliciting users' preference
Computing preference queries has received a lot of attention in the database community. It is common that the user is unsure of his/her preference, so care must be taken to elicit...
Feng Zhao, Gautam Das, Kian-Lee Tan, Anthony K. H....
DBPL
1999
Springer
101views Database» more  DBPL 1999»
14 years 24 days ago
On the Power of Incremental Evaluation in SQL-Like Languages
We consider IES(SQL), the incremental evaluation system over an SQL-like language with grouping, arithmetics, and aggregation. We show that every second order query is in IES(SQL) ...
Leonid Libkin, Limsoon Wong
CORR
2011
Springer
183views Education» more  CORR 2011»
13 years 3 months ago
Pattern tree-based XOLAP rollup operator for XML complex hierarchies
—With the rise of XML as a standard for representing business data, XML data warehousing appears as a suitable solution for decision-support applications. In this context, it is ...
Marouane Hachicha, Jérôme Darmont