2001 search results - page 221 / 401 » Indexing in a Hypertext Database |
SIGMOD
2012
ACM
12 years 1 months ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
ICDE
2008
IEEE
15 years 4 days ago
2008
IEEE
We identify and formalize a novel join operator for two spatial pointsets P and Q. The common influence join (CIJ) returns the pairs of points (p, q), p P, q Q, such that there e...
ICDE
2006
IEEE
15 years 4 days ago
2006
IEEE
The problem of frequently updating multi-dimensional indexes arises in many location-dependent applications. While the R-tree and its variants are one of the dominant choices for ...
ICDE
2005
IEEE
15 years 4 days ago
2005
IEEE
Semantic caching enables mobile clients to answer spatial queries locally by storing the query descriptions together with the results. However, it supports only a limited number o...
SIGMOD
2005
ACM
14 years 11 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...