Abstract: Most commercial database systems support B+-tree indexes using either 1) physical row identifiers, for example, DB2 or 2) logical row identifiers, for example, NonStop SQL. Physical row identifiers provide fast access to data. However, unlike logical row identifiers, they need to be updated whenever the row moves. This paper describes an alternate approach where hybrid row identifiers are used. A hybrid row identifier consists of two components: 1) a logical component, namely, the primary key of the base table row, and 2) a physical component, namely, the Database Block Address (DBA) of the row. By treating the DBA as a guess regarding where the row may be found, performance comparable to physical B+-tree indexes is attained for valid guess-DBAs. This scheme retains the logical index advantage of avoiding an immediate index update when the base table row moves. Instead, an online utility can be used to lazily fix the invalid guess-DBAs. This scheme has been used to implement B+-tree indexes for Oracle8i index-organized tables (primary B+-tree like structure) which encounter both row movement and table reorganization. It can also be applied to conventional tables that undergo some form of row movement such as replication or transportation of data. This paper discusses the following: 1) key concepts for supporting B+-tree indexes with hybrid row identifiers, 2) performance study comparing such indexes with physical B+-tree indexes, and 3) applicability of B+-tree indexes with hybrid row identifiers to speed up table replication (full-refresh), to increase index availability, and to support online table operations.