Lucent Technologies Inc.

Alcatel-lucent USA Inc.

Alcatel Lucent

Yahoo! Inc.

At+t Corp.

Rajeev R Rastogi

Abraham Silberschatz

Minos N Garofalakis

Banu Rahime Ozden

Kyuseok Shim

Srinivasan Seshadri

Yuri J Breitbart

Sundararajarao Sudarshan

Sumit Ganguly

Philip L Bohannon

Yigal Bejerano

Clifford Eric Martin

Amit Kumar

Mark Anthony Smith

Philip Lewis Bohannon

Raghavan V Komondoor

Srinivasan H Sengamedu

Alexandros Biliris

S Jamaloddin Golestani

Dennis W Leinbaugh

Sudipto Guha

Krishan Kumar Sabnani

Hosagrahar Visvesvaraya Jagadish

Michael E Flaster

Johannes Gehrke

Wenfei Fan

Ashwin Devendrappa Tengli

Euthimios Panagos

Bruce K Hillyer

Michael Abraham Benedikt

Sridhar Ramaswamy

Ben Jai

Rupesh R Mehta

Sayan Ranu

Gokul Chander Prabhakar

Thomas Charles Bressoud

Kanthi Nagaraj

Naidu Kundrapu Venkata Marayya

Ariel Orda

Scott Satkin

Abhinandan Sujit Das

James Allen Parker

Alexander Sprintson

Jeyashankher Ramamirtham

Alin Dobra

Shivnath Babu

Sandeepkumar Bhuramal Satpal

Aristides Gionis

Rushi Prafull Bhatt

Vineet Shashikant Chaoji

Kaushik Chakrabarti

Apostol Ivanov Natsev

Mohana Krishna Lakhamraju

Giuseppe F Italiano

Bulent Yener

Pudugramam S Narayanan

Prashant J Shenoy

Anupam Gupta

Improved techniques are disclosed for processing data stream queries wherein a data stream is obtained, a set of aggregate queries to be executed on the data stream is obtained, and a query plan for executing the set of aggregate queries on the data stream is generated. In a first method, the generated query plan includes generating at least one intermediate aggregate query, wherein the intermediate aggregate query combines a subset of aggregate queries from the set of aggregate queries so as to pre-aggregate data from the data stream prior to execution of the subset of aggregate queries such that the generated query plan is optimized for computational expense based on a given cost model. In a second method, the generated query plan includes identifying similar filters in two or more aggregate queries of the set of aggregate queries and combining the similar filters into a single filter such that the single filter is usable to pre-filter data input to the two or more aggregate queries.

Method and apparatus for efficient aggregate computation over data streams

Exemplary methods and apparatuses are provided which may be implemented using one or more computing devices to allow for super clustering of clusters of electronic documents based, at least in part, on structural and static content features.

Methods and apparatuses for clustering electronic documents based on structural features and static content features

Web pages are efficiently categorized in a data processor without analyzing the content of the web pages. According to at least one embodiment, data is maintained that represents sample URLs grouped into a plurality of clusters. The sample URLs of a cluster are used to produce a URL regular expression pattern ('URL-regex') that differentiates the sample URLs of the cluster from the sample URLs of other clusters and that covers at least a specified percentage of the sample URLs in the cluster. The process of producing a URL-regex is repeated for each of the clusters producing a URL-regex for each cluster. Web pages are then categorized into one of the clusters by determining which of the URL-regex patterns produced for the clusters match URLs that refer to the web pages. Thus, a web page may be categorized based on a URL that refers to the web page without having to obtain and analyze the content of the web page.

Techniques for categorizing web pages

A method, a system and a computer program product for maximizing content spread in a social network are provided. Samples of edges are generated from an initial candidate set of edges. Each edge of the samples of edges has a probability value for content flow. Further, a subset of edges is determined from the samples of edges based on gain corresponding to each edge. Also, each node of the subset of edges is having at least one of less than 'K' or equal to 'K' incoming edges. Further, the probability of each edge, of the subset of edges, may be incremented. Furthermore, a final set of edges may be determined by ensuring &#x2018;K&#x2019; incoming edges. The &#x2018;K&#x2019; incoming edges may be ensured by removing one or more incoming edges when a number of the incoming edges for a node of the final set is greater than &#x2018;K&#x2019; incoming edge.

Method and system for maximizing content spread in social network

A number of configuration elements are associated with a number of devices. Information about input configuration elements is accessed. An input configuration element is associated with one or more input rules. It is determined which of the configuration elements could be accessed by the input rules and any call chains emanating from the rules. Output rules are determined by using the accessed configuration elements, the input rules, and the way the input rule manipulates its accessed configuration elements. Each output rule may be derived from an input rule and corresponds to the same input configuration element associated with that input rule. An executable module is generated that is adapted to access at least a given one of the input configuration elements and to trigger one or more of the output rules corresponding to the given input configuration element. Read and write sets for rules are determined, and the triggered output rules ensure that restrictions associated with a configuration element are not violated.

Automated transformation of specifications for devices into executable modules

Methods and apparatus are provided for identifying constraint violation repairs in data that is comprised of a plurality of records, where each record has a plurality of cells. A database is processed, based on a plurality of constraints that data in the database must satisfy. At least one constraint violation to be resolved is identified based on a cost of repair and the corresponding records to be resolved and equivalent cells are identified in the data that violate the identified at least one constraint violation. A value for each of the equivalent cells can optionally be determined, and the determined value can be assigned to each of the equivalent cells. The at least one constraint violation selected for resolution may be, for example, the constraint violation with a lowest cost. The cost of repairing a constraint is based on a distance metric between the attributes values.

Equivalence class-based method and apparatus for cost-based repair of database constraint violations

Restoration is provided in a communication system having two or more VPN endpoints coupled together through a network comprising a number of nodes interconnected through edges. VPN endpoints coupled through the network are adapted to communicate through a single connection with multiple other VPN endpoints. The single connection may be a VPN hose connection. A restoration topology, comprising backup edges corresponding to primary edges in the network, is determined for the network. A given primary edge is replaced with one or more backup edges if the given primary edge fails. A graph may represent the network and a tree may represent the connections in the network for VPNs connecting the VPN endpoints. The graph can be reduced to a second graph by determining shortest paths between each node in the tree and creating the backup edges from the shortest paths. The second graph can be reduced to a third graph by adding additional backup edges from tree nodes having non-tree edges to least common ancestor nodes. The third graph can be used to create a two-edge connected tree.

Restoration for virtual private networks

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.

Distributed set-expression cardinality estimation

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.

Method for distinct count estimation over joins of continuous update stream

A distinct-count estimate is obtained in a guaranteed small footprint using a two level hash, distinct count sketch. A first hash fills the first-level hash buckets with an exponentially decreasing number of data-elements. These are then uniformly hashed to an array of second-level-hash tables, and have an associated total-element counter and bit-location counters. These counters are used to identify singletons and so provide a distinct-sample and a distinct-count. An estimate of the total distinct-count is obtained by dividing by the distinct-count by the probability of mapping a data-element to that bucket. An estimate of the total distinct-source frequencies of destination address can be found in a similar fashion. By further associating the distinct-count sketch with a list of singletons, a total singleton count and a heap containing the destination addresses ordered by their distinct-source frequencies, a tracking distinct-count sketch may be formed that has considerably improved query time.

Streaming algorithms for robust, real-time detection of DDoS attacks

A method of estimating set-expression cardinalities over data streams with guaranteed small maintenance time per data-element update. The method only examines each data element once and uses a limited amount of memory. The time-efficient stream synopsis extends 2-level hash-sketches by randomly, but uniformly, pre-hashing data-elements prior to logarithmically hashing them to a first-level hash-table. This generates a set of independent 2-level hash-sketches. The set-union cardinality can be estimated by determining the smallest hash-bucket index j at which only a predetermined fraction of the b hash-buckets has a non-empty union |A&#x222a;B|. Once a set-union cardinality is estimated, general set-expression cardinalities may be estimated by counting witness elements for the set-expression, i.e., those first-level hash-buckets that are both a singleton for the set-expression and a set-union singleton. The set-expression cardinality is the set-union cardinality times the number of witness elements divided by the number of hash-buckets.

Tracking set-expression cardinalities over continuous update streams

A method and apparatus are provided for routing a packet within a plurality of n nodes arranged in a line or tree (or a combination of the foregoing), given a maximum stack depth, s. A fixed stack process for routing packets on a line given a stack depth, s, initially divides a line of n nodes into segments, such as napproximately equal segments. A unique label is assigned to each segment and, within each segment, one of up to nlabels is assigned to each node. A fixed stack process for routing packets on a tree, given a target stack depth, s, initially identifies a subset, S, of at nodes from the tree, such as at most 3 nnodes, such that after the subset, S, is removed, each remaining subtree has at most nnodes. A unique label is assigned to each of the nodes in the subset S and, within each remaining subtree, one of up to nlabels is assigned to each node. If the bound on the stack depth cannot be violated, the fixed stack routing process merges every two consecutive levels in the stack to one level.

Method and apparatus for routing a packet within a plurality of nodes arranged in a line or a tree given a maximum stack depth

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.

System and method for determining the physical topology of a network having multiple subnets

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).

Computing optimal channel allocations using decomposition methods and related devices

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.

Method for performing information-preserving DTD schema embeddings

Growing community of inventors

New Providence, NJ, United States of America

Rajeev R Rastogi