2121 search results - page 232 / 425 » Indexing Incomplete Databases |
244
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous availability and high performance requires that such mergi...
172
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
176
click to vote
SSDBM
2007
IEEE
16 years 23 days ago
2007
IEEE
Applications that query data streams in order to identify trends, patterns, or anomalies can often benefit from comparing the live stream data with archived historical stream dat...
213
click to vote
SPIRE
2005
Springer
15 years 12 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
163
click to vote
VLDB
2005
ACM
15 years 12 months ago
2005
ACM
This paper presents the design of a read-optimized relational DBMS that contrasts sharply with most current systems, which are write-optimized. Among the many differences in its d...