2514 search results - page 113 / 503 » On the Computation of Approximations of Database Queries |
263
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
171
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
197
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
164
click to vote
PVLDB
2008
15 years 5 months ago
2008
Given a dataset containing sensitive personal information, a statistical database answers aggregate queries in a manner that preserves individual privacy. We consider the problem ...
174
click to vote
EDBT
2002
ACM
16 years 6 months ago
2002
ACM
Abstract. This work addresses the problem of querying moving objects databases. which capture the inherent uncertainty associated with the location of moving point objects. We addr...