Search Patents
  • Method for distinct count estimation over joins of continuous update stream
    Publication number: 20060085592
    Abstract: The invention provides methods and systems for summarizing multiple continuous update streams using corresponding multiple (parallel) JD Sketch data structures such that, for example, an approximate answer to a query requiring a join operation followed by a duplicate elimination step may be rapidly provided.
    Type: Application
    Filed: September 30, 2004
    Publication date: April 20, 2006
    Inventors: Sumit Ganguly, Minos Garofalakis, Amit Kumar, Rajeev Rastogi
  • Computing optimal channel allocations using decomposition methods and related devices
    Publication number: 20060067258
    Abstract: By decomposing (i.e., dividing) an interference graph into subgraphs, it becomes feasible to compute close approximations of an optimal channel allocation scheme within a reasonable amount of time. The channel allocation scheme may be used to allocate specific channels to access points (APs) in a wireless, local area network (WLAN).
    Type: Application
    Filed: September 30, 2004
    Publication date: March 30, 2006
    Inventors: S. Golestani, Rajeev Rastogi, Mark Smith
  • Approximate query processing using wavelets
    Patent number: 6760724
    Abstract: 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: Grant
    Filed: July 24, 2000
    Date of Patent: July 6, 2004
    Assignee: Lucent Technologies Inc.
    Inventors: Kaushik Chakrabarti, Minos N. Garofalakis, Rajeev Rastogi, Kyuseok Shim
  • Methods and devices for approximating optimal channel allocations
    Publication number: 20060067267
    Abstract: Channels are allocated to access points (APs) within a wireless, local area network (WLAN) in a reasonable time period using approximation methods. One approximation method guarantees channel allocations will be no less than ? of an optimal channel allocation scheme provided the interference pattern associated with APs within a given WLAN conform to a unit disk graph interference pattern.
    Type: Application
    Filed: September 30, 2004
    Publication date: March 30, 2006
    Inventors: S. Golestani, Rajeev Rastogi, Mark Smith
  • Efficient constraint monitoring using adaptive thresholds
    Publication number: 20090077156
    Abstract: Methods for tracking anomalous behavior in a network referred to as non-zero slack schemes are provided. The non-zero slack schemes reduce the number of communication messages in the network necessary to monitor emerging large-scale, distributed systems using distributed computation algorithms by generating more optimal local constraints for each remote site in the system.
    Type: Application
    Filed: January 31, 2008
    Publication date: March 19, 2009
    Inventors: Srinivas Raghav Kashyap, Rajeev Rastogi, S. R. Jeyashankher, Pushpraj Shukla
  • Apparatus and Method for Creating User Defined Variable Size Tags on Records in RDBMS
    Publication number: 20170322963
    Abstract: An apparatus and method for creating user defined variable size tags on records in relational database management systems (RDBMS)are disclosed. When creating a table, one of the columns may be created as a new data-type called a “TAG” data-type. The new data-type called “TAG” is used to store various values for a single column against the single record.
    Type: Application
    Filed: July 11, 2017
    Publication date: November 9, 2017
    Inventors: Prasanna Venkatesh Ramamurthi, Kumar Rajeev Rastogi, Dilip Kumar
  • System and Method for Caching and Parameterizing IR
    Publication number: 20170161325
    Abstract: A system and method of caching and parameterizing intermediate representation code includes receiving, by a database, a query, parsing, by the database, the query to obtain a plan tree comprising a plurality of plan nodes arranged in hierarchical order descending from a top plan node, generating, by the database, node intermediate representations (IRs) for the plan nodes, executing, by the database, a first query using the node IRs, and reusing, by the database, the node IRs to execute subsequent queries.
    Type: Application
    Filed: December 7, 2015
    Publication date: June 8, 2017
    Inventors: Kumar Rajeev Rastogi, Yonghua Ding, Cheng Zhu
  • Computing optimal channel allocations using decomposition methods and related devices
    Patent number: 7522566
    Abstract: By decomposing (i.e., dividing) an interference graph into subgraphs, it becomes feasible to compute close approximations of an optimal channel allocation scheme within a reasonable amount of time. The channel allocation scheme may be used to allocate specific channels to access points (APs) in a wireless, local area network (WLAN).
    Type: Grant
    Filed: September 30, 2004
    Date of Patent: April 21, 2009
    Assignee: Alcatel-Lucent USA Inc.
    Inventors: S. Jamaloddin Golestani, Rajeev Rastogi, Mark Anthony Smith
  • Channel allocation for wireless mesh networks
    Publication number: 20080159316
    Abstract: An example embodiment includes determining a cut of a graph to obtain a bi-partite sub-graph, where the graph represents a plurality of nodes and links between the plurality of nodes in a wireless mesh network. A channel is assigned to the bi-partite graph, and the obtained bi-partite subgraph is removed from the graph. The determining, assigning and removing steps are repeated until the graph has been divided into k bipartite subgraphs, where k is the number of channels being used for scheduling.
    Type: Application
    Filed: May 4, 2007
    Publication date: July 3, 2008
    Inventors: Partha Dutta, Sharad Jaiswal, Rajeev Rastogi
  • System and method for monitoring link delays and faults in an IP network
    Publication number: 20050081116
    Abstract: A system for, and method of, monitoring link delays and faults in an IP network. In one embodiment, the system includes: (1) a monitoring station identifier that computes a set of monitoring stations that covers links in at least a portion of the network and (2) a probe message identifiers coupled to the monitoring station identifier, that computes a set of probe messages to be transmitted by at least ones of the set of monitoring stations such that the delays and faults can be determined.
    Type: Application
    Filed: September 26, 2003
    Publication date: April 14, 2005
    Applicant: Lucent Technologies, Inc.
    Inventors: Yigal Bejerano, Rajeev Rastogi
  • Distributed set-expression cardinality estimation
    Publication number: 20060149744
    Abstract: 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: Application
    Filed: December 30, 2004
    Publication date: July 6, 2006
    Inventors: Abhinandan Das, Sumit Ganguly, Minos Garofalakis, Rajeev Rastogi
  • Document descriptor extraction method
    Patent number: 7080314
    Abstract: 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: Grant
    Filed: June 16, 2000
    Date of Patent: July 18, 2006
    Assignee: Lucent Technologies Inc.
    Inventors: Minos N. Garofalakis, Aristides Gionis, Rajeev Rastogi, Srinivasan Seshadri, Kyuseok Shim
  • System and method for monitoring link delays and faults in an IP network
    Patent number: 7472314
    Abstract: A system for, and method of, monitoring link delays and faults in an IP network. In one embodiment, the system includes: (1) a monitoring station identifier that computes a set of monitoring stations that covers links in at least a portion of the network and (2) a probe message identifier, coupled to the monitoring station identifier, that computes a set of probe messages to be transmitted by at least ones of the set of monitoring stations such that the delays and faults can be determined.
    Type: Grant
    Filed: September 26, 2003
    Date of Patent: December 30, 2008
    Assignee: Alcatel - Lucent USA Inc.
    Inventors: Yigal Bejerano, Rajeev Rastogi
  • System and method for caching and parameterizing IR
    Patent number: 10339137
    Abstract: A system and method of caching and parameterizing intermediate representation code includes receiving, by a database, a query, parsing, by the database, the query to obtain a plan tree comprising a plurality of plan nodes arranged in hierarchical order descending from a top plan node, generating, by the database, node intermediate representations (IRs) for the plan nodes, executing, by the database, a first query using the node IRs, and reusing, by the database, the node IRs to execute subsequent queries.
    Type: Grant
    Filed: December 7, 2015
    Date of Patent: July 2, 2019
    Assignee: Futurewei Technologies, Inc.
    Inventors: Kumar Rajeev Rastogi, Yonghua Ding, Cheng Zhu
  • Method for performing information-preserving DTD schema embeddings
    Publication number: 20060212860
    Abstract: 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 mimimal 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: Application
    Filed: September 30, 2004
    Publication date: September 21, 2006
    Inventors: Michael Benedikt, Minos Garofalakis, Rajeev Rastogi
  • TIMESTAMP-BASED SYSTEM AND METHOD FOR SERIALIZING LAZY UPDATES IN A DISTRIBUTED DATABASE
    Publication number: 20020087501
    Abstract: A system for, and method of, ensuring serialization of lazy updates in a distributed database described by a directed acyclic copy graph. In one embodiment, the system includes: (1) a timestamp module that creates a unique timestamp for each of the lazy updates and (2) a propagation module, associated with the timestamp module, that employs edges of the directed acyclic copy graph to propagate the lazy updates among replicas in the distributed database according to said unique timestamp and ensure the serialization.
    Type: Application
    Filed: September 9, 1999
    Publication date: July 4, 2002
    Inventors: YURI J. BREITBART, RAGHAVAN V. KOMONDOOR, RAJEEV RASTOGI, SRINIVASAN SESHADRI, ABRAHAM SILBERSCHATZ
  • System and method for compressing a data table using models
    Patent number: 7143046
    Abstract: 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: Grant
    Filed: December 28, 2001
    Date of Patent: November 28, 2006
    Assignee: Lucent Technologies Inc.
    Inventors: Shivnath Babu, Minos N. Garofalakis, Rajeev Rastogi
  • System and method for compressing a data table using models
    Publication number: 20030130855
    Abstract: 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: Application
    Filed: December 28, 2001
    Publication date: July 10, 2003
    Applicant: Lucent Technologies Inc.
    Inventors: Shivnath Babu, Minos N. Garofalakis, Rajeev Rastogi
  • System and method for filtering XML documents with XPath expressions
    Publication number: 20040010752
    Abstract: 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: Application
    Filed: July 9, 2002
    Publication date: January 15, 2004
    Applicant: Lucent Technologies Inc.
    Inventors: Chee-Yong Chan, Pascal A. Felber, Minos N. Garofalakis, Rajeev Rastogi
  • Channel allocation for wireless mesh networks
    Patent number: 8010121
    Abstract: An example embodiment includes determining a cut of a graph to obtain a bi-partite sub-graph, where the graph represents a plurality of nodes and links between the plurality of nodes in a wireless mesh network. A channel is assigned to the bi-partite graph, and the obtained bi-partite subgraph is removed from the graph. The determining, assigning and removing steps are repeated until the graph has been divided into k bi-partite subgraphs, where k is the number of channels being used for scheduling.
    Type: Grant
    Filed: May 4, 2007
    Date of Patent: August 30, 2011
    Assignee: Alcatel Lucent
    Inventors: Partha Dutta, Sharad Jaiswal, Rajeev Rastogi
Narrow Results

Filter by US Classification