Patents by Inventor Arne Schwarz
Arne Schwarz has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8074206Abstract: Method and computer system for software tuning. A computer system stores variables (210) for storing at least one threshold value for at least one parameter (P1) influencing the performance of a software application (200) with regards to a specific task. A threshold evaluator (220) compares (430) the at least one threshold value to at least one corresponding current value allowing the software application (200) to select (440) an algorithm (A1) from a plurality of algorithms (A1 to AN) for performing the task in accordance with the result of comparison.Type: GrantFiled: July 7, 2004Date of Patent: December 6, 2011Assignee: SAP AGInventors: Volker Sauermann, Axel Von Bergen, Arne Schwarz
-
Patent number: 7665030Abstract: A user interface element for manipulating Boolean expressions includes at least one tab panel element operable to define a term of a Boolean expression with each term including one or more condition statements, and an add tab element operable to add an additional tab panel element. The defined terms of each of the tab panel elements are combined to form the Boolean expression.Type: GrantFiled: November 5, 2002Date of Patent: February 16, 2010Assignee: SAP AktiengesellschaftInventors: Volker Sauermann, Axel Von Bergen, Arne Schwarz
-
Patent number: 7653452Abstract: Methods and computer systems are provided for reducing the runtime of a material requirements planning run. In one embodiment, a computer system loads a plurality of bills of materials into a data structure. The computer system may analyze parent-child relationships between components of the plurality of bills of materials in the data structure and set for each component in the data structure a counter value that indicates the number of parent components for each component. The counter value of a specific child component may be decremented when the planning of a parent component of the specific child component is completed. The computer system may then proceed with the planning of the specific child component if the associated counter value indicates that the planning of all parent components of the specific child component is completed.Type: GrantFiled: September 9, 2004Date of Patent: January 26, 2010Assignee: SAP AGInventors: Volker Sauermann, Axel Von Bergen, Arne Schwarz, Bernhard Lokowandt
-
Patent number: 7610582Abstract: Managing a computer system having a plurality of blades by detecting the presence of a new blade in the computer system; installing an operating system on the new blade; configuring the operation system; and copying a service that is running on an earlier detected blade to the new blade. Further features are testing services and operating system on the new blade and cyclically shifting services through the blades.Type: GrantFiled: March 25, 2004Date of Patent: October 27, 2009Assignee: SAP AGInventors: Wolfgang Becker, Axel Von Bergen, Volker Sauermann, Arne Schwarz, Guenter Zachmann
-
Patent number: 7590683Abstract: A method for restarting a process running on a first processor includes preparing a second processor, copying process context information to the second processor, starting a second process using the context information on the second processor, and terminating a first process running on the first processor. The second process performs an equivalent function to the first process.Type: GrantFiled: April 18, 2003Date of Patent: September 15, 2009Assignee: SAP AGInventors: Axel Von Bergen, Volker Sauermann, Arne Schwarz, Wolfgang Becker, Guenter Zachmann
-
Patent number: 7487165Abstract: A computer implemented method of retrieving hit count data from data base system comprises the steps of scanning through the bitmap data structure (7R) accessing only each Nth machine word (10f), determining a fuzzy number of hit-relevant bit values of each accessed machine word (10f), calculating an estimated hit count by multiplying the fuzzy number by N, and outputting the estimated hit count from the data base system.Type: GrantFiled: July 29, 2004Date of Patent: February 3, 2009Assignee: SAP AktiengesellschaftInventors: Volker Sauermann, Arne Schwarz, Axel Von Bergen
-
Patent number: 7373340Abstract: A computer implemented method for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set comprises storing data sets each including one or more attributes in a plurality of binary tree structures (1), each of said binary tree structures (1) with their nodes (2) representing the entity of one of the data attributes of the data sets in a sorted manner, receiving a query for searching and returning data sets according to query conditions in said given number and sorted by a sort attribute, accessing the binary tree structure (1) of said sort attribute, serially traversing the nodes (2) of said binary tree structure (1) according to the sort attribute, at each node (2) checking whether the data set associated to said node meets the query conditions and, if true, returning said data set, terminating said traversing when said given number of data sets is reached.Type: GrantFiled: August 27, 2004Date of Patent: May 13, 2008Assignee: SAP AktiengesellschaftInventors: Volker Sauermann, Arne Schwarz, Axel Von Bergen
-
Patent number: 7337295Abstract: A frame handler for application-level memory management includes an associated block of memory divided into instances such that data elements may be stored in the instances, a data structure identifying the unused instances within the block of memory, and an application interface operable to receive a request for an unused instance from a software application. The frame handler is operable to identify an unused instance in response to a request received by the application interface. In addition, a software application using application-level memory management includes an application-level memory manager operable to allocate a block of memory to store data elements with the block of memory divided into frames and each frame divided into instances, and application code operable to store data elements in instances of a block of memory allocated by the application-level memory manager.Type: GrantFiled: July 24, 2003Date of Patent: February 26, 2008Assignee: SAP AktiengesellschaftInventors: Axel Von Bergen, Volker Sauermann, Arne Schwarz
-
Patent number: 7310719Abstract: A method for allocating memory in a computer system includes allocating a block of memory from an operating system, dividing the block of memory into frames, and dividing each of the frames into instances such that each of the instances is operable to store data. In addition, a software application using application-level memory management includes an application-level memory manager operable to allocate a block of memory to store data elements with the block of memory divided into frames and each frame divided into instances, and application code operable to store data elements in instances of a block of memory allocated by the application-level memory manager.Type: GrantFiled: July 24, 2003Date of Patent: December 18, 2007Assignee: Sap AktiengesellschaftInventors: Axel Von Bergen, Volker Sauermann, Arne Schwarz
-
Patent number: 7257599Abstract: Techniques are described for organizing data in a fast query system. Data structures are provided, where each of the data structures forms part of at least one traversable structure and represents at least a first value of a first attribute of a data record forming a body of data records. Each of at least some of the data structures are associated with at least one other data structure forming part of another traversable structure, where the other data structure represents at least a second value of a second attribute of the data record.Type: GrantFiled: August 8, 2003Date of Patent: August 14, 2007Assignee: SAP AktiengesellschaftInventors: Volker Sauermann, Axel Von Bergen, Arne Schwarz
-
Patent number: 7231387Abstract: Techniques are described for performing logical operations, where the techniques generally involve the use of dynamic flags used as markers to build a result set in response to a search query. The dynamic flags within a result set may be guide elements linked to one another, and to their respective data records and attributes, via pointers. In this case, the groups of guide elements forming result sets may each also be linked to one another via pointers, and may each be associated with a counter for counting a number of guide elements within a corresponding result set. The dynamic flags also may be individual bits within a bitmap, where the bitmap is linked to a particular result set identifier via a pointer, and the individual bitmaps are linked to their corresponding data record(s) via a relative addressing scheme. In this case, a counter also may be used to determine a number of hits within a result set (bitmap), before, during, and after a particular logical operation.Type: GrantFiled: October 3, 2003Date of Patent: June 12, 2007Assignee: SAP AktiengesellschaftInventors: Volker Sauermann, Axel Von Bergen, Arne Schwarz
-
Patent number: 7222308Abstract: A graphical user interface element for modifying parameters of a graphing widget includes a first slider bar with a first slider control operable to adjust a first parameter of a graphing widget, and a second slider bar with a second slider control operable to adjust a second parameter of the graphing widget. The parameters may be modified to adjust the a graphical representation of data displayed by the graphing widget.Type: GrantFiled: July 31, 2002Date of Patent: May 22, 2007Assignee: SAP AktiengesellschaftInventors: Volker Sauermann, Axel Von Bergen, Arne Schwarz
-
Publication number: 20070083861Abstract: Managing a computer system having a plurality of blades by detecting the presence of a new blade in the computer system; installing an operating system on the new blade; configuring the operation system; and copying a service that is running on an earlier detected blade to the new blade. Further features are testing services and operating system on the new blade and cyclically shifting services through the blades.Type: ApplicationFiled: March 25, 2004Publication date: April 12, 2007Inventors: Wolfgang Becker, Axel von Bergen, Volker Sauermann, Arne Schwarz, Guenter Zachmann
-
Publication number: 20070044082Abstract: Method and computer system for software tuning. A computer system stores variables (210) for storing at least one threshold value for at least one parameter (P1) influencing the performance of a software application (200) with regards to a specific task. A threshold evaluator (220) compares (430) the at least one threshold value to at least one corresponding current value allowing the software application (200) to select (440) an algorithm (A1) from a plurality of algorithms (A1 to AN) for performing the task in accordance with the result of comparison.Type: ApplicationFiled: July 7, 2004Publication date: February 22, 2007Inventors: Volker Sauermann, Axel Bergen, Arne Schwarz
-
Publication number: 20050210011Abstract: A computer implemented method of retrieving hit count data from data base system comprises the steps of scanning through the bitmap data structure (7R) accessing only each Nth machine word (10f), determining a fuzzy number of hit-relevant bit values of each accessed machine word (1f), calculating an estimated hit count by multiplying the fuzzy number by N, and outputting the estimated hit count from the data base system.Type: ApplicationFiled: July 29, 2004Publication date: September 22, 2005Applicant: SAP AktiengesellschaftInventors: Volker Sauermann, Arne Schwarz, Axel Von Bergen
-
Publication number: 20050080690Abstract: Methods and computer systems are provided for reducing the runtime of a material requirements planning run. In one embodiment, a computer system loads a plurality of bills of materials into a data structure. The computer system may analyze parent-child relationships between components of the plurality of bills of materials in the data structure and set for each component in the data structure a counter value that indicates the number of parent components for each component. The counter value of a specific child component may be decremented when the planning of a parent component of the specific child component is completed. The computer system may then proceed with the planning of the specific child component if the associated counter value indicates that the planning of all parent components of the specific child component is completed.Type: ApplicationFiled: September 9, 2004Publication date: April 14, 2005Inventors: Volker Sauermann, Axel Bergen, Arne Schwarz, Bernhard Lokowandt
-
Publication number: 20050060302Abstract: A computer implemented method for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set comprises storing data sets each including one or more attributes in a plurality of binary tree structures (1), each of said binary tree structures (1) with their nodes (2) representing the entity of one of the data attributes of the data sets in a sorted manner, receiving a query for searching and returning data sets according to query conditions in said given number and sorted by a sort attribute, accessing the binary tree structure (1) of said sort attribute, serially traversing the nodes (2) of said binary tree structure (1) according to the sort attribute, at each node (2) checking whether the data set associated to said node meets the query conditions and, if true, returning said data set, terminating said traversing when said given number of data sets is reached.Type: ApplicationFiled: August 27, 2004Publication date: March 17, 2005Applicant: SAP AktiengesellschaftInventors: Volker Sauermann, Arne Schwarz, Axel Von Bergen
-
Publication number: 20050055331Abstract: A computer implemented method for storing data in and retrieving data from a data storage system comprises the steps of calculating a dynamic bitmap data structure (7B) for at least one result set of a defined query condition concerning a data attribute included in a first query, storing said calculated bitmap data structure (7B) associated to said defined query condition in a cache memory of said data storage system, and accessing to said calculated bitmap data structure (7B) stored in said cache memory means to process at least a second query including said defined query condition.Type: ApplicationFiled: July 29, 2004Publication date: March 10, 2005Applicant: SAP AktiengesellschaftInventors: Volker Sauermann, Arne Schwarz, Axel Von Bergen
-
Publication number: 20050021924Abstract: A method for allocating memory in a computer system includes allocating a block of memory from an operating system, dividing the block of memory into frames, and dividing each of the frames into instances such that each of the instances is operable to store data. In addition, a software application using application-level memory management includes an application-level memory manager operable to allocate a block of memory to store data elements with the block of memory divided into frames and each frame divided into instances, and application code operable to store data elements in instances of a block of memory allocated by the application-level memory manager.Type: ApplicationFiled: July 24, 2003Publication date: January 27, 2005Inventors: Axel Bergen, Volker Sauermann, Arne Schwarz
-
Publication number: 20050021506Abstract: Techniques are described for performing logical operations, where the techniques generally involve the use of dynamic flags used as markers to build a result set in response to a search query. The dynamic flags within a result set may be guide elements linked to one another, and to their respective data records and attributes, via pointers. In this case, the groups of guide elements forming result sets may each also be linked to one another via pointers, and may each be associated with a counter for counting a number of guide elements within a corresponding result set. The dynamic flags also may be individual bits within a bitmap, where the bitmap is linked to a particular result set identifier via a pointer, and the individual bitmaps are linked to their corresponding data record(s) via a relative addressing scheme. In this case, a counter also may be used to determine a number of hits within a result set (bitmap), before, during, and after a particular logical operation.Type: ApplicationFiled: October 3, 2003Publication date: January 27, 2005Inventors: Volker Sauermann, Axel Bergen, Arne Schwarz