Timothy M Griffin

US Patent:

6728779, Apr 27, 2004

Filed:

May 31, 2000

Appl. No.:

09/583595

Inventors:

Timothy G. Griffin - Berkeley Heights NJ
Gordon Thomas Wilfong - Gillette NJ

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

G06F 15173

US Classification:

709239, 709238, 709308, 370469, 37922102, 714 4

Abstract:

Routing information is exchanged between edge routers in different autonomous systems that independently define their routing policies. A Simple Path Vector Protocol extends the prior art Border Gateway Protocol in a manner that is guaranteed to converge by adding a new attribute to the routing messages sent by an edge router to its peers in the different systems. This attribute is a path history, which is dynamically computed at each router as the routing path to a particular destination is changed. The path history attribute is sent in a routing message by a router to its peers together with the sending routers path to that destination. By observing the dynamic path history that is computed at a router as a received routing message from a peer router that contains a history attribute is processed, a cycle can be identified in the newly computed history and associated with a policy conflict at that receiving routers associated autonomous system. A path whose history contains a cycle is automatically suppressed as a permitted path to that destination.

US Patent:

59483571, Sep 7, 1999

Filed:

May 29, 1997

Appl. No.:

8/864779

Inventors:

Kwong Y. Li - Mahwah NJ
Fortunato Patane - Walden NY
Timothy P. Griffin - Appleton WI
Gregory A. Unser - Appleton WI
Marget C. Mann - Appleton WI

Assignee:

International Paper Company - Purchase NY

International Classification:

B01J 1900
C23F 1100
D21H 2728

US Classification:

422 40

Abstract:

The present invention relates to paper interleavers for sheet metal and, in particular, to a paper interleaver containing catalytically crosslinked polysiloxane capable of withstanding temperatures approaching 200. degree. C. for prolonged periods of time.

US Patent:

55353851, Jul 9, 1996

Filed:

May 19, 1995

Appl. No.:

8/444467

Inventors:

Timothy G. Griffin - Berkeley Heights NJ
Leonid Libkin - Basking Ridge NJ

Assignee:

AT&T Corp. - Murray Hill NJ

International Classification:

G06F 1730

US Classification:

395600

Abstract:

Apparatus and methods for reducing the amount of computation required to determine the consequences of a side effect resulting from a transaction on a relation in a data base system. The apparatus and methods use equational reasoning based on a bag algebra representation of a class of transaction and the relation to produce a pre-expression which describes the side effect. The pre-expression is included in the data base system's data dictionary, and when a transaction of the class is received in the data base system, the pre-expression is used to determine the side effect. The pre-expression is formed with a strongly-minimal pair of delete and insert bags. The apparatus and methods may be used to maintain materialized views, to check for violation of constraints on the data base, and to activate triggers, monitors, and active queries.

US Patent:

60062169, Dec 21, 1999

Filed:

Jul 29, 1997

Appl. No.:

8/902447

Inventors:

Timothy G. Griffin - Berkeley Heights NJ
Richard Baxter Hull - Morristown NJ
Bharat Kumar - Scotch Plains NJ
Daniel Francis Lieuwen - Plainfield NJ
Gang Zhou - Bedminster NJ

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

G06F 1730

US Classification:

707 2

Abstract:

A logical data architecture for fetch-intensive database applications includes a first and a second logical database. The second database includes materialized views over the first database. Updates are propagated from the first database to the second database using so-called view maintenance techniques. In preferred embodiments, the first database may be optimized for update transactions and the second database may be optimized for read transactions. At least one of the materialized views included in the second database is based on a pre-defined application read transaction. The update processing overhead associated with view maintenance is substantially performed at the first database.

US Patent:

55133509, Apr 30, 1996

Filed:

May 27, 1994

Appl. No.:

8/250205

Inventors:

Timothy G. Griffin - New Providence NJ
Howard W. Trickey - Westfield NJ

Assignee:

AT&T Corp. - Murray Hill NJ

International Classification:

G06F 1540
G06F 700

US Classification:

395600

Abstract:

A technique which may be used in a transaction which updates a data set when the data set is subject to constraints and includes operations which may abort. The technique produces an update constraint which may be tested before the data set is altered to determine whether the constraints will be satisfied if the data set is altered. The update constraint of the technique indicates whether the constraints would be satisfied if the transaction could not abort. The update constraint is checked at the application level, while the constraints which cause an operation to abort are checked at the system level. An application of the update constraint to a relational data base embedded in a telephone switch is disclosed.

US Patent:

59787899, Nov 2, 1999

Filed:

May 7, 1997

Appl. No.:

8/852652

Inventors:

Timothy G. Griffin - Berkeley Heights NJ
Richard Baxter Hull - Morristown NJ

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

G06F 1730

US Classification:

707 2

Abstract:

A hypothetical query in a database system is transformed using algebraic equivalences involving explicit substitutions so as to produce one or more equivalent queries which can be evaluated more efficiently than the original hypothetical query. The hypothetical query may be of the form Q when {U} where Q is a relational algebra query and U is an update expression. The value assigned to the hypothetical query in a database state DB is the value that Q would return in the database state reached from DB by executing update U. One or more explicit substitutions are used to represent hypothetical database state changes, and algebraic equivalences involving the explicit substitutions are applied to the hypothetical query in order to generate at least one additional query which is equivalent to the hypothetical query. Several equivalent queries may be generated, and their estimated computation times compared, in order to select a particular equivalent query for direct evaluation. The use of explicit substitutions to represent hypothetical database state changes allows when constructs or other similar hypothetical programming constructs to be eliminated from the equivalent query.