Sciweavers

492 search results - page 55 / 99
» Querying with Intrinsic Preferences
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 6 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
16 years 3 months ago
Progressive Result Generation for Multi-Criteria Decision Support Queries
— Multi-criteria decision support (MCDS) is crucial in many business and web applications such as web searches, B2B portals and on-line commerce. Such MCDS applications need to r...
Elke A. Rundensteiner, Venkatesh Raghavan
DBSEC
2004
108views Database» more  DBSEC 2004»
15 years 7 months ago
Why Is this User Asking so Many Questions? Explaining Sequences of Queries
A sequence of queries submitted by a database user within a short period of time may have a single, illuminating explanation. In this paper we consider sequences of single-record q...
Aybar C. Acar, Amihai Motro
SIGMOD
2011
ACM
199views Database» more  SIGMOD 2011»
14 years 9 months ago
Schema-as-you-go: on probabilistic tagging and querying of wide tables
The emergence of Web 2.0 has resulted in a huge amount of heterogeneous data that are contributed by a large number of users, engendering new challenges for data management and qu...
Meiyu Lu, Divyakant Agrawal, Bing Tian Dai, Anthon...
WWW
2009
ACM
16 years 6 months ago
Search result re-ranking based on gap between search queries and social tags
Both search engine click-through log and social annotation have been utilized as user feedback for search result re-ranking. However, to our best knowledge, no previous study has ...
Jun Yan, Ning Liu, Elaine Qing Chang, Lei Ji, Zhen...