757 search results - page 75 / 152 » Topical query decomposition |
177
click to vote
DASFAA
2010
IEEE
15 years 8 months ago
2010
IEEE
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...
229
click to vote
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
165
Voted
DATESO
2008
15 years 5 months ago
2008
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
134
click to vote
SIGMOD
2002
ACM
16 years 4 months ago
2002
ACM
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
124
click to vote
CIKM
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we compare performance of several heuristics in generating informative generic/query-oriented extracts for newspaper articles in order to learn how topic prominence ...