Sciweavers

15 search results - page 2 / 3
» Top-k Query Evaluation with Probabilistic Guarantees
Sort
View
PVLDB
2008
174views more  PVLDB 2008»
13 years 4 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
ICDE
2007
IEEE
158views Database» more  ICDE 2007»
14 years 5 months ago
Efficient Evaluation of Imprecise Location-Dependent Queries
In location-based services, it is common for a user to issue a query based on his/her current position. One such example is "find the available cabs within two miles of my cu...
Jinchuan Chen, Reynold Cheng
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
14 years 4 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 5 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
PVLDB
2010
97views more  PVLDB 2010»
13 years 2 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande