311 search results - page 53 / 63 » Approximate XML joins |
117
click to vote
INFOCOM
2006
IEEE
15 years 5 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
14 years 11 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...
171
click to vote
SIGMOD
2006
ACM
15 years 11 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 ...
ICDE
2009
IEEE
15 years 6 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...
105
Voted
NETGAMES
2006
ACM
15 years 5 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 ...