Sciweavers

294 search results - page 4 / 59
» Efficiently Processing Queries on Interval-and-Value Tuples ...
Sort
View
CIKM
2006
Springer
15 years 1 months ago
SaLSa: computing the skyline without scanning the whole sky
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
Ilaria Bartolini, Paolo Ciaccia, Marco Patella
IS
2007
14 years 9 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
CIKM
2009
Springer
15 years 4 months ago
Group-by skyline query processing in relational engines
The skyline operator was first proposed in 2001 for retrieving interesting tuples from a dataset. Since then, 100+ skyline-related papers have been published; however, we discove...
Ming-Hay Luk, Man Lung Yiu, Eric Lo
GVD
2009
125views Database» more  GVD 2009»
14 years 7 months ago
A quantum logic-based query processing approach for extending relational query languages
Evaluating a traditional database query against a data tuple returns a true on match and a false on mismatch. Unfortunately, there are many application scenarios where such an eva...
Sebastian Lehrack
71
Voted
SIGMOD
2001
ACM
115views Database» more  SIGMOD 2001»
15 years 9 months ago
Efficient Evaluation of XML Middle-ware Queries
We address the problem of efficiently constructing materialized XML views of relational databases. In our setting, the XML view is specified by a query in the declarative query la...
Mary F. Fernandez, Atsuyuki Morishima, Dan Suciu