Sciweavers

143 search results - page 2 / 29
» Query Order and the Polynomial Hierarchy
Sort
View
AMW
2010
13 years 6 months ago
Multiresolution Cube Estimators for Sensor Network Aggregate Queries
In this work we present in-network techniques to improve the efficiency of spatial aggregate queries. Such queries are very common in a sensornet setting, demanding more targeted t...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
SEMWEB
2009
Springer
13 years 12 months ago
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
Ken Kaneiwa, Philip H. P. Nguyen
COCO
2008
Springer
91views Algorithms» more  COCO 2008»
13 years 7 months ago
Amplifying ZPP^SAT[1] and the Two Queries Problem
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...
Richard Chang, Suresh Purini
ICDT
2009
ACM
108views Database» more  ICDT 2009»
14 years 6 months ago
A compositional query algebra for second-order logic and uncertain databases
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. Thi...
Christoph Koch
ADC
2008
Springer
146views Database» more  ADC 2008»
13 years 11 months ago
A Typed Higher-Order Calculus for Querying XML Databases
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
Qing Wang, Klaus-Dieter Schewe