Databaseindexing is a well studied problem. However, the advent of Hypertext databasesopensnew questionsin indexing. Searches are often demarcated by pointers between text items. Thus the scope of the search may change dynamically, whereastraditional indexes cover a statically defined region such as a relation. We present techniquesfor indexing in hypertext databasesand comparetheir performance.