Sciweavers

144 search results - page 6 / 29
» Semantics of Ranking Queries for Probabilistic Data and Expe...
Sort
View
ESWS
2009
Springer
14 years 2 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 1 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
IPM
2008
134views more  IPM 2008»
13 years 7 months ago
RSS: A framework enabling ranked search on the semantic web
The semantic web not only contains resources but also includes the heterogeneous relationships among them, which is sharply distinguished from the current web. As the growth of th...
Xiaomin Ning, Hai Jin, Hao Wu
TKDE
2010
274views more  TKDE 2010»
13 years 6 months ago
Ranked Query Processing in Uncertain Databases
—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, the ...
Xiang Lian, Lei Chen 0002
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
14 years 2 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...