806 search results - page 85 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
171
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
109
click to vote
EDBT
2000
ACM
15 years 5 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
126
click to vote
BMCBI
2006
15 years 1 months ago
2006
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
123
click to vote
MSV
2004
15 years 2 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
109
click to vote
CIKM
2005
Springer
15 years 7 months ago
2005
Springer
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...