806 search results - page 95 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
127
click to vote
SMC
2010
IEEE
14 years 11 months ago
2010
IEEE
—Deep Web contents are accessed by queries submitted to Web databases and the returned data records are enwrapped in dynamically generated Web pages (they will be called deep Web...
108
click to vote
SSDBM
2005
IEEE
15 years 7 months ago
2005
IEEE
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
102
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
With the growing use of dynamic web content generated from relational databases, traditional caching solutions for throughput and latency improvements are ineffective. We describe...
216
click to vote
SIGMOD
2006
ACM
16 years 1 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
100
click to vote
IMC
2005
ACM
15 years 7 months ago
2005
ACM
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...