2736 search results - page 108 / 548 » Indexing uncertain data |
145
click to vote
VLDB
2007
ACM
16 years 13 days ago
2007
ACM
In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing tech...
144
click to vote
SSD
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...
137
click to vote
VLDB
2000
ACM
15 years 10 months ago
2000
ACM
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
209
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— Many data-intensive websites use databases that grow much faster than the rate that users access the data. Such growing datasets lead to ever-increasing space and performance o...
153
click to vote
DEBU
2002
15 years 6 months ago
2002
The domain of spatiotemporal applications is a treasure trove of new types of data and queries. In this work, the focus is on a spatiotemporal sub-domain, namely the trajectories ...