505 search results - page 84 / 101 » Queries with Incomplete Answers over Semistructured Data |
119
Voted
GPC
2007
Springer
15 years 3 months ago
2007
Springer
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
105
click to vote
HPDC
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, wit...
DLOG
2010
14 years 7 months ago
2010
Abstract. A usage scenario of bio-ontologies is hypothesis testing, such as finding relationships or new subconcepts in the data linked to the ontology. Whilst validating the hypot...
149
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
Web search engines consistently collect information about users interaction with the system: they record the query they issued, the URL of presented and selected documents along w...