910 search results - page 118 / 182 » Efficient retrieval of replicated data |
130
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
As mobile devices with positioning capabilities continue to proliferate, data management for so-called trajectory databases that capture the historical movements of populations of...
258
click to vote
ICDE
2003
IEEE
16 years 5 months ago
2003
IEEE
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...
139
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...
158
click to vote
NIPS
2008
15 years 5 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
110
click to vote
FLAIRS
2004
15 years 5 months ago
2004
Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering ...