System and method for performing a data uniqueness check in a sorted data set

• US 20060122963A1
• Filed: 11/08/2004
• Published: 06/08/2006
• Est. Priority Date: 11/08/2004
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Sinha, Bipul, Ganesh, Amit, Klein, Jonathan
• Granted Patent: US 7,752,181 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/22 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/2365 Ensuring data consistency and integrity

Abstract

Embodiments of the present invention include a method for performing a data uniqueness check in a set of sorted data blocks comprising accessing data to be inserted into the set of sorted data blocks, determining a proper data block of the set of sorted data blocks for which the data to be inserted should be located based on a first sorting key. The method further includes examining the proper data block for an existing data entry and if the proper data block is empty, the method further includes inserting the data to be inserted into the proper data block of the set of sorted data blocks.

Claims

1. ) A method for performing data uniqueness checking in a set of memory stored and sorted data blocks comprising:

accessing data to be inserted into said set of sorted data blocks;

determining a proper data block of said set of sorted data blocks for which said data to be inserted should be located based on a first sorting key;

examining said proper data block for an existing data entry; and

if said proper data block is empty, inserting said data to be inserted into said proper data block of said set of sorted data blocks.

2. ) The method as recited in claim 1 further comprising:

if said proper data block comprises an existing entry, determining whether said proper data block is pinned or unpinned.

3. ) The method as recited in claim 2 further comprising:

in response to determining that said proper data block is unpinned, generating a uniqueness error indicating said data to be inserted is a duplicate of said existing entry of said set of sorted data blocks.

4. ) The method as recited in claim 2 further comprising:

in response to determining that said proper data block is pinned, determining if said proper data block is either committed or rolled back.

5. ) The method as recited in claim 4 further comprising:

in response to determining that said proper data block is committed, generating a uniqueness error indicating said data to be entered is a duplicate of said existing entry of said set of sorted data blocks.

6. ) The method as recited in claim 4 further comprising:

in response to determining that said proper data block is rolled back, inserting said data to be inserted into said proper data block of said set of sorted data blocks.

7. ) The method as recited in claim 1 further comprising:

determining that said proper data block is associated with deleted data;

accessing an undo log pointer associated with said deleted data;

accessing a data block pointed to by said undo log pointer wherein said data block comprises said deleted data; and

determining a value of said deleted data.

8. ) The method as recited in claim 7 further comprising:

in response to determining that said value of said deleted data is different than a value of said data to be inserted, inserting said data to be inserted into said proper location of said set of sorted data blocks.

9. ) The method as recited in claim 7 further comprising:

in response to determining that said value of said deleted data is equal to a value of said data to be inserted, determining said data comprises said first sorting key.

10. ) The method as recited in claim 9 further comprising:

in response to determining that said deleted data comprises a second sorting key that is different from said first sorting key, inserting said data to be inserted into said proper location of said set of sorted data blocks.

11. ) A system for performing data uniqueness checking in a set of sorted data blocks comprising:

a data accessor for accessing data to be entered into said set of sorted data blocks which are memory stored;

a location determiner for determining a proper location of said set of sorted data blocks for which said data to be entered should be entered, based on a first sorting key;

an examiner for examining said proper location for an existing entry; and

a data inserter for inserting said data to be inserted in said proper location of said set of sorted data blocks.

12. ) The system as recited in claim 11 further comprising:

a lock status determiner for determining if an existing entry of said proper location is either pinned or unpinned.

13. ) The system as recited in claim 12 further comprising:

an error generator for generating a uniqueness error if said existing entry of said proper location is determined to be unpinned.

14. ) The system as recited in claim 13 further comprising:

a commitment determiner for determining if a pinned data block is either committed or rolled back.

15. ) The system as recited in claim 11 wherein said examiner is configured to identify deleted data associated with said proper location of said set of sorted data blocks.

16. ) The system as recited in claim 15 further comprising:

an undo log pointer accessor for accessing an undo log pointer associated with said deleted data.

17. ) The system as recited in claim 16 further comprising:

a value determiner for determining a value of said deleted data.

18. ) The system as recited in claim 17 further comprising:

a comparator for comparing said value of said deleted data to a value of an existing entry of said proper location of said set of sorted data blocks.

19. ) The system as recited in claim 15 further comprising:

a key comparer for comparing a second sorting key associated with said deleted data to said first sorting key.

20. ) A computer readable medium comprising executable instructions which, when executed in a processing system, causes the system to implement a method of performing data uniqueness checking in a set of sorted, and stored in memory, data blocks comprising:

accessing data to be inserted into said set of sorted data blocks;

determining a proper data block of set of sorted data blocks for which said data to be inserted should be located based on a first sorting key;

examining said proper data block for an existing data entry; and

if said proper data block is empty, inserting said data to be inserted into said proper data block of said set of sorted data blocks.

21. ) The computer readable medium as recited in claim 20 wherein said method further comprises:

if said proper data block comprises an existing entry, determining whether said proper data block is pinned or unpinned.

22. ) The computer readable medium as recited in claim 21 wherein said method further comprises:

in response to determining that said proper data block is unpinned, generating a uniqueness error indicating said data to be inserted is a duplicate of said existing entry of said set of sorted data blocks.

23. ) The computer readable medium as recited in claim 21 wherein said method further comprises:

in response to determining that said proper data block is pinned, determining if said proper data block is either committed or rolled back.

24. ) The computer readable medium as recited in claim 23 wherein said method further comprises:

in response to determining that said proper data block is committed, generating a uniqueness error indicating said data to be entered is a duplicate of said existing entry of said set of sorted data blocks.

25. ) The computer readable medium as recited in claim 23 wherein said method further comprises:

in response to determining that said proper data block is rolled back, inserting said data to be inserted into said proper data block of said set of sorted data blocks.

26. ) The computer readable medium as recited in claim 20 wherein said method further comprises:

determining that said proper data block is associated with deleted data;

accessing an undo log pointer associated with said deleted data;

accessing a data block pointed to by said undo log pointer wherein said data block comprises said deleted data; and

determining a value of said deleted data.

27. ) The computer readable medium as recited in claim 26 wherein said method further comprises:

in response to determining that said value of said deleted data is different than a value of said data to be inserted, inserting said data to be inserted into said proper location of said set of sorted data blocks.

28. ) The computer readable medium as recited in claim 26 wherein said method further comprises:

in response to determining that said value of said deleted data is equal to a value of said data to be inserted, determining said data comprises said sorting key.

29. ) The computer readable medium as recited in claim 28 wherein said method further comprises:

in response to determining that said deleted data comprises a second sorting key that is different from said first sorting key, inserting said data to be inserted into said proper location of said set of sorted data blocks.