705 search results - page 12 / 141 » Approximating Extended Answer Sets |
EDBT
2009
ACM
15 years 27 days ago
2009
ACM
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
FOIKS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
87
Voted
TSMC
2010
14 years 4 months ago
2010
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...