Sciweavers

2145 search results - page 255 / 429
» Pattern-Based Query Answering
Sort
View
SIGMOD
2012
ACM
210views Database» more  SIGMOD 2012»
12 years 4 days ago
Interactive regret minimization
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, K...
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 11 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 11 months ago
Navigation- vs. Index-Based XML Multi-Query Processing
XML path queries form the basis of complex filtering of XML data. Most current XML path query processing techniques can be divided in two groups. Navigation-based algorithms compu...
Nicolas Bruno, Luis Gravano, Nick Koudas, Divesh S...
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
14 years 9 months ago
Spark: top-k keyword query in relational databases
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 9 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