Sciweavers

6274 search results - page 193 / 1255
» From query complexity to computational complexity
Sort
View
PODS
2006
ACM
196views Database» more  PODS 2006»
16 years 4 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
DBPL
1995
Springer
106views Database» more  DBPL 1995»
15 years 8 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
147
Voted
ICWE
2004
Springer
15 years 10 months ago
Semantic Lookup in Service-Oriented Architectures
Lookup of services is an important issues in many distributed systems. This paper deals with lookup in service-oriented architectures, such as Web services, P2P systems, GRIDs, or ...
Uwe Zdun
159
Voted
PODS
2008
ACM
250views Database» more  PODS 2008»
16 years 4 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
PCI
2005
Springer
15 years 10 months ago
Middleware for Building Ubiquitous Computing Applications Using Distributed Objects
Ubiquitous systems are characterized by multi-fold complexity, stemming mainly from the vast number of possible interactions between many heterogeneous objects and services. Device...
Nicolas Drossos, Eleni Christopoulou, Achilles Kam...