Patents by Inventor Philip Shi-lung Yu

Philip Shi-lung Yu 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: 5781906
    Abstract: An apparatus and a method for constructing a multidimensional index tree which minimizes the time to access data objects and is resilient to the skewness of the data. This is achieved through successive partitioning of all given data objects by considering one level at a time starting with one partition and using a top-down approach until each final partition can fit within a leaf node. Subdividing the data objects is via a global optimization approach to minimize the area overlap and perimeter of the minimum bounding rectangles covered by each node. The current invention divides the index construction problem into two subproblems: the first one addresses the tightness of the packing (in terms of area, overlap and perimeter) using a small fan out at each index node and the other one handles the fan out issue to improve index page utilization. These two stages are referred to as binarization and compression.
    Type: Grant
    Filed: June 6, 1996
    Date of Patent: July 14, 1998
    Assignee: International Business Machines Corporation
    Inventors: Charu Chandra Aggarwal, Joel Leonard Wolf, Philip Shi-lung Yu
  • Patent number: 5767893
    Abstract: A content based method is used to download/record digital video from networks to client stations and home VCRs. In this manner, the disadvantages associated with conventional time-based downloading of programs to analog video is avoided. The method includes the steps of receiving each of the video programs, identifying one of the programs from those received based upon frame signature matching, pre-loaded pattern searching, annotation signal searching or program bar code searching and saving the desired video program based upon the performed identification. Alternately a storage apparatus is included for storing selected signals. Furthermore, content based filtering is included for identifying selected signals and for transferring the identified selected signals to the storage device.
    Type: Grant
    Filed: October 11, 1995
    Date of Patent: June 16, 1998
    Assignee: International Business Machines Corporation
    Inventors: Ming-Syan Chen, Chung-Sheng Li, Philip Shi-lung Yu
  • Patent number: 5765146
    Abstract: A method of performing a parallel join operation on a pair of relations R1 and R2 in a system containing P processors organized into Q clusters of P/Q processors each. The system contains disk storage for each cluster, shared by the processors of that cluster, together with a shared intermediate memory (SIM) accessible by all processors. The relations R1 and R2 to be joined are first sorted on the join column. The underlying domain of the join column is then partitioned into P ranges of equal size. Each range is further divided into M subranges of progressively decreasing size to create MP tasks T.sub.m,p, the subranges of a given range being so sized relative to one another that the estimated completion time for task T.sub.m,p is a predetermined fraction that of task T.sub.m-1,p. Tasks T.sub.
    Type: Grant
    Filed: November 4, 1993
    Date of Patent: June 9, 1998
    Assignee: International Business Machines Corporation
    Inventors: Joel Leonard Wolf, Philip Shi-lung Yu, John Joseph Edward Turek
  • Patent number: 5761652
    Abstract: A computerized method of building balanced ranges of attribute values for multiple attributes of a database simultaneously without requiring presorting of the database. The balanced ranges are used to construct balanced range-based multidimensional bitmap indexes for processing complex multipredicate queries against the database. A dynamic partition expansion and contraction method can construct balanced ranges for bitmap indexing of tuples having high cardinality attributes and even in the presence of highly skewed data.
    Type: Grant
    Filed: March 20, 1996
    Date of Patent: June 2, 1998
    Assignee: International Business Machines Corporation
    Inventors: Kun-Lung Wu, Philip Shi-lung Yu
  • Patent number: 5758076
    Abstract: A system and method of using spare disk bandwidth and buffer capacity maximizes the system throughput of a multimedia server. An important issue is determining a criterion for selecting a data stream for which the additional disk bandwidth should be used. Minimization of buffer consumption is selected as the criterion to select an appropriate media stream to use the spare system resources. Buffer consumption measures not only the amount of buffer but also the amount of time the space is occupied (i.e., the space-time product). Even though both currently active streams and waiting streams can be chosen to adjust the rate of retrieval, it is generally more effective for the active streams.
    Type: Grant
    Filed: July 19, 1995
    Date of Patent: May 26, 1998
    Assignee: International Business Machines Corporation
    Inventors: Kun-Lung Wu, Philip Shi-Lung Yu
  • Patent number: 5758147
    Abstract: An efficient method and system of communicating and accumulating global information for parallel data mining. Since each database is partitioned, a single node in a parallel environment will be unable to make decisions based on global information. A novel technique of progressive thresholding is devised to accumulates global information as a function of a transaction support threshold while minimizing transmission overhead. The transaction support threshold is varied as a function of the number of nodes contributing to the global information progresses.
    Type: Grant
    Filed: June 28, 1995
    Date of Patent: May 26, 1998
    Assignee: International Business Machines Corporation
    Inventors: Ming-Syan Chen, Philip Shi-lung Yu
  • Patent number: 5751336
    Abstract: Portions of multimedia program (presentation) are repetitively broadcast to receiving stations with subsequent portions being broadcast less frequently than preceding portions. Blocks of at least one of the portions are broadcast in varying permutations from one repetition to a next repetition. Further, each portion is of a length which is proportional to a sum of the lengths of all preceding portions. A receiver is provided with selects blocks to be skipped (in a pyramid type broadcast) based on information indicative of the permutation selected by the server. The receiver determines the number of blocks to skip before buffering the next block for the video being viewed.
    Type: Grant
    Filed: October 12, 1995
    Date of Patent: May 12, 1998
    Assignee: International Business Machines Corporation
    Inventors: Charu Chandra Aggarwal, Joel Leonard Wolf, Philip Shi-Lung Yu
  • Patent number: 5671405
    Abstract: System and method for improving response time of concurrent mergesort operations in an information handling system, which includes one or more logical processors each operating under control of an image of an operating system program, a database storage system for storing data in a predetermined data structure, one or more workfile storage devices for storing workfiles during mergesort operations, means for sorting the data structure into one or more ordered runs, means for determining a logical partition size for the workfile storage devices, means for selecting a least loaded partition, means for writing the ordered runs in the selected partition in the workfile storage devices, and means for merging the ordered runs into a single sorted run.
    Type: Grant
    Filed: July 19, 1995
    Date of Patent: September 23, 1997
    Assignee: International Business Machines Corporation
    Inventors: Kun-Lung Wu, Philip Shi-Lung Yu
  • Patent number: 5668988
    Abstract: An efficient computer implemented method of mining path traversal patterns in a communications network. The method of the present invention comprises two steps. A method, called MF (standing for maximal forward references), is first used to convert an original sequence of log data into a set of traversal subsequences. Each traversal subsequence represents a maximal forward reference from the starting point of a user access. This step of converting the original log sequence into a set of maximal forward references will filter out the effect of backward references which are mainly made for ease of traveling, and enable us to concentrate on mining meaningful user access sequences. Accordingly, when backward references occur, a forward reference path terminates. This resulting forward reference path is termed a maximal forward reference. After a maximal forward reference is obtained, we back track to the starting point of the forward reference and begin a new forward reference path.
    Type: Grant
    Filed: September 8, 1995
    Date of Patent: September 16, 1997
    Assignee: International Business Machines Corporation
    Inventors: Ming-Syan Chen, Philip Shi-lung Yu
  • Patent number: 5287496
    Abstract: A dynamic, finite versioning scheme supports concurrent transaction and query processing in which there is no interference between transactions and queries and no quiescence of either transactions or queries for allowing queries to access a more up-to-date database. Only a finite number of logical versions are dynamically maintained on disk for a database page. Acquiring no locks, queries access appropriate query versions, according to their initiation times. Each corresponding query version of all the database pages constitutes a transaction-consistent, but perhaps slightly out-of-date, database snapshot. Through typical concurrency control mechanisms, different transactions access the most up-to-date versions, and their updates are allowed to be incrementally written into the database before they are committed. To save storage, a physical page copy may simultaneously represent multiple versions. The exact logical version(s) that a physical page copy represents changes dynamically and implicitly.
    Type: Grant
    Filed: February 25, 1991
    Date of Patent: February 15, 1994
    Assignee: International Business Machines Corporation
    Inventors: Ming-Syan Chen, Kun-Lung Wu, Philip Shi-lung Yu