Method and system for scrollable cursors

• US 6,973,457 B1
• Filed: 05/10/2002
• Issued: 12/06/2005
• Est. Priority Date: 05/10/2002
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Gollapudi, Sreenivas, Krishnaswamy, Srinath, Chidambaran, Lakshminarayanan, Bastawala, Mehul
• Primary Examiner(s): Pardo, Thuy N.
• Application Number:
  US10/144,665
• Time in Patent Office: 1,306 Days
• Field of Search: 707/2, 707/3, 707/7, 707/10, 707/1, 707/203, 707/205, 707/101, 707/102, 707/103, 707/104, 715/26, 709/224, 709/200
• US Class Current: 707/770
• CPC Class Codes: G06F 16/2438 Embedded query languages
• CPC Class Codes: G06F 16/24552 Database cache management
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

A method and system for implementing scrollable cursors is described. A multi-tier caching structure is maintained, in which a partial result set is cached at the client computer and a more-complete result set is cached at the server computer. If the cursor is scrolled in either the forward or backward directions, the partial result set cached at the client computer is first checked to see if requested data is present. If so, then the requested data is fetched from the client cache and the current position of the cursor is moved to the appropriate position in the result set. If the requested data is not present in the client cache, then those data items are fetched from the cache at the server computer.

Claims

1. A method for scrolling a cursor in a database system, comprising:

a) executing a query at a server to produce a result set;

b) storing the result set at a first cache at the server;

c) storing a portion of the result set at a second cache at a client;

d) receiving a request to scroll a cursor from a current position to a different position within the result set;

e) determining whether a data item corresponding to the different position within the result set exists in the second cache;

f) if the data item corresponding to the different position within the result set exists in the second cache, then scrolling the cursor to the different position; and

g) if the data item corresponding to the different position within the result set does not exist in the second cache, then fetching the data item from the result set at the first cache.

2. The method of claim 1 in which the first cache at the server maintains all of the result set.

3. The method of claim 1 in which the first cache maintains a portion of the result set.

4. The method of claim 1 in which the request to scroll the cursor is a backward scrolling request.

5. The method of claim 1 in which the result set comprises a user-defined datatype.

6. The method of claim 1 in which the second cache is limited in size based upon maximum number of rows.

7. The method of claim 1 in which the first cache is configured with objects not employing transaction overhead.

8. The method of claim 7 in which the objects comprise a temporary LOB.

9. The method of claim 8 in which the temporary LOB is associated with a LOB index to map storage locations.

10. The method of claim 8 in which the temporary LOB is associated with a mapping object to associate a portion of the result set with a LOB address.

11. The method of claim 7 in which the objects are configured without transaction logging.

12. The method of claim 1 wherein the request to scroll the cursor results in a distributed database query.

13. The method of claim 1 in which executing the query at the server involves data located at a second server.

14. The method of claim 13 in which the request is sent for processing to the second server.

15. The method of claim 13 in which the request is processed at the server and the data is sent from the second server to the server.

16. The method of claim 13 in which a determination of whether to send the request or data between the server and the second server is based upon distribution of data located between the server and the second server that is accessed by the query.

17. The method of claim 1 further comprising prefetching part of the result set to the second cache.

18. The method of claim 17 in which prefetching occurs based upon designating a prefetch count between the client and the server.

19. A system for scrolling a cursor in a database system, comprising:

a) means for executing a query at a server to produce a result set;

b) means for storing the result set at a server cache;

c) means for storing a portion of the result set at a client cache;

d) means for receiving a request to scroll a cursor from a current position to a new position within the result set;

e) means for determining whether a data item corresponding to the new position within the result set exists in the client cache;

f) means for determining if the data item corresponding to the new position within the result set exists in the client cache, and then scrolling the cursor to the new position if it exists; and

g) means for determining if the data item corresponding to the new position within the result set does not exist in the client cache, and then fetching the data item from the result set at the server cache if it does not exist.

20. The system of claim 19 in which the first cache at the server maintains all of the result set.

21. The system of claim 19 in which the first cache maintains a portion of the result set.

22. The system of claim 19 in which the request to scroll the cursor is a backward scrolling request.

23. The system of claim 19 in which the result set comprises a user-defined datatype.

24. The system of claim 19 in which the second cache is limited in size based upon maximum number of rows.

25. The system of claim 19 in which the first cache is configured with objects not employing transaction overhead.

26. The system of claim 19, further comprising means for creating a distributed database query based on the received request.

27. The system of claim 19, in which the means for executing the query at the server uses data located at a second server.

28. The system of claim 19, further comprising means for prefetching part of the result set to the client cache.

29. A computer program product comprising a executable code to execute a process for scrolling a cursor in a database system, the process comprising the steps of:

a) executing a query at a server to produce a result set;

b) storing the result set at a server cache;

c) storing a portion of the result set at a client cache;

d) receiving a request to scroll a cursor from a current position to a new position within the result set;

e) determining whether a data item corresponding to the new position within the result set exists in the client cache;

f) if the data item corresponding to the new position within the result set exists in the client cache, then scrolling the cursor to the new position; and

g) if the data item corresponding to the new position within the result set does not exist in the client cache, then fetching the data item from the server cache.

30. The computer program product of claim 29 in which the first cache at the server maintains all of the result set.

31. The computer program product of claim 29 in which the first cache maintains a portion of the result set.

32. The computer program product of claim 29 in which the request to scroll the cursor is a backward scrolling request.

33. The computer program product of claim 29 in which the result set comprises a user-defined datatype.

34. The computer program product of claim 29 in which the second cache is limited in size based upon maximum number of rows.

35. The computer program product of claim 29 in which the first cache is configured with objects not employing transaction overhead.

36. The computer program product of claim 29, wherein the request to scroll the cursor results in a distributed database query.

37. The computer program product of claim 29, wherein the process further comprises prefetching part of the result set to the client cache.