Patents by Inventor Minos N. Garofalakis
Minos N. Garofalakis 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: 8949710Abstract: A grammar for mapping a first grouping of XML data into a second grouping of XML data and a method for accomplishing same to incorporate the first grouping into the second grouping. The grammar includes a first rule for computing a first child element attribute and a second rule for computing a second parent element attribute. The first rule and second rule vary according to a production of an element type of the first grouping. The element types include PCDATA, disjunctive, conjunctive and Kleene star, each having a unique rule set for defining inherited and synthesized attributes of the parent and child elements. The method includes the step of executing a mapping of a first grouping having at least one parent element and a set of corresponding child elements into a second grouping in accordance with the grammar rules based on the production of the element type.Type: GrantFiled: July 12, 2005Date of Patent: February 3, 2015Assignee: Alcatel LucentInventors: Wenfei Fan, Minos N. Garofalakis, Ming Xiong
-
Patent number: 8055088Abstract: Novel, computationally efficient schemes for deterministic wavelet thresholding with the objective of optimizing maximum-error metrics are provided. An optimal low polynomial-time algorithm for one-dimensional wavelet thresholding based on a new dynamic-programming (DP) formulation is provided that can be employed to minimize the maximum relative or absolute error in the data reconstruction. Directly extending a one-dimensional DP algorithm to multi-dimensional wavelets results in a super-exponential increase in time complexity with the data dimensionality. Thus, novel, polynomial-time approximation schemes (with tunable approximation guarantees for the target maximum-error metric) for deterministic wavelet thresholding in multiple dimensions are also provided.Type: GrantFiled: October 26, 2009Date of Patent: November 8, 2011Assignee: Alcatel LucentInventors: Minos N. Garofalakis, Amit Kumar
-
Patent number: 7885911Abstract: The first fast solution to the problem of tracking wavelet representations of one-dimensional and multi-dimensional data streams based on a stream synopsis, the Group-Count Sketch (GCS) is provided. By imposing a hierarchical structure of groups over the data and applying the GCS, our algorithms can quickly recover the most important wavelet coefficients with guaranteed accuracy. A tradeoff between query time and update time is established, by varying the hierarchical structure of groups, allowing the right balance to be found for specific data streams. Experimental analysis confirmed this tradeoff, and showed that all the methods significantly outperformed previously known methods in terms of both update time and query time, while maintaining a high level of accuracy.Type: GrantFiled: March 24, 2006Date of Patent: February 8, 2011Assignee: Alcatel-Lucent USA Inc.Inventors: Graham R. Cormode, Minos N. Garofalakis
-
Patent number: 7873689Abstract: A method and system for answering set-expression cardinality queries while lowering data communication costs by utilizing a coordinator site to provide global knowledge of the distribution of certain frequently occurring stream elements to significantly reduce the transmission of element state information to the central site and, optionally, capturing the semantics of the input set expression in a Boolean logic formula and using models of the formula to determine whether an element state change at a remote site can affect the set expression result.Type: GrantFiled: December 30, 2004Date of Patent: January 18, 2011Assignee: Alcatel-Lucent USA Inc.Inventors: Abhinandan Sujit Das, Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastogi
-
Patent number: 7783647Abstract: The invention comprises a method and apparatus for determining a rank of a query value. Specifically, the method comprises receiving a rank query request, determining, for each of the at least one remote monitor, a predicted lower-bound rank value and upper-bound rank value, wherein the predicted lower-bound rank value and upper-bound rank value are determined according to at least one respective prediction model used by each of the at least one remote monitor to compute the at least one local quantile summary, computing a predicted average rank value for each of the at least one remote monitor using the at least one predicted lower-bound rank value and the at least one predicted upper-bound rank value associated with the respective at least one remote monitor, and computing the rank of the query value using the at least one predicted average rank value associated with the respective at least one remote monitor.Type: GrantFiled: December 13, 2005Date of Patent: August 24, 2010Assignees: Alcatel-Lucent USA Inc., Rutgers, The State University of New JerseyInventors: Graham R. Cormode, Minos N. Garofalakis, Shanmugavelayutham Muthukrishnan, Rajeev Rastogi
-
Patent number: 7756805Abstract: A method of distributed approximate query tracking relies on tracking general-purpose randomized sketch summaries of local streams at remote sites along with concise prediction models of local site behavior in order to produce highly communication-efficient and space/time-efficient solutions. A powerful approximate query tracking framework readily incorporates several complex analysis queries, including distributed join and multi-join aggregates and approximate wavelet representations, thus giving the first known low-overhead tracking solution for such queries in the distributed-streams model.Type: GrantFiled: March 29, 2006Date of Patent: July 13, 2010Assignee: Alcatel-Lucent USA Inc.Inventors: Graham R. Cormode, Minos N. Garofalakis
-
Publication number: 20100115350Abstract: Novel, computationally efficient schemes for deterministic wavelet thresholding with the objective of optimizing maximum-error metrics are provided. An optimal low polynomial-time algorithm for one-dimensional wavelet thresholding based on a new dynamic-programming (DP) formulation is provided that can be employed to minimize the maximum relative or absolute error in the data reconstruction. Directly extending a one-dimensional DP algorithm to multi-dimensional wavelets results in a super-exponential increase in time complexity with the data dimensionality. Thus, novel, polynomial-time approximation schemes (with tunable approximation guarantees for the target maximum-error metric) for deterministic wavelet thresholding in multiple dimensions are also provided.Type: ApplicationFiled: October 26, 2009Publication date: May 6, 2010Inventors: Minos N. Garofalakis, Amit Kumar
-
Patent number: 7693335Abstract: Novel, computationally efficient schemes for deterministic wavelet thresholding with the objective of optimizing maximum-error metrics are provided. An optimal low polynomial-time algorithm for one-dimensional wavelet thresholding based on a new dynamic-programming (DP) formulation is provided that can be employed to minimize the maximum relative or absolute error in the data reconstruction. Directly extending a one-dimensional DP algorithm to multi-dimensional wavelets results in a super-exponential increase in time complexity with the data dimensionality. Thus, novel, polynomial-time approximation schemes (with tunable approximation guarantees for the target maximum-error metric) for deterministic wavelet thresholding in multiple dimensions are also provided.Type: GrantFiled: June 13, 2005Date of Patent: April 6, 2010Assignee: Alcatel-Lucent USA Inc.Inventors: Minos N. Garofalakis, Amit Kumar
-
Patent number: 7668856Abstract: The invention provides methods and systems for summarizing multiple continuous update streams such that an approximate answer to a query over one or more of the continuous update streams (such as a Query requiring a join operation followed by a duplicate elimination step) may be rapidly provided. The systems and methods use multiple (parallel) Join Distinct (JD) Sketch data structures corresponding to hash buckets of at least one initial attribute.Type: GrantFiled: September 30, 2004Date of Patent: February 23, 2010Assignee: Alcatel-Lucent USA Inc.Inventors: Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, Rajeev Rastogi
-
Patent number: 7535911Abstract: A system for, and method of, determining a physical topology of a network having multiple subnets. In one embodiment, the system includes: (1) a skeleton path initializer that uses addressing information from elements in the network to develop a collection of skeleton paths of direct physical connections between labeled ones of the elements, the skeleton paths traversing multiple of the subnets and (2) a skeleton path refiner, coupled to the skeleton path initializer, that refines the collection by inferring, from the direct physical connections and path constraints derived therefrom, other physical connections in the skeleton paths involving unlabeled ones of the elements.Type: GrantFiled: May 27, 2003Date of Patent: May 19, 2009Assignee: Alcatel-Lucent USA Inc.Inventors: Yigal Bejerano, Yuri J. Breitbart, Minos N. Garofalakis, Rajeev Rastogi
-
Patent number: 7496571Abstract: Method for performing information-preserving DTD schema embeddings between a source schema when matching a source schema and a target schema. The preservation is realized by a matching process between the two schemas that finds a first string marking of the target schema, evaluates a legality of the first string marking, determines an estimated minimal cost of the first string marking and subsequently adjusts the estimated minimal cost based upon one to one mapping of source schema and target schema subcomponents.Type: GrantFiled: September 30, 2004Date of Patent: February 24, 2009Assignee: Alcatel-Lucent USA Inc.Inventors: Michael Abraham Benedikt, Minos N. Garofalakis, Rajeev Rastogi
-
Patent number: 7433870Abstract: Method for providing controlled access to an XML document includes defining at least one access control policy for a user of the XML document, deriving a security view of the XML document for the user based upon said access control policy and schema level processing of the XML document and translating a user query based on the security view of the XML document to an equivalent query based on the XML document. An apparatus for same includes means for defining an access control policy for a user of the XML document and means for deriving a security view of the XML document for the user based on said access control policy and schema level processing of the XML document. Also included are means for translating a user query based on the security view of the XML document to an equivalent query based on the XML document.Type: GrantFiled: December 27, 2004Date of Patent: October 7, 2008Assignee: Lucent Technologies Inc.Inventors: Chee-Yong Chan, Wenfei Fan, Minos N. Garofalakis
-
Patent number: 7143046Abstract: A system for, and method of compressing a data table using models and a database management system incorporating the system or the method. In one embodiment, the system includes: (1) a table modeller that discovers data mining models with guaranteed error bounds of at least one attribute in the data table in terms of other attributes in the data table and (2) a model selector, associated with the table modeller, that selects a subset of the at least one model to form a basis upon which to compress the data table.Type: GrantFiled: December 28, 2001Date of Patent: November 28, 2006Assignee: Lucent Technologies Inc.Inventors: Shivnath Babu, Minos N. Garofalakis, Rajeev Rastogi
-
Patent number: 7082473Abstract: Systems and method for selecting open shortest path first (OSPF) aggregates and aggregate weights for a particular area. In one embodiment, an aggregate selecting system includes: (1) a database for containing data pertaining to candidate OSPF aggregates and corresponding weights and (2) an aggregate selector, associated with the database, that selects at least a subset of the OSPF aggregates such that the shortest path length between the particular source and destination subnets resulting from advertisement of a set of weighted aggregates approaches the shortest path length between the particular source and destination subnets irrespective of the advertisement.Type: GrantFiled: February 1, 2001Date of Patent: July 25, 2006Assignee: Lucent Technologies Inc.Inventors: Yuri J. Breitbart, Minos N. Garofalakis, Amit Kumar, Rajeev Rastogi
-
Patent number: 7080314Abstract: The present invention discloses a document descriptor extraction method and system. The document descriptor extraction method and system creates a document descriptor by generalizing input sequences within a document; factoring the input sequences and generalized input sequences; and selecting a document descriptor from the input sequences, generalized sequences, and factored sequences, preferably using minimum descriptor length (MDL) principles. Novel algorithms are employed to perform the generalizing, factoring, and selecting.Type: GrantFiled: June 16, 2000Date of Patent: July 18, 2006Assignee: Lucent Technologies Inc.Inventors: Minos N. Garofalakis, Aristides Gionis, Rajeev Rastogi, Srinivasan Seshadri, Kyuseok Shim
-
Publication number: 20040260683Abstract: A set of subscriptions are provided, where one or more subscriptions each comprises a tree pattern, and a tree pattern comprises one or more interconnected nodes having a hierarchy and adapted to specify content and structure of information. The set of subscriptions is used to select information for dissemination to users. Generally, the one or more subscriptions having the tree pattern describe information the users are interested in receiving. Techniques are presented for determining an aggregation from the subscriptions, where the aggregation comprises a set of aggregate patterns. The set of subscriptions may comprise a number of tree patterns, and the aggregate patterns generally also comprise tree patterns comprising one or more interconnected nodes having a hierarchy and adapted to specify content and structure of information. The set of aggregation patterns is smaller than the set of subscriptions and can be made to fit any space constraint.Type: ApplicationFiled: June 20, 2003Publication date: December 23, 2004Inventors: Chee-Yong Chan, Wenfei Fan, Pascal Amedee Felber, Minos N. Garofalakis, Rajeev Rastogi
-
Publication number: 20040255184Abstract: A system for, and method of, determining a physical topology of a network having multiple subnets. In one embodiment, the system includes: (1) a skeleton path initializer that uses addressing information from elements in the network to develop a collection of skeleton paths of direct physical connections between labeled ones of the elements, the skeleton paths traversing multiple of the subnets and (2) a skeleton path refiner, coupled to the skeleton path initializer, that refines the collection by inferring, from the direct physical connections and path constraints derived therefrom, other physical connections in the skeleton paths involving unlabeled ones of the elements.Type: ApplicationFiled: May 27, 2003Publication date: December 16, 2004Applicant: Lucent Technologies Inc.Inventors: Yigal Bejerano, Yuri J. Breitbart, Minos N. Garofalakis, Rajeev Rastogi
-
Patent number: 6760724Abstract: A method for querying electronic data. The query method comprises creating wavelet-coefficient synopses of the electronic data and then querying the synopses in the wavelet-coefficient domain to obtain a wavelet-coefficient query result. The wavelet-coefficient query result is then rendered to provide an approximate result.Type: GrantFiled: July 24, 2000Date of Patent: July 6, 2004Assignee: Lucent Technologies Inc.Inventors: Kaushik Chakrabarti, Minos N. Garofalakis, Rajeev Rastogi, Kyuseok Shim
-
Patent number: 6697338Abstract: Physical connectivity is determined between elements such as switches and routers in a multiple subnet communication network. Each element has one or more interfaces each of which is physically linked with an interface of another network element. Address sets are generated for each interface of the network elements, wherein members of a given address set correspond to network elements that can be reached from the corresponding interface for which the given address set was generated. The members of first address sets generated for corresponding interfaces of a given network element, are compared with the members of second address sets generated for corresponding interfaces of network elements other than the given element. A set of candidate connections between an interface of the given network element and one or more interfaces of other network elements, are determined.Type: GrantFiled: October 28, 1999Date of Patent: February 24, 2004Assignee: Lucent Technologies Inc.Inventors: Yuri Breitbart, Minos N. Garofalakis, Clifford Eric Martin, Rajeev Rastogi, Srinivasan Seshadri, Abraham Silberschatz
-
Publication number: 20040010752Abstract: A system for, and method of, filtering an XML document with XPath expressions and a selective data dissemination system incorporating the system or the method. In one embodiment, the filtering system includes: (1) a tree builder that builds a document data tree for the XML document and an XPath expression tree based on substrings in the XPath expressions and (2) a tree prober, associated with the tree builder, that employs the XPath expression tree to probe the document data tree and obtain matches with the substrings.Type: ApplicationFiled: July 9, 2002Publication date: January 15, 2004Applicant: Lucent Technologies Inc.Inventors: Chee-Yong Chan, Pascal A. Felber, Minos N. Garofalakis, Rajeev Rastogi