Indexing in a Hypertext Database
Download
Author
Christopher Clifton
Tech report number
CERIAS TR 2001-81
Entry type
conference
Abstract
Database indexing is a well studied problem. However,the advent of Hypertext databases opens new questions in indexing. Searches are often demarcated by pointers between text items. Thus the scope of the search may change dynamically, whereas traditional indexes cover a statically defined region such as a relation. We present techniques for indexing in hypertext databases and compare their performance.
Download
Date
1990 – 08
Key alpha
Clifton
Note
Proceedings of the 1990 conference on Very Large Data Bases
August 13-16, 1990 in Brisbane, Australia
Publication Date
2001-08-01

