Sciweavers

735 search results - page 10 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
ISEMANTICS
2010
14 years 10 months ago
An evaluation of approaches to federated query processing over linked data
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...
Peter Haase, Tobias Mathäß, Michael Zil...
SIGIR
2010
ACM
14 years 9 months ago
DivQ: diversification for keyword search over structured databases
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
Elena Demidova, Peter Fankhauser, Xuan Zhou, Wolfg...
ICDE
2011
IEEE
215views Database» more  ICDE 2011»
14 years 3 months ago
Top-k keyword search over probabilistic XML data
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
ICDT
2010
ACM
211views Database» more  ICDT 2010»
15 years 9 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
DBISP2P
2005
Springer
132views Database» more  DBISP2P 2005»
15 years 1 months ago
Publish/Subscribe with RDF Data over Large Structured Overlay Networks
Abstract. We study the problem of evaluating RDF queries over structured overlay networks. We consider the publish/subscribe scenario where nodes subscribe with long-standing queri...
Erietta Liarou, Stratos Idreos, Manolis Koubarakis