Sciweavers

651 search results - page 20 / 131
» Algebraic Query Optimization for Distributed Top-k Queries
Sort
View
ADC
2005
Springer
114views Database» more  ADC 2005»
14 years 2 months ago
Optimization of Relational Preference Queries
The design and implementation of advanced personalized database applications requires a preference-driven approach. Representing preferences as strict partial orders is a good cho...
Bernd Hafenrichter, Werner Kießling
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
14 years 10 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
DBPL
1991
Springer
98views Database» more  DBPL 1991»
14 years 15 days ago
Structural Recursion as a Query Language
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...
Val Tannen, Peter Buneman, Shamim A. Naqvi
GIS
2005
ACM
14 years 10 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 9 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis