2514 search results - page 349 / 503 » On the Computation of Approximations of Database Queries |
177
click to vote
SSDBM
2007
IEEE
16 years 1 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
191
click to vote
VLDB
1999
ACM
15 years 11 months ago
1999
ACM
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
184
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
177
click to vote
DEXAW
2010
IEEE
15 years 8 months ago
2010
IEEE
Internet is a huge source of information. Search engines have indexed much of this information and are able to extract the relevant webpages that are related to a given query. Howe...
299
click to vote
GIS
2004
ACM
16 years 7 months ago
2004
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock,...