Sciweavers

316 search results - page 28 / 64
» Evaluation of Conditional Preference Queries
Sort
View
COLCOM
2008
IEEE
14 years 4 months ago
Collaborative Search and User Privacy: How Can They Be Reconciled?
Abstract. Collaborative search engines (CSE) let users pool their resources and share their experiences when seeking information on the web. However, when shared, search terms and ...
Thorben Burghardt, Erik Buchmann, Klemens Böh...
SSD
2001
Springer
94views Database» more  SSD 2001»
14 years 2 months ago
Selectivity Estimation of Complex Spatial Queries
Several studies have focused on the efficient processing of simple spatial query types such as selections and spatial joins. Little work, however, has been done towards the optimiz...
Nikos Mamoulis, Dimitris Papadias
WSMAI
2004
13 years 11 months ago
Scalable Continuous Query System for Web Databases
Continuous Queries (CQ) help users to retrieve results as soon as they become available. The CQ keeps track of two important events. If there is any change in the source informatio...
Ather Saeed, Savitri Bevinakoppa
DASFAA
2010
IEEE
190views Database» more  DASFAA 2010»
14 years 1 months ago
k-Selection Query over Uncertain Data
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 10 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