Sciweavers

735 search results - page 33 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
HIM
1997
Springer
162views Multimedia» more  HIM 1997»
15 years 5 months ago
Probabilistic Logical Information Retrieval for Content, Hypertext, and Database Querying
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...
Thomas Rölleke, Markus Blömer
152
Voted
PVLDB
2008
157views more  PVLDB 2008»
15 years 5 days ago
SEDA: a system for search, exploration, discovery, and analysis of XML Data
Keyword search in XML repositories is a powerful tool for interactive data exploration. Much work has recently been done on making XML search aware of relationship information emb...
Andrey Balmin, Latha S. Colby, Emiran Curtmola, Qu...
122
Voted
SEMWEB
2010
Springer
14 years 11 months ago
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
Yingjie Li, Jeff Heflin
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
15 years 7 months ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
ICDT
2012
ACM
293views Database» more  ICDT 2012»
13 years 4 months ago
On the complexity of query answering over incomplete XML documents
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
Amélie Gheerbrant, Leonid Libkin, Tony Tan