806 search results - page 33 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data...
LCN
2008
IEEE
14 years 2 months ago
2008
IEEE
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
FOCS
2000
IEEE
14 years 2 days ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...