3368 search results - page 264 / 674 » The Complexity of Query Reliability |
175
click to vote
CHI
2010
ACM
16 years 1 months ago
2010
ACM
Children want to find information about their world, but there are barriers to finding what they seek. Young people have varying abilities to formulate complex queries and compreh...
186
Voted
DBISP2P
2003
Springer
15 years 12 months ago
2003
Springer
In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p sys...
159
click to vote
DLOG
2007
15 years 9 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
214
click to vote
SPIESR
1997
15 years 8 months ago
1997
The development of increasingly complex multimedia applications calls for new methodologies for the organization and retrieval of still images and video sequences. Query and retri...
175
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...