Handling changes in automatic sort

US10467207B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10467207-B2
Application numberUS-201313902666-A
CountryUS
Kind codeB2
Filing dateMay 24, 2013
Priority dateMay 24, 2013
Publication dateNov 5, 2019
Grant dateNov 5, 2019

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

In an example embodiment, a tri-state variable associated with a table in a database indicates whether the table is automatically sorted at runtime or left unsorted. The value of the tri-state variable also indicates whether code associated with the table assumes the table will be sorted at runtime. In a situation where two parties have code that utilize the table, when the first ensures its code to no longer assumes the table will be sorted, they may set the value of the tri-state variable from automatic sorting enforced to automatic sorting recommended. In this state the table will still be automatically sorted at runtime. When the second ensures its code no longer assumes the table will be sorted, they may set the value of the tri-state variable from automatic sorting recommended to no automatic sort at which time the table is left unsorted.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: identifying a value of a tri-state variable associated with a data structure, the data structure utilized by a sequence of instructions executable on a processor, the value of the tri-state variable being selected from the group consisting of a function enforced state, a function recommended state, and a function not provided state; when the value of the tri-state variable is the function enforced state, providing a function upon execution of the sequence of instructions; when the value of the tri-state variable is the function recommended state, providing the function upon execution of the sequence of instructions; when the value of the tri-state variable is the function not provided state, not providing the function upon execution of the sequence of instructions; and further comprising enforcing a set of state transition rules on the value of the tri-state variable. 2. The method of claim 1 wherein the set of state transition rules comprises: when the value of the tri-state variable is the function enforced state, precluding changes to the value of the tri-state variable by entities other than a first entity until the first entity changes the value of the tri-state variable from the function enforced state to the function recommended state; and when the value of the tri-state variable is the function recommended state, allowing entities other than the first entity to change the value of the tri-state variable from the function recommended state to the function not provided state. 3. The method of claim 1 further comprising issuing a warning if an entity attempts to violate the state transition rules. 4. The method of claim 3 , wherein the data structure is utilized by a second sequence of instructions provided by a second entity and wherein the value of the tri-state variable may be changed from the function recommended state to the function not provided state by the second entity. 5. The method of claim 1 , wherein the sequence of instructions is provided by a first entity and wherein changing the value of the tri-state variable from the function enforced state to the function recommended state may only be performed by the first entity. 6. The method of claim 1 , further comprising setting the value of the tri-state variable to indicate whether the sequence of instructions assumes the function will be provided. 7. The method of claim 1 , wherein the value of the tri-state variable is set at the time the sequence of instructions are created or modified. 8. A system comprising: memory; a computer processor coupled to the memory; instructions stored in the memory and executable by the processor, the instructions configuring the system to: associate a tri-state variable with a table for use in a database, the tri-state variable having a value selected from the group consisting of an automatic sort enforced state, an automatic sort recommended state, and an automatic sort not provided state, the value of the tri-state variable determining whether automatic sorting is performed on the table at run time; receive a request to change the value of the tri-state variable from a current value to a next value; and enforce a set of state transition rules in order to determine whether to change the value of the tri-state variable from the current value to the next value, the state transition rules being dependent upon the entity, the current value, and the next value. 9. The system of claim 8 , wherein the tri-state variable is associated with a table definition that defines the table. 10. The system of claim 9 , wherein the table definition defines the table in a database independent manner and wherein the table definition resides in a data dictionary. 11. The system of claim 8 , wherein the set of state transition rules comprises: when the request is associated with a first entity and when the current value is the automatic sort enforced state and when the next value is the automatic sort recommended state, setting the value to the next value; and when the request is associated with a second entity and when the current value is the automatic sort recommended state and when the next value is the automatic sort not provided state, setting the value to the next value. 12. The system of claim 11 , wherein the set of state transition rules further comprises: when the request is associated with the first entity and when the current value is the automatic sort recommended state and when the next value is the automatic sort enforced state, issuing a warning and setting the value to the next value; and when the request is associated with the first entity and when the current value is the automatic sort not provided state and when the next value is the automatic sort recommended state and when the current value was set based on a request by the second entity, leaving the value at the current value. 13. The system of claim 8 , wherein automatic sort is provided by a runtime environment when value of the tri-state variable is automatic sort enforced or automatic sort recommended and wherein automatic sort is not provided by the runtime environment when the value of the tri-state variable is automatic sort not provided. 14. A machine-readable storage medium comprising instructions that, when executed by at least one processor of a machine, configure the machine to: receive a request to modify a value of a tri-state variable associated with a data structure from a current value to a next value, the current value and the next value being selected from a group consisting of a function enforced state, a function recommended state, and a function not provided state; when the current value is the function enforced state, and when the next value is the function recommended state, set the value of the tri-state variable to the next value; when the current value is the function recommended state, and when the next value is the function not provided state, set the value of the tri-state variable to the next value; and when the current value is the function not provided state and when the next value is the function enforced state, issue a warning. 15. The machine-readable storage medium of claim 14 , wherein the instructions further configure the machine to issue a warning when the current value is the function not provided state and when the next value is the function recommended state. 16. The machine-readable storage medium of claim 14 , wherein the instructions further configure the machine to issue a warning when the current value is the function recommended state and when the next value is the function enforced state. 17. The machine-readable storage medium of claim 14 , wherein the instructions further configure the machine to set the value of the tri-state variable to the next value when the current value is the function enforced state and when the next value is the function not provided state. 18. The machine-readable storage medium of claim 14 , wherein the instructions further configure the machine to: identify an entity associated with the request to modify the value of the tri-state variable; and wherein when the current value is the function enforced state, and when the next value is the function recommended state, the instructions configure the machine to set the value of the tri-state variable to the next value when the entity associated with the request is a first entity; and wherein when the current value is the function recommended state, and when the next value is the function not provided state,

Assignees

Inventors

Classifications

  • G06F16/217Primary

    Database tuning (G06F16/2282 takes precedence; database performance monitoring G06F11/3409) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10467207B2 cover?
In an example embodiment, a tri-state variable associated with a table in a database indicates whether the table is automatically sorted at runtime or left unsorted. The value of the tri-state variable also indicates whether code associated with the table assumes the table will be sorted at runtime. In a situation where two parties have code that utilize the table, when the first ensures its co…
Who is the assignee on this patent?
Kemmler Andreas, Sap Se
What technology area does this patent fall under?
Primary CPC classification G06F16/217. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Nov 05 2019 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).