2121 search results - page 122 / 425 » Indexing Incomplete Databases |
143
Voted
SSDBM
2006
IEEE
15 years 11 months ago
2006
IEEE
Many applicationsstore data items for a pre-determined, finite length of time. Examples include slidingwindows over on-line data streams, where old data are dropped as the window...
118
click to vote
ICIAR
2005
Springer
15 years 10 months ago
2005
Springer
A method for color indexing is proposed that is based upon nonparametric statistical techniques. Nonparametrics compare the ordinal rankings of sample populations, and maintain the...
136
click to vote
DEXA
2006
Springer
15 years 7 months ago
2006
Springer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
123
Voted
VLDB
2002
ACM
15 years 4 months ago
2002
ACM
We present a method for efficiently performing deletions and updates of records when the records to be deleted or updated are chosen by a range scan on an index. The traditional m...
125
Voted
EVOW
2003
Springer
15 years 10 months ago
2003
Springer
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NP-hard and known in the literature as...