2962 search results - page 205 / 593 » Optimizing Spatial Data Structures For Static Data |
187
click to vote
NIPS
2008
15 years 7 months ago
2008
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...
182
click to vote
MSV
2004
15 years 7 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
168
click to vote
DEXA
2005
Springer
15 years 12 months ago
2005
Springer
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
195
Voted
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
189
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...