3341 search results - page 217 / 669 » On Bounded Queries and Approximation |
251
Voted
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...
161
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...
187
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...
149
click to vote
ITCC
2003
IEEE
15 years 11 months ago
2003
IEEE
We examine whether the use of query operators changes the documents retrieved by three popular Web search engines. One hundred queries containing query operators were selected fro...
200
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...