Patents Examined by John C. Loomis
  • Patent number: 6351754
    Abstract: A method and system for reducing overhead associated with recovering after a failure. According to the method, a checkpoint value is maintained that indicates which records of a plurality of records have to be processed after the failure. The plurality of records contain change information that corresponds to a plurality of data blocks. A target checkpoint value is determined based on a desired number of data block reads that will be required during a redo phase of recovery. Changes contained in volatile memory are then written to nonvolatile memory to advance the checkpoint value to at least the target checkpoint value. According to another aspect of the invention, the target checkpoint value is determined using a circular queue of offset buckets. The offset buckets are used to store index values that are associated with buffers in the ordered list. The target checkpoint value is periodically set equal to an index value that is contained in an offset bucket.
    Type: Grant
    Filed: June 23, 1998
    Date of Patent: February 26, 2002
    Assignee: Oracle Corporation
    Inventors: William H. Bridge, Jr., Boris Klots, Juan R. Loaiza, Ashok Joshi
  • Patent number: 6289341
    Abstract: An intelligent agent capable of traversing sites in a computer network to identify intellectual property (IP) infringement issues that may exist in those network sites and a method of identifying such IP infringement issues. In one embodiment, the agent includes: (1) a site database containing sites to be traversed, (2) an IP database containing IP indicia to be compared and (3) a site examiner, associated with the site and IP databases, that traverses the sites identified in the site database, compares data associated with the sites with the IP indicia in the IP database and creates a record of favorable comparisons between the data and the IP indicia.
    Type: Grant
    Filed: June 26, 1998
    Date of Patent: September 11, 2001
    Assignee: Lucent Technologies, Inc.
    Inventor: Matthew F. Barney
  • Patent number: 6253243
    Abstract: An SNMP trap daemon in a distributed network management system is enhanced by improving the flexibility of the filtering functions to allow more generality in matching trap information for CMIP conversion and more specificity in determining how traps are forwarded to other managers and mapped to CMIP events. Filtering is added to the trap forwarding mechanism so that specific traps can be routed to specific managers. The format of a mapping file is also modified to allow type conversion and string concatenation of values in the incoming traps. This modification allows improved matching capabilities in CMIP conversion. The format is further modified to allow “wildcard” matching so that a separate entry is not needed for each incoming trap.
    Type: Grant
    Filed: December 4, 1998
    Date of Patent: June 26, 2001
    Assignee: Sun Microsystems, Inc.
    Inventor: David Scott Spencer
  • Patent number: 6249782
    Abstract: A system and method are disclosed for reducing file names and for retrieving files having reduced file names. In response to a request to access file names that are not supportable by an applications programming interface (API), a file manager program retrieves an original file name having an original file name length and an original file identifier. Next, the file manager divides the original file name into a set of primary characters and a set of extension characters. A shortened identifier having a set of shortened identifier characters is created by encoding the original file identifier. The primary characters are then truncated. A reduced file name is then created by combining the truncated characters, a reduced file name marker, the shortened identifier, and the extension characters.
    Type: Grant
    Filed: December 17, 1998
    Date of Patent: June 19, 2001
    Assignee: Apple Computer, Inc.
    Inventors: Mark S. Day, Donald J. Brady, Deric S. Horn
  • Patent number: 6219043
    Abstract: A method and system in which a section of a previously encoded digital bit stream is replaced with another section of encoded video. In order to remove a section of encoded video, it is necessary to determine the beginning and ending points of the encoded video in the digitally encoded bit stream. The addresses of the beginning and ending points of the encoded data cannot be simply looked up but are calculated by summing the bits consumed by each picture, the number of bits of the sequence header of each picture, the number of bits of each Group of Pictures (GOP) header, and all stuff bits. In order to encode the video which is to be inserted in place of the removed video, a process is performed which prevents decoding artifacts from appearing. This is accomplished by determining the last P-picture before the edit point and using it as a reference frame for frames after the edit point.
    Type: Grant
    Filed: February 15, 2000
    Date of Patent: April 17, 2001
    Assignees: Kabushiki Kaisha Toshiba, Time Warner Entertainment Co., L.P.
    Inventors: Jay Yogeshwar, Sheau-Bao Ng, Teiichi Ichikawa, Hiroaki Unno, Hideki Mimura, Tetsuya Kitamura, Christopher J. Cookson, Greg B. Thagard, Andrew Drusin Rosen
  • Patent number: 6208999
    Abstract: A file system for data file storage on a block storage device includes signature information embedded within each block allocated to a data file. Such signature information includes a file identification number, a sequence number within the file, and optional file type information. The signature information is used to reconstruct files on the block storage device in the event of damage to data files or critical system areas on the device. The directory structure for the file system is maintained as a self-contained flat database, stored as a B-tree for expedited searching, including full hierarchical pathnames for each directory entry, thereby enhancing the ability to recover files in a low level of the directory hierarchy when a middle level has been damaged.
    Type: Grant
    Filed: December 12, 1996
    Date of Patent: March 27, 2001
    Assignee: Network Associates, Inc.
    Inventors: Michael L. Spilo, Jonathan A. Daub
  • Patent number: 6141664
    Abstract: A method of synchronizing at least a first and a second database each containing dated records such as events, wherein the records of the first and second databases are synchronized across a narrow date range narrower than the date range of the records of at least one of the databases. A prior synchronization can be performed across a prior date range. The date range of the prior synchronization is stored, along with the history file containing information representative of the content of the databases following the prior synchronization. When a current synchronization is performed, it is performed across a date range that combines the prior date range with the current date range.
    Type: Grant
    Filed: November 13, 1996
    Date of Patent: October 31, 2000
    Assignee: Puma Technology, Inc.
    Inventor: David J. Boothby
  • Patent number: 6105033
    Abstract: A host system includes a multicache system configured within a host system's memory which has a plurality of local and central cache systems used for storing information being utilized by a plurality of processes running on the system. The central cache system includes an obsolete code management (OCM) component that operates to detect and remove obsolete entries stored within the central cache system. The OCM component operates to remove obsolete code from all the caches when events cause such obsolescence, e.g., data definition language (DDL) statements are executed. In certain situations, by being able to perform such operations during DDL statement processing, the OCM component further enhances overall system operation.
    Type: Grant
    Filed: July 2, 1998
    Date of Patent: August 15, 2000
    Assignee: Bull HN Information Systems Inc.
    Inventor: Donald P. Levine
  • Patent number: 6032155
    Abstract: This invention relates to a method and apparatus for administering prescribed medication to a patient. The prescribed medication administration system and apparatus dispense prescribed medication, verify the medication is given to a correct patient by an authorized healthcare worker and tracks and records the administration of the medication. The system utilizes a workstation connected to a database containing prescribed medication dose information for various patients. A healthcare worker uses the workstation to manually or automatically dispenses the medication the portable container. An information device is secured to the portable container during transport and administration of the medication to the intended patient. The information device prevents access to the medication or warns the healthcare worker of a potential error if the medication is delivered to the wrong patient or administered by an unauthorized healthcare worker.
    Type: Grant
    Filed: October 21, 1997
    Date of Patent: February 29, 2000
    Inventor: Carlos de la Huerga
  • Patent number: 6026232
    Abstract: A method and system in which a section of a previously encoded digital bit stream is replaced with another section of encoded video. In order to remove a section of encoded video, it is necessary to determine the beginning and ending points of the encoded video in the digitally encoded bit stream. The addresses of the beginning and ending points of the encoded data cannot be simply looked up but are calculated by summing the bits consumed by each picture, the number of bits of the sequence header of each picture, the number of bits of each Group of Pictures (GOP) header, and all stuff bits. In order to encode the video which is to be inserted in place of the removed video, a process is performed which prevents decoding artifacts from appearing. This is accomplished by determining the last P-picture before the edit point and using it as a reference frame for frames after the edit point.
    Type: Grant
    Filed: July 13, 1995
    Date of Patent: February 15, 2000
    Assignees: Kabushiki Kaisha Toshiba, Time Warner Entertainment Co., L.P.
    Inventors: Jay Yogeshwar, Sheau-Bao Ng, Teiichi Ichikawa, Hiroaki Unno, Hideki Mimura, Tetsuya Kitamura, Christopher J. Cookson, Greg B. Thagard, Andrew Drusin Rosen
  • Patent number: 6016491
    Abstract: A generic secure file format to solve problems associated with secure storage and interchange. The file format allows multiple files to be wrapped into a single entity for storage or transmission interchange. Each file can have different security requirements from that of other files. Different file types can be interchanged under a single wrapper in this secure file format. The secure file format also allows one file to be divided into multiple sections and wraps them into a single file. Each section of the file has its own security protection. This enables only sensitive information to be protected, and leaves other sections with less or no security protection. This results in higher performance since security related operations are only required for a small portion of the file.
    Type: Grant
    Filed: January 7, 1997
    Date of Patent: January 18, 2000
    Assignee: International Business Machines Corporation
    Inventor: Weidong Kou
  • Patent number: 6009422
    Abstract: An information retrieval system and method translates a single search request or query across heterogenous databases independent of the database search grammar(s). A client uses a process to express the query in a powerful programming language, i.e., Generalized Query Language (GQL) which has a wide variety of operators to precisely specify the conditions of the query and enable a fused response to be provided by the databases to the query. The process translates the query into phrases contained in a GQL and constructs a complex search query which bridges the gap between the query and the low level of functionality provided in search engines associated with the databases. A search broker receives the GQL query and using a process (i) checks for syntax errors; (2), if correct, parses the complex query into individual search or partial queries and associated logical operations, and (3) forwards the partial queries and operations to the database search engines.
    Type: Grant
    Filed: November 26, 1997
    Date of Patent: December 28, 1999
    Assignee: International Business Machines Corporation
    Inventor: Steven Matthew Ciccarelli
  • Patent number: 6006216
    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.
    Type: Grant
    Filed: July 29, 1997
    Date of Patent: December 21, 1999
    Assignee: Lucent Technologies Inc.
    Inventors: Timothy G. Griffin, Richard Baxter Hull, Bharat Kumar, Daniel Francis Lieuwen, Gang Zhou
  • Patent number: 5946679
    Abstract: A method and apparatus searches table information using keys of varying lengths. Based on criteria, the method selects one of three processes for performing the search. The first routine is a reverse hash search process which is useful for searching information with few key lengths. The second process is a hierarchical search routine which is useful for searching information with many key lengths. The third process is a compressed radix tree search which is useful for searching information that presents significant time barriers to the first two routines.
    Type: Grant
    Filed: July 31, 1997
    Date of Patent: August 31, 1999
    Assignee: Torrent Networking Technologies, Corp.
    Inventors: Ritesh Ahuja, Roy Illingworth, Hemant Kanakia, Bakul Shah
  • Patent number: 5943677
    Abstract: In a multi-dimensional database, a composite data construct is created to accommodate sparse dimensions. When the database is defined, sparse dimensions are identified and composites of those sparse dimensions are created. The composites are stored in a linearized array. The amount of storage space allocated is chosen by the database administrator to satisfy reasonable expected growth of the sparse data.
    Type: Grant
    Filed: October 31, 1997
    Date of Patent: August 24, 1999
    Assignee: Oracle Corporation
    Inventor: Grant E. Hicks
  • Patent number: 5926821
    Abstract: A file control method by which a number of a block first allocated to a file is saved in an external memory and data and a number of a block to be next linked or a flag indicative of an idle block are recorded in each block to thereby restore the file information, and a version of each block is recorded therein to thereby allow easy access to a data block of the specified version. A number of a head block in the file is always saved in an allocated block list of a file information area. The data and the number of the block to be next linked or the identifier indicative of an idle block are recorded in each block of the data storage area. A file control program, when it is desired to add new data to the file, allocates a spare idle block to the file. When file writing operation is interrupted, the head block number and the next block number of each block in the file information area are traced up to the idle block to thereby restore a file information table.
    Type: Grant
    Filed: August 14, 1997
    Date of Patent: July 20, 1999
    Assignee: Hitachi, Ltd.
    Inventors: Nozomu Hirose, Kumiko Yagi, Miho Iwanaga, Hirofumi Yamashita
  • Patent number: 5920859
    Abstract: A search engine for retrieving documents pertinent to a query indexes documents in accordance with hyperlinks pointing to those documents. The indexer traverses the hypertext database and finds hypertext information including the address of the document the hyperlinks point to and the anchor text of each hyperlink. The information is stored in an inverted index file, which may also be used to calculate document link vectors for each hyperlink pointing to a particular document. When a query is entered, the search engine finds all document vectors for documents having the query terms in their anchor text. A query vector is also calculated, and the dot product of the query vector and each document link vector is calculated. The dot products relating to a particular document are summed to determine the relevance ranking for each document.
    Type: Grant
    Filed: February 5, 1997
    Date of Patent: July 6, 1999
    Assignee: IDD Enterprises, L.P.
    Inventor: Yanhong Li
  • Patent number: 5911142
    Abstract: The system and method of the present invention automatically converts field lengths of data fields in a data file that are accessed by a computer program and correspond to date-related data. Either the computer program or the data file may be non-compliant.
    Type: Grant
    Filed: August 5, 1997
    Date of Patent: June 8, 1999
    Assignee: Millennium Dynamics, Inc.
    Inventors: Allan Michael Smith, Thomas L. Durnell
  • Patent number: 5905987
    Abstract: In an interface-based binary object system capable of supporting multiple interfaces into objects created by class templates, a repository of stored object states is formed that can be accessed by later created objects. Such later created objects may be of the same class as the original object or may be of a new class extended from the original class and still use the same stored object state. Access to the stored object state is made through a generic repository object that emulates the behavior of a particular class of object as defined in type definitions. Requests to a particular object's properties through interface methods are serviced by having the generic repository object make reference to the type definitions in order to fulfill the request. Binary extensibility of the generic repository object along with proper class definition in the type definitions allows custom objects having greater functionality than that provided by the generic repository object to be implemented.
    Type: Grant
    Filed: March 19, 1997
    Date of Patent: May 18, 1999
    Assignee: Microsoft Corporation
    Inventors: David R. Shutt, Paul Jonathon Sanders
  • Patent number: 5899995
    Abstract: The present invention discloses an electronic filing system for automatically organizing information into a number of storage elements or folders. The storage elements are folders arranged hierarchically. The information is stored into the storage elements based on its contents. Each storage element is associated by a set of profiles and a set of constraint expressions. The constraint expressions are quantitative measurements of the profiles. The information is scanned and its features are extracted and compared with the profiles. If the features match the storage element's profiles, the features are quantitatively evaluated to produce information expressions. If the information expressions are within the constraints specified by the constraint expressions, the information is stored into the storage element. The profiles and the constraint expressions can be adjusted to reflect the changes in the user's interests.
    Type: Grant
    Filed: June 30, 1997
    Date of Patent: May 4, 1999
    Assignee: Intel Corporation
    Inventors: Marshall A. Millier, Milind S. Pandit, John David Miller