Sciweavers

PVLDB
2010
84views more  PVLDB 2010»
13 years 10 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
ICDE
2007
IEEE
114views Database» more  ICDE 2007»
14 years 6 months ago
Ranking Issues for Information Integration
Ranking of query/search answers, although introduced by early information retrieval systems, has become mandatory for internet searches. When the answers of a query or search are ...
Aditya Telang, Roochi Mishra, Sharma Chakravarthy
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
15 years 1 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu