# US 2002/0055931 A1 · Method of resolving overloaded routines, system for implementing the same and medium for storing processing program therefor

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2002/0055931 A1
- Document ID: US20020055931A1
- Status: Published application
- Kind: A1
- Application number: 09/321,206
- Filed: 1999-05-27
- Published: 2002-05-09
- Earliest claimed: 1998-05-27
- Assignees: Hitachi, Ltd.
- Inventors: EIJI KANEKO; MORIHIRO IWATA; MASATO ASAMI; MASASHI TSUCHIDA; YOSHITO KAMEGI
- Web page: https://patentgrep.com/patent/US20020055931A1

## CPC

- G06F 16/289: {Object oriented databases}
- Y10S 707/99932: Access augmentation or optimizing
- Y10S 707/99934: Query formulation, input preparation, or translation
- Y10S 707/99944: Object-oriented database structure
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

An overloaded routines resolving method of analyzing an invocation for the group of overloaded routines to determine the routine to be called, the method including: the routine group sorting step of sorting the group of routines on the basis of the predetermined precedence; the reference utilization pruning step of determining the routine which has the highest precedence of a data type of an argument from among the routines which can be called for the types in the definition of the arguments of the invocation from the sorted routines and of deleting any of the routines each of which has the lower precedence than that of the routine thus determined from the candidates; and the sort order characteristic pruning step of comparing the data types of the arguments among the routines which still remain after having executed the reference utilization pruning step to delete any of the routines each of which has no possibility of being called from the candidates. From the foregoing, the necessary minimum candidate can be selected efficiently in the overloaded routines resolution which is carried out when analyzing the query for the database.

## Claims

### Claim 1

An overloaded routines resolving method of analyzing an invocation for the group of overloaded routines to determine the routine to be called, said method comprising:
the routine group sorting step of sorting the group of routines on the basis of the predetermined precedence;
the reference utilization pruning step of determining the routine which has the highest precedence of a data type of an argument from among the routines which can be called for the types in the definition of the arguments of the invocation from the sorted routines and of deleting any of the routines each of which has the lower precedence than that of the routine thus determined from the candidates; and
the sort order characteristic pruning step of comparing the data types of the arguments among the routines which still remain after having executed said reference utilization pruning step to delete any of the routines each of which has no possibility of being called from the candidates.

### Claim 2

A database server for analyzing an invocation for the group of overloaded routines to determine the routine to be called, comprising:
a routine group sorting processing unit for sorting the group of routines on the basis of the predetermined precedence;
a reference utilization pruning processing unit for determining the routine which has the highest precedence of a data type of an argument from among the routines which can be called for the types in the definition of the arguments of the invocation from the sorted routines and for deleting any of the routines each of which has the lower precedence than that of the routine thus determined from the candidates; and
a sort order characteristic pruning processing unit for comparing the data types of the arguments among the routines which still remain after having executed said reference utilization pruning step to delete any of the routines each of which has no possibility of being called from the candidates.

### Claim 3

A medium for recording therein a program which is used to operate a computer as a database server for analyzing an invocation for the group of overloaded routines to determine the routine to be called, said database server comprising:
a routine group sorting unit for sorting the group of routines on the basis of the predetermined precedence;
a reference utilization pruning processing unit for determining the routine which has the highest precedence of a data type of an argument from among the routines which can be called for the types in the definition of the arguments of the invocation from the sorted routines and for deleting any of the routines each of which has the lower precedence than that of the routine thus determined from the candidates; and
a sort order characteristic pruning processing unit for comparing the data types of the arguments among the routines which still remain after having executed said reference utilization pruning step to delete any of the routines each of which has no possibility of being called from the candidates.

### Claim 4

An overloaded routines resolving method of analyzing an invocation for the group of overloaded routines to determine the routine to be called, said method comprising:
the routine group sorting step of sorting the group of routines on the basis of the predetermined application precedence;
the reference utilization pruning step of determining the routine which has the highest precedence of a data type of an argument from among the routines which can be called for the types in the definition of the arguments of the invocation from the sorted routines and of deleting any of the routines each of which has the lower precedence than that of the routine thus determined from the candidates; and
the sort order characteristic pruning step of comparing the data types of the arguments among the routines which still remain after having executed said reference utilization pruning step to delete any of the routines each of which has no possibility of being called from the candidates.

### Claim 5 (depends on 4)

An overloaded routines resolving method according to claim 4, further comprising the application routine determining step of searching for the routine to be called, from the head of the routines, which can be started for the data type of the argument when determining the routine to be called from among the routines each of which has the possibility of being applied for the invocation for the overloaded routines which have been obtained to apply the routine which has been found out first, thereby selecting one routine which is to be applied for the invocation for the overloaded routines.

### Claim 6

An overloaded routines resolving method of analyzing an invocation for the group of overloaded routines to determine the routine to be called, said method comprising:
the routine group sorting step of sorting the group of routines on the basis of the predetermined application precedence; and
the reference utilization pruning step of determining the routine which has the highest precedence of a data type of an argument from among the routines which can be called for the types in the definition of the arguments of the invocation from the sorted routines and of deleting any of the routines each of which has the lower precedence than that of the routine thus determined from the candidates.

### Claim 7

An overloaded routines resolving method of analyzing an invocation for the group of overloaded routines to determine the routine to be called, said method comprising:
the routine group sorting step of sorting the group of routines on the basis of the predetermined application precedence; and
the sort order characteristic pruning step of comparing the data types of the arguments among the routines which have been sorted to delete any of the routines each of which has no possibility of being called from the candidates.

### Claim 8 (depends on 7)

An overloaded routines resolving method according to claim 7, further comprising the application routine determining step of searching for the routine to be called, from the head of the routines, which can be started for the data type of the argument when determining the routine to be called from among the routines each of which has the possibility of being applied for the invocation for the overloaded routines which have been obtained to apply the routine which has been found out first, thereby selecting one routine which is to be applied for the invocation for the overloaded routines.

### Claim 9 (depends on 8)

An overloaded routines resolving method according to claim 8, wherein in said routine group sorting step, the group of routines is further sorted with the inheritance hierarchy of the data types of the arguments as the precedence.

### Claim 10 (depends on 8)

An overloaded routines resolving method according to claim 8, wherein in said sort order characteristic pruning step, when comparing the arguments among the routines, if each of the data types which have all of the inheritance hierarchy of the routines each having the higher precedence in the sorting order is a supertype of an argument corresponding to a routine having the lower precedence, the routine having the data type of the supertype is judged to have no possibility of having any of the routines each having the lower precedence applied thereto and deleted from the candidates.

### Claim 11

An overloaded routines resolving method of analyzing an invocation for the group of overloaded routines to determine the routine to be called, said method comprising:
the routine group sorting step of sorting the group of routines on the basis of the predetermined application precedence; and
the application routine determining step of searching for the routine to be actually called, from the head of the routines, which can be started for the data type of the argument when determining the routine to be actually called among the sorted routines to apply the routine which has been found out first, thereby selecting one routine which is to be applied for the invocation for the overloaded routines.

### Claim 12

An overloaded routine resolving processing apparatus for analyzing an invocation for the group of overloaded routines to determine the routine to be called, said apparatus comprising:
routine group sorting means for sorting the group of routines on the basis of the predetermined application precedence;
reference utilization pruning means for determining the routine which has the highest precedence of a data type of an argument from among the routines which can be called for the types in the definition of the arguments of the invocation from the sorted routines and for deleting any of the routines each of which has the lower precedence than that of the routine thus determined from the candidates; and
sort order characteristic pruning means for comparing the data types of the arguments among the routines which still remain after having executed the processing by said reference utilization pruning means to delete any of the routines each of which has no possibility of being called from the candidates.

### Claim 13

An overloaded routine resolving processing apparatus for analyzing an invocation for the group of overloaded routines to determine the routine to be called, said apparatus comprising:
routine group sorting means for sorting the group of routines on the basis of the predetermined application precedence; and
reference utilization pruning means for determining the routine which has the highest precedence of a data type of an argument from among the routines which can be called for the types in the definition of the arguments of the invocation from the sorted routines and for deleting any of the routines each of which has the lower precedence than that of the routine thus determined from the candidates.

### Claim 14

An overloaded routine resolving processing apparatus for analyzing an invocation for the group of overloaded routines to determine the routine to be called, said apparatus comprising:
routine group sorting means for sorting the group of routines on the basis of the predetermined application precedence; and
sort order characteristic pruning means for comparing the data types of the arguments among the routines which have been sorted to delete any of the routines each of which has no possibility of being called from the candidates.

### Claim 15

An overloaded routine resolving processing apparatus for analyzing an invocation for the group of overloaded routines to determine the routine to be called, said apparatus comprising:
routine group sorting means for sorting the group of routines on the basis of the predetermined application precedence; and
application routine determining means for searching for the routine to be actually called, from the head of the routines, which can be started for the data type of the actual argument when determining the routine to be actually called among the sorted routines to apply actually the routine which has been found out first, thereby selecting only one routine which is to be applied for the invocation for the overloaded routines.
