910 search results - page 118 / 182 » Efficient retrieval of replicated data |
CORR
2010
Springer
14 years 10 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...
192
click to vote
ICDE
2003
IEEE
15 years 11 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...
PODS
2006
ACM
15 years 10 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...
NIPS
2008
14 years 11 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...
FLAIRS
2004
14 years 11 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 ...