311 search results - page 53 / 63 » Approximate XML joins |
144
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
CORR
2004
Springer
15 years 1 months ago
2004
Springer
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
185
Voted
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
119
click to vote
ICDE
2009
IEEE
15 years 8 months ago
2009
IEEE
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
124
click to vote
NETGAMES
2006
ACM
15 years 7 months ago
2006
ACM
In first person shooter (FPS) games the round trip time (RTT) (delay, or ‘lag’) between a client and server is an important criterion for players when deciding which server to ...