Sciweavers

409 search results - page 54 / 82
» Plan Databases: Model and Algebra
Sort
View
102
Voted
EDBT
2004
ACM
147views Database» more  EDBT 2004»
15 years 12 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
SDB
1995
178views Database» more  SDB 1995»
15 years 3 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
JUCS
2002
89views more  JUCS 2002»
14 years 11 months ago
Scheduling Tasks to a Team of Autonomous Mobile Service Robots in Indoor Enviroments
Abstract: This paper presents a complete system for scheduling transportation orders to a fleet of autonomous mobile robots in service environments. It consists of the autonomous m...
Hartmut Surmann, Antonio Morales
DBPL
1993
Springer
141views Database» more  DBPL 1993»
15 years 3 months ago
Some Properties of Query Languages for Bags
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
Leonid Libkin, Limsoon Wong
IDEAS
2007
IEEE
144views Database» more  IDEAS 2007»
15 years 6 months ago
An Extensible and Personalized Approach to QoS-enabled Service Discovery
We present an extensible and customizable framework for the autonomous discovery of Semantic Web services based on their QoS properties. Using semantic technologies, users can spe...
Le-Hung Vu, Fabio Porto, Karl Aberer, Manfred Haus...