481 search results - page 52 / 97 » Approximate XML Query Answers |
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
In this work a method for detecting distance-based outliers in data streams is presented. We deal with the sliding window model, where outlier queries are performed in order to de...
DKE
2008
13 years 7 months ago
2008
Keyword searching while very successful in narrowing down the contents of the Web to the pertaining subset of information, has two primary drawbacks. First, the accuracy of the se...
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...