Sciweavers

176 search results - page 14 / 36
» Supporting ranking queries on uncertain and incomplete data
Sort
View
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 7 months ago
Supporting top-k join queries in relational databases
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....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
IS
2007
13 years 7 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...
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
14 years 7 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 11 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
EWCBR
2008
Springer
13 years 9 months ago
Supporting Case-Based Retrieval by Similarity Skylines: Basic Concepts and Extensions
Conventional approaches to similarity search and case-based retrieval, such as nearest neighbor search, require the specification of a global similarity measure which is typically ...
Eyke Hüllermeier, Ilya Vladimirskiy, Bel&eacu...