Patents by Inventor Miroslaw A. Flasza
Miroslaw A. Flasza 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: 7266539Abstract: The invention herein provides method and apparatus for managing attribute-tagged index entries contained in an index by assigning or tagging an index entry attribute indicator to a newly inserted index entry (that is, at the time when a key data value is inserted into the index, the key data value becomes a newly inserted index entry and an attribute indicator is tagged to the newly inserted index entry). The index entry can be placed anywhere within the index. Once a group of attribute-tagged index entries have been inserted into the index, the attribute identifiers can be switched off instantaneously (that is, the attribute associated with the attribute indicators is disabled).Type: GrantFiled: April 22, 2003Date of Patent: September 4, 2007Assignee: International Business Machines CorporationInventors: Robert T. Berks, Miroslaw A. Flasza, Matthew A. Huras, Leo T. M. Lau, Catherine S. McArthur, David Tremaine, Gary Valentin, Michael J. Winer
-
Patent number: 7080206Abstract: A system and associated method load an input data stream into a multi-dimensional clustering (MDC) table or other structure containing data clustered along one or more dimensions, by assembling blocks of data in a partial block cache in which each partial block is associated with a distinct logical cell. A minimum threshold number of partial blocks may be maintained. Partial blocks may be spilled from the partial block cache to make room for new logical cells. Last partial pages of spilled partial blocks may be stored in a partial page cache to limit I/O if the cell associated with a spilled block is encountered later in the input data stream. Buffers may be reassigned from the partial block cache to the partial page cache if the latter is filled. Parallelism may be employed for efficiency during sorting of input data subsets and during storage of blocks to secondary storage.Type: GrantFiled: April 29, 2003Date of Patent: July 18, 2006Assignee: International Business Machines CorporationInventors: Robert T. Berks, Miroslaw A. Flasza, Leo Tat Man Lau, Mark D. Leitch, Sam S. Lightstone, David Tremaine
-
Patent number: 7069366Abstract: A system and method handle resource transaction requests. The system marks a waiting transaction request, having an access mode which is incompatible with the access mode of the executing transaction, with an ignore bit, so that a transaction request with an access mode compatible with the access mode of the executing transaction may receive a lock in order to access the resource. The transaction request is then marked with a bypass indicator such that when the executing transactions are finished accessing the resource, the waiting transaction request may be notified that it may have access to the resource. The system includes the ignore bit so that each transaction request that arrives after the ignore bit has been set, does not suffer from a long waiting time before being provided access to the resource.Type: GrantFiled: January 18, 2003Date of Patent: June 27, 2006Assignee: International Business Machines CorporationInventors: Sarah Posner, Miroslaw A. Flasza, Jeffrey J. Goss, Matthew A. Huras, Catherine S. McArthur, Lorysa M. Meadowcroft, Michael J. Winer, Roger L. Q. Zheng
-
Patent number: 7028022Abstract: A computer system for the indexing of data in which a heuristic determination function is applied to predict an efficient index updating approach. The system is able to update an index relating to a first data set by incrementally updating the index or by a rebuild of the index at the completion of the addition of a second set of data to the first set of data. The system applies a heuristic determination function to the characteristics of the first set of data, its index, and the second set of data, to predict whether an incremental update or a rebuild update of the index will result in a more efficient rebuild of the data. The system applies this approach to a restore and rollforward recovery or a data load operation to improve the efficiency of these operations.Type: GrantFiled: July 28, 2000Date of Patent: April 11, 2006Assignee: International Business Machines CorporationInventors: Sam S. Lightstone, Catherine S. McArthur, William T. O'Connell, Miroslaw A. Flasza
-
Publication number: 20060020605Abstract: Disclosed is a data processing system, a data processing system-implemented method and an article of manufacture for providing general user availability while integrity processing of rolled-in data is deferred and performed incrementally. The data processing system includes a data warehouse administration module for administering a data warehouse to include a table dividable into portions for containing rows of rolled-in data, a first and a second delimiter delimiting the start and the end respectively of each portion, a metadata element having an entry corresponding to the start and end delimiters delimiting each portion, a third delimiter for delimiting, between the first delimiter and the third delimiter, a sub-portion of the portion, and an operations management module having operation mechanisms for performing operations on the data warehouse responsive to the delimiters.Type: ApplicationFiled: July 20, 2004Publication date: January 26, 2006Applicant: International Business Machines CorporationInventors: Petrus Chan, Miroslaw Flasza, Dieu La, Bruce Lindsay, William O'Connell
-
Publication number: 20040123039Abstract: A system and associated method load an input data stream into a multi-dimensional clustering (MDC) table or other structure containing data clustered along one or more dimensions, by assembling blocks of data in a partial block cache in which each partial block is associated with a distinct logical cell. A minimum threshold number of partial blocks may be maintained. Partial blocks may be spilled from the partial block cache to make room for new logical cells. Last partial pages of spilled partial blocks may be stored in a partial page cache to limit I/O if the cell associated with a spilled block is encountered later in the input data stream. Buffers may be reassigned from the partial block cache to the partial page cache if the latter is filled. Parallelism may be employed for efficiency during sorting of input data subsets and during storage of blocks to secondary storage.Type: ApplicationFiled: April 29, 2003Publication date: June 24, 2004Applicant: International Business Machines CorporationInventors: Robert T. Berks, Miroslaw A. Flasza, Leo Tat Man Lau, Mark D. Leitch, Sam S. Lightstone, David Tremaine
-
Publication number: 20030233340Abstract: A method for ordering a first and a second character string is disclosed. The method comprises determining which of the two character strings has a lower collating weight according to a first dictionary sort order table with a non-unique collating sequence, and determining which of the two character strings has a lower collating weight according to a second dictionary sort order table with a unique collating sequence.Type: ApplicationFiled: April 22, 2003Publication date: December 18, 2003Inventors: Miroslaw A. Flasza, David C. Sharpe
-
Publication number: 20030204486Abstract: The invention herein provides method and apparatus for managing attribute-tagged index entries contained in an index by assigning or tagging an index entry attribute indicator to a newly inserted index entry (that is, at the time when a key data value is inserted into the index, the key data value becomes a newly inserted index entry and an attribute indicator is tagged to the newly inserted index entry). The index entry can be placed anywhere within the index. Once a group of attribute-tagged index entries have been inserted into the index, the attribute identifiers can be switched off instantaneously (that is, the attribute associated with the attribute indicators is disabled).Type: ApplicationFiled: April 22, 2003Publication date: October 30, 2003Inventors: Robert T. Berks, Miroslaw A. Flasza, Matthew A. Huras, Leo T. M. Lau, Catherine S. McArthur, David Tremaine, Gary Valentin, Michael J. Winer
-
Publication number: 20030145146Abstract: A system and method handle resource transaction requests. The system marks a waiting transaction request, having an access mode which is incompatible with the access mode of the executing transaction, with an ignore bit, so that a transaction request with an access mode compatible with the access mode of the executing transaction may receive a lock in order to access the resource. The transaction request is then marked with a bypass indicator such that when the executing transactions are finished accessing the resource, the waiting transaction request may be notified that it may have access to the resource.Type: ApplicationFiled: January 18, 2003Publication date: July 31, 2003Applicant: International Business Machines CorporationInventors: Sarah Posner, Miroslaw A. Flasza, Jeffrey J. Goss, Matthew A. Huras, Catherine S. McArthur, Lorysa M. Meadowcroft, Michael J. Winer, Roger L.Q. Zheng