184 search results - page 23 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
101
Voted
WWW
2005
ACM
16 years 13 days ago
2005
ACM
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
DNIS
2005
Springer
15 years 5 months ago
2005
Springer
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
BMCBI
2006
2006
Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy
14 years 11 months ago
Background: Understanding how amino acid substitutions affect protein functions is critical for the study of proteins and their implications in diseases. Although methods have bee...
ESA
2000
Springer
15 years 3 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
92
Voted
PODS
2006
ACM
15 years 12 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...