921 search results - page 71 / 185 » New Data Structures for Orthogonal Range Searching |
130
click to vote
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
128
Voted
ESA
2000
Springer
15 years 7 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...
144
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
169
click to vote
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
With hundreds of millions of participants, social media services have become commonplace. Unlike a traditional social network service, a microblogging network like Twitter is a hy...
138
click to vote
PODS
2006
ACM
16 years 4 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...