785 search results - page 48 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
SIGMOD
2006
ACM
14 years 9 months ago
2006
ACM
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
DOLAP
2006
ACM
14 years 2 months ago
2006
ACM
Motivated by the increasing need to analyze complex, uncertain multidimensional data this paper proposes probabilistic OLAP queries that are computed using probability distributio...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
IEEEMSP
2002
IEEE
14 years 1 months ago
2002
IEEE
Music query-by-humming is a challenging problem since the humming query inevitably contains much variation and inaccuracy. Many of the previous methods, which adopt note segmentat...