71 search results - page 4 / 15 » RankSQL: Query Algebra and Optimization for Relational Top-k... |
VLDB
1994
ACM
15 years 1 months ago
1994
ACM
Most declarative SQL-like query languagesfor object-oriented database systems (OOSQL) are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-,...
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
In this paper, we propose a simple and flexible execution model that (i) supports a wide spectrum of alternative optimization and execution strategies and their mixtures, (ii) pro...
160
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
178
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
DBPL
1991
Springer
15 years 1 months ago
1991
Springer
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...