Sciweavers

143 search results - page 9 / 29
» Query Order and the Polynomial Hierarchy
Sort
View
TLCA
2007
Springer
15 years 3 months ago
Predicative Analysis of Feasibility and Diagonalization
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
Jean-Yves Marion
PODS
2006
ACM
196views Database» more  PODS 2006»
15 years 9 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
ICWS
2009
IEEE
15 years 6 months ago
Selective Querying for Adapting Hierarchical Web Service Compositions Using Aggregate Volatility
Environments in which Web service compositions (WSC) operate are often dynamic. We address the problem of which service to query for up-to-date information in order to adapt a hie...
John Harney, Prashant Doshi
IJCAI
2003
14 years 10 months ago
Querying Distributed Data through Distributed Ontologies: A Simple but Scalable Approach
In this paper, we define a simple but scalable framework for peer-to-peer data sharing systems, in which the problem of answering queries over a network of semantically related p...
François Goasdoué, Marie-Christine R...
ICDT
1995
ACM
105views Database» more  ICDT 1995»
15 years 29 days ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz