At&t Intellectual Property I, LP

At+t Corp.

Columbia University

University of Michigan

National Science Foundation

Nikolaos Koudas

Divesh Srivastava

Shanmugavelayutham Muthukrishnan

Hosagrahar Visvesvaraya Jagadish

Piotr Indyk

Sudipto Guha

Ioannis Kotidis

Jignesh M Patel

Shurug Ali Al-Khalifa

Yuqing Wu

Themistoklis Palpanas

Panayiotis Tsaparas

Michael Rabinovich

Michail Vlachos

Nicolas Bruno

Sihem Amer-Yahia

Dimitrios Gunopulos

Philip Korn

Suresh Venkatasubramanian

Amélie Marian-Guerrier

Qing Zhang

Ting Yu

David Toman

Bing Tian Dai

Beng Chin Ooi

Zhiyuan Chen

Amit Jaywant Marathe

A method and apparatus for propagating updates in databases are disclosed. For example, the present method uses 'blocking' and/or 'thresholding' to delay update propagation and/or to limit the propagation of updates to an optimal stage. For example, the present method receives at least one database update and extracts at least one token from the at least one database update. The method then determines whether a threshold for propagating the at least one database update for the at least one token is reached. The method then propagates the at least one database update for updating an index structure of a database pertaining to the at least one token whose threshold has been reached.

Method and apparatus for propagating updates in databases

A method of adaptively evaluating a top-k query involves () forming a servers having respective server queues storing candidate answers, processing () the candidate answers, and () providing a top-k set as a query evaluation. Processing includes () adaptively choosing a winning server to whose queue a current candidate answer should be sent; () sending the current candidate answer to the winning server's queue; () adaptively choosing a next candidate answer to process from the winning server's queue; () computing a join between the current candidate answer and next candidate answers at the winning server, so as to produce a new current candidate answer; and () updating the top-k set with the new current candidate answer only if a score of the new current candidate answer exceeds a score of a top-k answer in a top-k set. A method of calculating scores for candidate answers is also provided.

[object Object]

A data structure that includes at least one partition containing non-confidential quasi-identifier microdata and at least one other partition containing confidential microdata is formed. The partitioned confidential microdata is disguised by transforming the confidential microdata to conform to a target distribution. The disguised confidential microdata and the quasi-identifier microdata are combined to generate a disguised data structure. The disguised data structure is used to carry out statistical analysis and to respond to a statistical query is directed to the use of confidential microdata. In this manner, the privacy of the confidential microdata is preserved.

Systems and associated computer program products that disguise partitioned data structures using transformations having targeted distributions

A method and apparatus for rapid identification of column heterogeneity in databases are disclosed. For example, the method receives data associated with a column in a database. The method computes a cluster entropy for the data as a measure of data heterogeneity and then determines whether said data is heterogeneous in accordance with the cluster entropy.

Method and apparatus for rapid identification of column heterogeneity

Certain exemplary embodiments provide a method comprising: automatically: receiving a plurality of elements for each of a plurality of continuous data streams; treating the plurality of elements as a first data stream matrix that defines a first dimensionality; reducing the first dimensionality of the first data stream matrix to obtain a second data stream matrix; computing a singular value decomposition of the second data stream matrix; and based on the singular value decomposition of the second data stream matrix, quantifying approximate linear correlations between the plurality of elements.

Apparatus and method for correlating synchronous and asynchronous data streams

Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided.

Method of pattern searching

A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.

Method and apparatus for ranked join indices

A vast amount of information currently accessible over the Web, and in corporate networks, is stored in a variety of databases, and is being exported as XML data. However, querying this totality of information in a declarative and timely fashion is problematic because this set of databases is dynamic, and a common schema is difficult to maintain. The present invention provides a solution to the problem of issuing declarative, ad hoc XPath queries against such a dynamic collection of XML databases, and receiving timely answers. There is proposed a decentralized architectures, under the open and the agreement cooperation models between a set of sites, for processing queries and updates to XML data. Each site consists of XML data nodes. (which export their data as XML, and also pose queries) and one XML router node (which manages the query and update interactions between sites). The architectures differ in the degree of knowledge individual router nodes have about data nodes containing specific XML data. There is therefore provided a method for accessing data over a wide area network comprising: providing a decentralized architecture comprising a plurality of data nodes each having a database, a query processor and a path index, and a plurality of router nodes each having a routing state, maintaining a routing state in each of the router nodes, broadcasting routing state updates from each of the databases to the router nodes, routing path queries to each of the databases by accessing the routing state.

Routing XML queries

The present invention relates to a method and apparatus for optimizing queries. The present invention discloses an efficient method for providing answers to queries under parametric aggregation constraints.

Method and apparatus for optimizing queries under parametric aggregation constraints

A method and system for performing a data stream query. A data stream query requiring a join operation on multiple data streams is approximated without performing the join operation. It is determined whether conditions of the query are proper to accurately approximate the join operation, and if the conditions are proper the join operation is approximated. The join operation is approximated by independently aggregating values of the data streams and comparing the independently aggregated values.

Method and system for performing queries on data streams

A system, method and computer-readable medium are disclosed for identifying representative data using sketches. The method embodiment comprises generating a plurality of vectors from a data set, modifying each of the vectors of the plurality of vectors and selecting one of the plurality of generated vectors according to a comparison of a summed distance between a modified vector associated with the selected generated vector and remaining modified vectors. Modifying the generated vectors may involve reduced each generated vector to a lower dimensional vector. The summed distance then represents a summed distance between the lower dimensional vector and remaining lower dimensional vectors.

Growing community of inventors

Springfield, NJ, United States of America

Nikolaos Koudas