Sciweavers

777 search results - page 31 / 156
» Optimization of Relational Preference Queries
Sort
View
TKDE
2008
231views more  TKDE 2008»
13 years 8 months ago
Personalized Concept-Based Clustering of Search Engine Queries
A major problem of current Web search is that search queries are usually short and ambiguous, and thus are insufficient for specifying the precise user needs. To alleviate this pro...
Kenneth Wai-Ting Leung, Wilfred Ng, Dik Lun Lee
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
Using value queries in combinatorial auctions
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
Benoît Hudson, Tuomas Sandholm
ER
2004
Springer
84views Database» more  ER 2004»
14 years 2 months ago
Modeling Functional Data Sources as Relations
In this paper we present a model of functional access to data that, we argue, is suitable for modeling a class of data repositories characterized by functional access, such as web ...
Simone Santini, Amarnath Gupta
SIGMOD
2010
ACM
232views Database» more  SIGMOD 2010»
13 years 9 months ago
Optimizing content freshness of relations extracted from the web using keyword search
An increasing number of applications operate on data obtained from the Web. These applications typically maintain local copies of the web data to avoid network latency in data acc...
Mohan Yang, Haixun Wang, Lipyeow Lim, Min Wang
ICDE
2007
IEEE
89views Database» more  ICDE 2007»
14 years 23 days ago
A Flexible Query Graph Based Model for the Efficient Execution of Continuous Queries
In this paper, we propose a simple and flexible execution model that (i) supports a wide spectrum of alternative optimization and execution strategies and their mixtures, (ii) pro...
Yijian Bai, Hetal Thakkar, Haixun Wang, Carlo Zani...