2001 search results - page 107 / 401 » Indexing in a Hypertext Database |
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
PVLDB
2011
12 years 12 months ago
2011
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
CIVR
2007
Springer
14 years 3 months ago
2007
Springer
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...
VLDB
1999
ACM
14 years 1 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
DAWAK
2001
Springer
14 years 1 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...