Abstract: A method and system for effectively representing a result set in a limited amount of memory is provided. The result set is made up of a number of ordered rows. At least some of the rows contain row data, while each of the rows contains a bookmark that may be used to retrieve row data for the row. When it is determined that the size of the result set should be reduced, a subset of the rows of the result set is identified. The identified subset of rows is contiguous within the order of the results set and includes rows that contain row data. For each row of the identified subset, the row data is removed from the result set while retaining in the result set the bookmarks of the rows in the identified subset. As the result of the removal of row data, the size of the result set is reduced.

Abstract: A system and method for indexing words in documents, the system including a master index for storing the words and for storing associated index data. One of the documents is selected for updating and is edited. Next, a shadow index is created. Each word from the selected edited document is then indexed in the shadow index. A fresh index table is updated to indicate that the shadow index contains the most up-to-date data regarding the selected edited document. Query requests will be processed by searching all relevant indexes and comparing the retrieved results with the data in the fresh index table. Only the most up-to-date data will actually be returned as the query results. Periodically, shadow indexes and the master index can be merged into a new master index. Only the most up-to-date data, as determined by a comparison with the fresh index table, will be stored in the new master index.