Sciweavers

342 search results - page 8 / 69
» Branch-and-bound processing of ranked queries
Sort
View
CW
2005
IEEE
14 years 1 months ago
ComRank: Metasearch and Automatic Ranking of XML Retrieval System
Different information retrieval (IR) systems often return very diverse results lists for the same query. This is problematic for users since no one IR system works best for every ...
Alan Woodley, Shlomo Geva
SEMWEB
2004
Springer
14 years 24 days ago
Top-k Query Evaluation for Schema-Based Peer-to-Peer Networks
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Ti...
CIKM
2010
Springer
13 years 5 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
EDBTW
2004
Springer
14 years 26 days ago
Query Recommendation Using Query Logs in Search Engines
In this paper we propose a method that, given a query submitted to a search engine, suggests a list of related queries. The related queries are based in previously issued queries, ...
Ricardo A. Baeza-Yates, Carlos A. Hurtado, Marcelo...
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
14 years 7 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han