Patents by Inventor Philip Russell Korn

Philip Russell Korn 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: 8103708
    Abstract: Described is a system and method for receiving a data stream of multi-dimensional items, collecting a sample of the data stream having a predetermined number of items and dividing the sample into a plurality of subsamples, each subsample corresponding to a single dimension of each of the predetermined number of items. A query is then executed on a particular item in at least two of the subsamples to generate data for the corresponding subsample. This data is combined into a single value.
    Type: Grant
    Filed: December 15, 2009
    Date of Patent: January 24, 2012
    Assignee: AT & T Intellectual Property II, LP
    Inventors: Graham Cormode, Philip Russell Korn, Shanmugavelayutham Muthukrishnan, Divesh Srivastava
  • Publication number: 20090292726
    Abstract: A method including receiving a plurality of elements of a data stream, storing a multi-dimensional data structure in a memory, said multi-dimensional data structure storing the plurality of elements as a hierarchy of nodes, each node having a frequency count corresponding to the number of elements stored therein, comparing the frequency count of each node to a threshold value based on a total number of the elements stored in the nodes and identifying each node for which the frequency count is at least as great as the threshold value as a hierarchical heavy hitter (HHH) node and propagating the frequency count of each non-HHH nodes to its corresponding parent nodes.
    Type: Application
    Filed: July 30, 2009
    Publication date: November 26, 2009
    Inventors: Graham Cormode, Philip Russell Korn, Shanmugavelayutham Muthukrishnan, Divesh Srivastava
  • Patent number: 7590657
    Abstract: A method including receiving a plurality of elements of a data stream, storing a multi-dimensional data structure in a memory, said multi-dimensional data structure storing the plurality of elements as a hierarchy of nodes, each node having a frequency count corresponding to the number of elements stored therein, comparing the frequency count of each node to a threshold value based on a total number of the elements stored in the nodes and identifying each node for which the frequency count is at least as great as the threshold value as a hierarchical heavy hitter (HHH) node and propagating the frequency count of each non-HHH nodes to its corresponding parent nodes.
    Type: Grant
    Filed: June 10, 2005
    Date of Patent: September 15, 2009
    Assignees: AT&T Corp., The Regents Rutgers University
    Inventors: Graham Cormode, Philip Russell Korn, Shanmugavelayutham Muthukrishnan, Divesh Srivastava
  • Patent number: 6738762
    Abstract: An approach for multidimensional substring selectivity estimation utilizes set hashing to generate cross-counts as needed, instead of storing cross-counts for the most frequently co-occurring substrings. Set hashing is a Monte Carlo technique that is used to succinctly represent the set of tuples containing a given substring. Then, any combination of set hashes will yield a cross-count when intersected. Thus, the set hashing technique is useful in three-, four- and other multidimensional situations, since only an intersection function is required.
    Type: Grant
    Filed: November 26, 2001
    Date of Patent: May 18, 2004
    Assignee: AT&T Corp.
    Inventors: Zhiyuan Chen, Philip Russell Korn, Nikolaos Koudas, Shanmugavelayutham Muthukrishnan
  • Patent number: 5946692
    Abstract: A method and system for compressing a data base that permits queries on the compressed representation of the data base. Another feature is that an approximation of the values of the data base are derivable directly from the compressed representation of the data base. Yet another feature is correction of poor approximations of the reconstructed data. Still another feature is the capability of performing aggregate queries of the compressed representation of the data base.
    Type: Grant
    Filed: May 8, 1997
    Date of Patent: August 31, 1999
    Assignee: AT & T Corp
    Inventors: Christos N. Faloutsos, Hosagrahar Visvesvaraya Jagadish, Philip Russell Korn