Sciweavers

525 search results - page 17 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
VLDB
1987
ACM
100views Database» more  VLDB 1987»
13 years 11 months ago
Optimization of Systems of Algebraic Equations for Evaluating Datalog Queries
A Datalog program can be translated into a system of fixpoint equations of relational algebra; this paper studies how such a system can be solved and optimized for a particular qu...
Stefano Ceri, Letizia Tanca
BTW
2007
Springer
142views Database» more  BTW 2007»
14 years 1 months ago
Algebraic Query Optimization for Distributed Top-k Queries
: Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient alge...
Thomas Neumann, Sebastian Michel
IJCAI
2007
13 years 8 months ago
An Improved Probabilistic Ant based Clustering for Distributed Databases
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
Chandrasekar Ramachandran, Thanukrishnan Srinivasa...
SIGMOD
2002
ACM
141views Database» more  SIGMOD 2002»
13 years 7 months ago
Bringing Order to Query Optimization
A variety of developments combine to highlight the need for respecting order when manipulating relations. For example, new functionality is being added to SQL to support OLAP-styl...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
JAPLL
2010
98views more  JAPLL 2010»
13 years 5 months ago
On database query languages for K-relations
The relational model has recently been extended to so-called K-relations in which tuples are assigned a unique value in a semiring K. A query language, denoted by RAC K , similar ...
Floris Geerts, Antonella Poggi