Abstract: A natural language interface for databases (NLIDB) component of a database-management system receives a user-submitted natural-language query. The NLIDB parses the query into keywords and maps each keyword onto a corresponding query fragment that identifies a predicate of a non-join condition, or other type of expression, of a structured query. The NLIDB selects an optimal mapping for each keyword with the aid of a Query Fragment Graph (QFG) that counts the number of occurrences of each fragment, and the number of co-occurrences of each pair of fragments, in previously received structured queries. The NLIDB then uses the QFG, optionally augmented by contextual data, to select join paths most likely to be consistent with the semantic intent of the user. The NLIDB generates a structured query that incorporates the mapped query fragments and selected join paths and forwards. The structured the query is then forwarded to downstream DBMS components.

Abstract: A natural language interface for databases (NLIDB) component of a database-management system receives a user-submitted natural-language query. The NLIDB parses the query into keywords and maps each keyword onto a corresponding query fragment that identifies a predicate of a non-join condition, or other type of expression, of a structured query. The NLIDB selects an optimal mapping for each keyword with the aid of a Query Fragment Graph (QFG) that counts the number of occurrences of each fragment, and the number of co-occurrences of each pair of fragments, in previously received structured queries. The NLIDB then uses the QFG, optionally augmented by contextual data, to select join paths most likely to be consistent with the semantic intent of the user. The NLIDB generates a structured query that incorporates the mapped query fragments and selected join paths and forwards. The structured the query is then forwarded to downstream DBMS components.

Abstract: Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided.

Abstract: Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided.

Abstract: Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided.

Abstract: Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided.

Abstract: Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided.

Abstract: A method and system facilitate telephony over computer based networks. The parties to a telephone call need not have the same telephone application software capabilities before the call is initiated nor does the network have to provide standard signaling. Instead, in accordance with the method and system one of the parties defines to the other party the encoding/decoding technique to be used in the processing of the call. The definition can be either by supplying a copy of the application to the other party or by providing the other party with an indirect reference to where the application can be obtained.

Abstract: A method and apparatus is provided for asynchronous version advancement in a three version database. For a distributed database, read transactions are executed using a first version of a database. Update transactions are executed such that information is written into a second version of the database. The second version may include less than all of the information contained in the first version. A database version begins to be advanced at each node such that the information in the second version becomes available for read transactions. For an update transaction that starts on a node after the database version has been advanced, the update transaction is executed such that the update transaction writes information into a third version of the database. The advancement of the database version is completed such that the second version becomes the first version and the third version becomes the second version. For a centralized database, the protocol reduces of the number of versions from four to three.

Abstract: A method and system in which calls made by customers who are members of a group of customers having a group calling plan, but who have separate billing accounts, are priced based on the group calling plan and on the usage by other members of the group. Typical groups may include customers in specific geographic locations, such as residents in an apartment building or in a residential neighborhood, and offices and stores in a commercial building. Other groups may include customers in widely separated geographic locations, such as members of a nation-wide club or organization, alumni association members, etc. In order to price a call made over a network by a customer of the network, the customer being a member of a billing group, information specifying a group billing plan of the billing group is stored. A call made by a member of the billing group is priced based on the group billing plan.

Abstract: A method and system of telephone call processing that provides information to customers while telephone calls are made. Summary information for a customer is stored. A call from the customer is received alt a network switch. The network switch transmits information identifying the customer to a billing analysis system. The billing analysis system transmits the summary information for the customer to the network switch and an audio message based on the summary information is played to the customer.

Abstract: A method and system for automatically generating telephone bills that include customer defined or requested summary information. Customer specific data including pricing data and summary parameters are stored. A plurality of records, each record describing a telephone call, are generated. The record is received at a billing analysis system, which determines a priced call value for each call using the record and the customer specific data and determines summary information for the customer using the record, the priced call values and the summary parameters. A telephone bill for the customer is generated based on the summary information for the customer. The bill may be generated periodically, on a predetermined schedule, or upon demand of the customer. Online access to summary information is also provided.

Abstract: A method and system of telephone call processing that provides direct control of telephone usage based on customer established budgets. According to one aspect of the present invention, customer specific information including pricing data and budget parameters for a customer are stored, as is summary information relating to customer telephone usage. A call setup query is received from a network switch. A call setup response is generated based on the budget parameters and the summary information and the call setup response is transmitted to the network switch. In order to generate the stored summary information, a plurality of records are received wherein each record describes a telephone call. A priced call value for each call is determined using the record and the customer specific information. Summary information for the customer is determined using the record, the priced call values and the budget parameters. The summary information is then stored.

Abstract: A method and system for automatically generating telephone bills that include customer defined or requested billing information. Customer specific data including billing parameters for a customer is stored. A record describing a telephone call between the customer and a party is generated at a network switch. The record is received at a billing analysis system, the billing information relating to the party is determined using the record and at least one billing parameter and a telephone bill for the customer including billing information relating to the party is generated. In one embodiment of the present invention, customer specific data entries including at least one billing parameter and customer information are stored for each of a plurality of a customers and a telephone bill for the first customer including billing information relating to the second customer is generated based on a billing parameter for the first customer and customer information for the second customer.

Abstract: A method and system in which calls made on two or more phone lines of a customer are aggregated for billing and discount billing plans to which the customer subscribes are applied to the aggregated phone usage of the customer. In order to price a call made over a network by a customer of the network, information specifying a billing plan of the customer and information specifying a plurality of telephone lines to which the billing plan applies are stored. A call made from one of the plurality of telephone lines is received at a network switch and record that describes the call is generated. The record is received at a billing analysis system and a priced call value for the call is determined based on the record and the information specifying the customer billing plan.

Abstract: A method and system in which calls made by a customer using a calling card are billed in accordance with the customer's subscribed calling plans. In order to price a call made over a network by a customer of the network, information specifying a billing plan of the customer is stored. A call made from a customer station or using a customer calling card or prepaid telephone card is received at a network switch and record that describes the call is generated. The record is received at a billing analysis system and a priced call value for the call is determined based on the record and the information specifying the customer billing plan. If the call is placed using a prepaid telephone card, it is verified that a sufficient balance remains before completing the call.

Abstract: A technique is provided for the association of constraints with data object classes in an object-oriented database. Given a constraint comprising zero or more quantifiers followed by a quantifier-free boolean expression, a non-primitive reference expression is identified in the boolean expression. The constraint is then modified as follows. First, the primitive reference expression at the head of the identified non-primitive reference expression is replaced with a variable. Then a universal quantifier which quantifies the added variable over all data objects in the class comprising that primitive reference expression is added to the constraint. Finally, a disjunctive condition specifying that the added variable is not equal to the primitive reference expression is added to the boolean expression. The modified constraint may then be associated with the class comprising the aforesaid primitive reference expression.

Abstract: Parsing of partially orderable sets of symbols is achieved by first forming a total order of the given terminal symbols. The relationships between the terminal symbols are formulated, and the given grammar is broken up into a set of production rules. Based on the production rules, a determination is made as to what kind of symbol is needed to comply with the given grammar. This determination encompasses both the type of terminal symbol that is to be found as well as the partial order relationships that such a symbol must have. The set of totally ordered symbols are searched, in order, and the first symbol that meets the specified criteria is selected. When appropriate, the symbols retrieved from the totally ordered set are reduced to non-terminal symbols, with the ultimate goal being the inclusion of all of the symbols in the totally ordered set within one reduced non-terminal symbol.

Abstract: An electronic library which comprises a user interface such as a computer screen, a speaker, a mouse and/or a keyboard; a processor for handling communication with the user and for responding to user requests; and a data store. The data store maintains scanned segments of video data, audio data, or both, and translated replicas of the scanned segments. Searching for specific data is performed by perusing through the translated replicas, but the information that is provided to the user is primarily the scanned segments themselves. The translated versions contain the immediately translatable version of the displayable information and processed information that forms various aggregations of the displayable information. This processing imposes a syntactically logical structure on the displayable information.

Abstract: A programmable memory system that interfaces with a computer's control and data manipulation units, and is capable of performing the manipulation, bookkeeping, and checking that would normally be performed by the computer. The memory system comprises active structure modules that are interconnected in a network to form clusters. The clusters are interconnected to form an aggregate memory system. Each ASE contains a processor section and a conventional memory section.