Sciweavers

486 search results - page 59 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
WEBDB
2010
Springer
143views Database» more  WEBDB 2010»
15 years 6 months ago
Querying Wikipedia Documents and Relationships
Wikipedia has become an important source of information which is growing very rapidly. However, the existing infrastructure for querying this information is limited and often igno...
Huong Nguyen, Thanh Nguyen, Hoa Nguyen, Juliana Fr...
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
16 years 1 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 8 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
16 years 1 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
110
Voted
VLDB
2007
ACM
155views Database» more  VLDB 2007»
15 years 7 months ago
Best Position Algorithms for Top-k Queries
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez