Patents by Inventor Akira Shibamiya
Akira Shibamiya 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: 7792825Abstract: A method for fetching an ordered first N rows of a table, includes: reading a row in the table; determining that the read row qualifies as the first N rows of the table for rows read so far, and storing data of the read row; and determining an order of data of qualifying rows and storing the order. Only data in rows that qualify to be among the first N rows are ordered and stored. This provides a significantly more efficient processing. It eliminates tournament tree sorts, corresponding work file read and write I/O's, and associated CPU time. This reduces the time for the running of a query and improves the performance of other applications sharing the use of work files. Further, the improved performance is particular significant when the buffer sizes are within a page of records or rows, although multiple pages may be used.Type: GrantFiled: September 8, 2005Date of Patent: September 7, 2010Assignee: International Business Machines CorporationInventors: Akiko Hoshikawa, Allan B. Lebovitz, Akira Shibamiya
-
Publication number: 20080288495Abstract: Fetching an ordered first N rows of a table, includes: reading a row in the table; determining that the read row qualifies as the first N rows of the table for rows read so far, and storing data of the read row; and determining an order of data of qualifying rows and storing the order. Only data in rows that qualify to be among the first N rows are ordered and stored. This provides a significantly more efficient processing. It eliminates tournament tree sorts, corresponding work file read and write I/O's, and associated CPU time. This reduces the time for the running of a query and improves the performance of other applications sharing the use of work files. Further, the improved performance is particular significant when the buffer sizes are within a page of records or rows, although multiple pages may be used.Type: ApplicationFiled: August 3, 2008Publication date: November 20, 2008Applicant: International Business Machines CorporationInventors: Akiko Hoshikawa, Allan B. Lebovitz, Akira Shibamiya
-
Patent number: 7225209Abstract: A method and article of manufacture, implementing the method, allocates space for a dataset. The dataset has an initial area and zero or more additional allocated areas to provide space for storing the dataset. The size of a new additional area is determined. The new additional area is associated with a new area number, and the size of the new additional area is based on the new area number. Additional space for the dataset is allocated based on the size of the new additional area.Type: GrantFiled: November 6, 2003Date of Patent: May 29, 2007Assignee: International Business Machines CorporationInventors: Michael John Bracey, John Joseph Campbell, Julie Chen, Akira Shibamiya, Bryan Frederick Smith, James Zu-Chia Teng
-
Publication number: 20070061280Abstract: A method for fetching an ordered first N rows of a table, includes: reading a row in the table; determining that the read row qualifies as the first N rows of the table for rows read so far, and storing data of the read row; and determining an order of data of qualifying rows and storing the order. Only data in rows that qualify to be among the first N rows are ordered and stored. This provides a significantly more efficient processing. It eliminates tournament tree sorts, corresponding work file read and write I/O's, and associated CPU time. This reduces the time for the running of a query and improves the performance of other applications sharing the use of work files. Further, the improved performance is particular significant when the buffer sizes are within a page of records or rows, although multiple pages may be used.Type: ApplicationFiled: September 8, 2005Publication date: March 15, 2007Applicant: International Business Machines CorporationInventors: Akiko Hoshikawa, Allan Lebovitz, Akira Shibamiya
-
Patent number: 7146360Abstract: Aspects for improving response time for database query execution are described. The aspects include comparing an estimate of sort pages needed for a database query against at least one threshold. A determination of whether to perform a parallel sort for the database query based on the comparison occurs, wherein response time improvement by the parallel sort is balanced against resource overhead of the parallel sort.Type: GrantFiled: December 18, 2002Date of Patent: December 5, 2006Assignee: International Business Machines CorporationInventors: Terry Dennis Allen, Hsiuying Cheng, Fen-Ling Lin, Akira Shibamiya, Annie S. Tsang
-
Patent number: 7146365Abstract: Disclosed is a method, system, and program for database query execution. A range of data pages is assigned to each of multiple parallel tasks. For each of the multiple parallel tasks, the range of data pages is mapped to one or more physical partitions, and a data partitioned secondary index partition associated with each of the one or more physical partitions is identified. Each of the multiple parallel tasks is executed to process the database query against the assigned range of data pages using the one or more data partitioned secondary index partitions.Type: GrantFiled: January 27, 2003Date of Patent: December 5, 2006Assignee: International Business Machines CorporationInventors: Terry Dennis Allen, Paramesh S. Desai, Akira Shibamiya, Hong Sang Tie, Annie S. Tsang
-
Patent number: 7058952Abstract: A method, apparatus, and article of manufacture of a computer-implemented parallel database loading system. The optimum number of tasks to be processed by the system is determined by identifying the memory constraints of the system, by identifying available processing capabilities, and by determining a number of load and sort processes to be started in parallel based on the identified memory constraints and processing capabilities. Optimizing the number of load and sort processes increases overall system processing speed.Type: GrantFiled: February 9, 2000Date of Patent: June 6, 2006Assignee: International Business Machines CorporationInventors: John Marland Garth, James Alan Ruddy, Akira Shibamiya
-
Publication number: 20050102331Abstract: A method and article of manufacture, implementing the method, allocates space for a dataset. The dataset has an initial area and zero or more additional allocated areas to provide space for storing the dataset. The size of a new additional area is determined. The new additional area is associated with a new area number, and the size of the new additional area is based on the new area number. Additional space for the dataset is allocated based on the size of the new additional area. Alternately, an apparatus stores a dataset. A computer has a data storage device connected thereto. The data storage device has a plurality of areas for storing a dataset. The plurality of areas comprises an initial area having an initial area size and a plurality of additional areas having an additional area size, wherein the additional area size varies. In one embodiment, the additional area size monotonically increases.Type: ApplicationFiled: November 6, 2003Publication date: May 12, 2005Inventors: Michael Bracey, John Campbell, Julie Chen, Akira Shibamiya, Bryan Smith, James Teng
-
Patent number: 6823326Abstract: A method and system for formatting space in a storage device for a database system is disclosed. The method and system include formatting a first increment for creating a database file and asynchronously formatting at least one subsequent increment for the database file in a background of the database system.Type: GrantFiled: March 30, 2001Date of Patent: November 23, 2004Assignee: International Business Machines CorporationInventors: James Zu-Chia Teng, Namik Hrle, Akira Shibamiya, Stephen Walter Turnbaugh
-
Publication number: 20040148273Abstract: Disclosed is a method, system, and program for database query execution. A range of data pages is assigned to each of multiple parallel tasks. For each of the multiple parallel tasks, the range of data pages is mapped to one or more physical partitions, and a data partitioned secondary index partition associated with each of the one or more physical partitions is identified. Each of the multiple parallel tasks is executed to process the database query against the assigned range of data pages using the one or more data partitioned secondary index partitions.Type: ApplicationFiled: January 27, 2003Publication date: July 29, 2004Applicant: International Business Machines CorporationInventors: Terry Dennis Allen, Paramesh S. Desai, Akira Shibamiya, Hong Sang Tie, Annie S. Tsang
-
Publication number: 20040122802Abstract: Aspects for improving response time for database query execution are described. The aspects include comparing an estimate of sort pages needed for a database query against at least one threshold. A determination of whether to perform a parallel sort for the database query based on the comparison occurs, wherein response time improvement by the parallel sort is balanced against resource overhead of the parallel sort.Type: ApplicationFiled: December 18, 2002Publication date: June 24, 2004Inventors: Terry Dennis Allen, Hsiuying Cheng, Fen-Ling Lin, Akira Shibamiya, Annie S. Tsang
-
Patent number: 6535893Abstract: A reorganizer utility performs an online reorganization of a database that provides applications with concurrent access to data during an iterative process of log apply operations to a shadow version of the data. The reorganizer continues this iterative process of log apply operations until an estimate of an elapsed time necessary to complete a last iteration is less than or equal to a user-specified maximum length of time that read-only (RO) access may be provided to the data. When this threshold is reached, the reorganizer performs the last iteration, which includes draining all applications making modifications to the data; allowing read-only access to the data, performing log apply operations against the shadow version of the data, and then switching all of the applications to the shadow data.Type: GrantFiled: February 24, 2000Date of Patent: March 18, 2003Assignee: International Business Machines CorporationInventors: Craig Alan Friske, James Alan Ruddy, Akira Shibamiya
-
Publication number: 20020143732Abstract: A method and system for formatting space in a storage device for a database system is disclosed. The method and system include formatting a first increment for creating a database file and asynchronously formatting at least one subsequent increment for the database file in a background of the database system.Type: ApplicationFiled: March 30, 2001Publication date: October 3, 2002Inventors: James Zu-Chia Teng, Namik Hrle, Akira Shibamiya, Stephen Walter Turnbaugh
-
Patent number: 6334134Abstract: A method, apparatus, and article of manufacture for a computer implemented insert system. Data is stored in a database stored on a data storage device connected to a plurality of computers. At least one look-aside space map is allocated to each of the computers. At each computer, when data is to be inserted into the database, a look-aside space map allocated to that computer is identified, and a free data page is located using the identified look-aside space map.Type: GrantFiled: August 18, 1998Date of Patent: December 25, 2001Assignee: International Business Machines CorporationInventors: Donald James Haderle, Akira Shibamiya, James Zu-Chia Tseng, Julie Ann Watts
-
Patent number: 6272487Abstract: The system, method, and program of this invention collects multi-column statistics, by a database management system, to reflect a relationship among multiple columns of a table in a relational database. These statistics are stored in the system catalog, and are used during query optimization to obtain an estimate of the number of qualifying rows when a query has predicates on multiple columns of a table. A multi-column linear quantile statistic is collected by dividing the data of multiple columns into sub-ranges where each sub-range has approximately an even distribution of data, and determining a frequency and cardinality of each sub-range. A multi-column polygonal quantile statistic is collected by dividing the data of multiple columns into sub-spaces where each sub-space contains approximately the same number of tuples, and determining a frequency and cardinality of each sub-space.Type: GrantFiled: March 26, 1999Date of Patent: August 7, 2001Assignee: International Business Machines CorporationInventors: Thomas Abel Beavin, Balakrishna Raghavendra Iyer, Akira Shibamiya, Hong Sang Tie, Min Wang
-
Patent number: 5995957Abstract: The system, method, and program of this invention collects multi-column statistics, by a database management system, to reflect a relationship among multiple columns of a table in a relational database. These statistics are stored in the system catalog, and are used during query optimization to obtain an estimate of the number of qualifying rows when a query has predicates on multiple columns of a table.A multi-column linear quantile statistic is collected by dividing the data of multiple columns into sub-ranges where each sub-range has approximately an even distribution of data, and determining a frequency and cardinality of each sub-range. A multi-column polygonal quantile statistic is collected by dividing the data of multiple columns into sub-spaces where each sub-space contains approximately the same number of tuples, and determining a frequency and cardinality of each sub-space.Type: GrantFiled: February 28, 1997Date of Patent: November 30, 1999Assignee: International Business Machines CorporationInventors: Thomas Abel Beavin, Balakrishna Raghavendra Iyer, Akira Shibamiya, Hong Sang Tie, Min Wang
-
Patent number: 5940819Abstract: A relational data base management system includes a query processor that permits consideration of alternative user-specified access paths, which the processor will validate and incorporate into the query execution plan it otherwise generates. The optimizer of the query processor retrieves user-specified data that defines an access path for a query during bind operations. Any access path parameters that are invalid are replaced with processor-selected values.Type: GrantFiled: August 29, 1997Date of Patent: August 17, 1999Assignee: International Business Machines CorporationInventors: Thomas Abel Beavin, Donald J. Haderle, Akira Shibamiya, Hong Sang Tie, Yun Wang
-
Patent number: 5845274Abstract: The present invention provides a system and method for utilizing the proximity of keys in sequential or near sequential index probes to avoid complete index tree traversal. Page information from three pages (LAST, PARENT and NEXT) are stored in separate information fields within an Index Lookaside Buffer. The LAST information field contains information on the most recent leaf page accessed during an index probe in a read key or an insert key operation, the PARENT information field contains information on the parent page of the most recently accessed leaf page described in the LAST information field, and the NEXT information field contains information on the most recent leaf page accessed during a fetch-next key or delete key operation.Type: GrantFiled: June 6, 1995Date of Patent: December 1, 1998Assignee: International Business Machines CorporationInventors: Atul Chadha, Donald J. Haderle, Akira Shibamiya, Robert W. Lyle, Steven J. Watts
-
Patent number: 5748952Abstract: The present invention provides a system and method for utilizing the proximity of keys in sequential or near sequential index probes to avoid complete index tree traversal. Page information from three pages (LAST, PARENT and NEXT) are stored in separate information fields within an Index Lookaside Buffer. The LAST information field contains information on the most recent leaf page accessed during an index probe in a read key or an insert key operation, the PARENT information field contains information on the parent page of the most recently accessed leaf page described in the LAST information field, and the NEXT information field contains information on the most recent leaf page accessed during a fetch-next key or delete key operation.Type: GrantFiled: May 10, 1995Date of Patent: May 5, 1998Assignee: International Business Machines CorporationInventors: Atul Chadha, Donald J. Haderle, Akira Shibamiya, Robert W. Lyle, Steven J. Watts
-
Patent number: 5692174Abstract: A system and method for a computer system having a plurality of DBMS providing a coordinating and assisting function. If a DBMS performs a coordinating function, it is referred to as a coordinating DBMS. If a DBMS performs an assisting function, it is referred to as an assisting DBMS. Each coordinating DBMS receives a query from a user application, decomposes the query into multiple parallel tasks, and allocates the parallel tasks to all of the DBMSs in the system. Each assisting DBMS receives one or more parallel tasks from a coordinating DBMS, executes the parallel tasks and returns the results to the coordinating DBMS. The coordinating DBMSs and assisting DBMSs access one or more storage devices. Furthermore, the present invention comprises a system and method for dynamically disabling a parallel mode on the coordinating DBMSs and the assisting DBMSs.Type: GrantFiled: October 5, 1995Date of Patent: November 25, 1997Assignee: International Business Machines CorporationInventors: William Robert Bireley, Tammie Dang, Paramesh Sampatrai Desai, Donald James Haderle, Fen-Ling Lin, Maureen Mae McDevitt, Akira Shibamiya, Bryan Frederick Smith, James Zu-chia Teng, Hong Sang Tie, Yun Wang, Jerome Quan Wong, Kathryn Ruth Zeidenstein, Kou Horng Allen Yang