3652 search results - page 207 / 731 » A study of query length |
ICDT
2009
ACM
14 years 9 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...
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to "certain" data, ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
An answer to a query has a well-defined lineage expression (alternatively called how-provenance) that explains how the answer was derived. Recent work has also shown how to comput...
CIKM
2006
Springer
13 years 12 months ago
2006
Springer
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
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...