2001 search results - page 52 / 401 » Indexing in a Hypertext Database |
ECIR
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. In this paper, we propose a common phrase index as an efficient index structure to support phrase queries in a very large text database. Our structure is an extension of ...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
VLDB
2000
ACM
14 years 13 days ago
2000
ACM
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
The storage manager of a general-purpose database system can retain consistent disk page level snapshots and run application programs "back-in-time" against long-lived p...
ICCS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...