921 search results - page 33 / 185 » New Data Structures for Orthogonal Range Searching |
150
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: The exponential growth of research in molecular biology has brought concomitant proliferation of databases for stocking its findings. A variety of protein sequence dat...
131
Voted
KDD
1998
ACM
15 years 8 months ago
1998
ACM
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
98
Voted
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
In this article we propose a new hashing framework for tree-structured data. Our method maps an unordered tree into a multiset of simple wedge-shaped structures refered to as pivot...
143
Voted
GIR
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
134
Voted
EDBT
2000
ACM
15 years 7 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 ...