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

Abstract: A system, method and computer readable medium are disclosed. The method embodiment relates to a method of computing score of candidate answers to a database query. The method comprises receiving a database query, assigning a first score to a match to the query, the first score being associated with a relative importance of an individual keyword in a collection of documents based on all structural and content predicates in the query, assigning a second score to the match, the second score being associated with a relative importance of a keyword in an individual document and using the assigned first score and second score to compute an answer score for the query.

Abstract: 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.

Abstract: In accordance with a method of encoding meta-data associated with tree-structured data, a first set of elements of a plurality of elements in the tree-structured is associated explicitly with explicit meta-data levels, and a second set of elements of the plurality of elements is associated by inheritance with explicit meta-data levels of closest ancestor elements of the first set of elements. The plurality of elements is packed into a plurality of leaf nodes of an index structure. The plurality of leaf nodes is merged into a plurality of non-leaf nodes until a root non-leaf node is generated. The plurality of non-leaf nodes of the index structure is associated with indicators representing ranges of the explicit meta-data levels in the packed first set of elements, such that explicit meta-data level ranges of descendant non-leaf nodes are subsets of explicit meta-data level ranges of ancestor non-leaf nodes.

Abstract: The specification describes data processes for analyzing large data steams for target anomalies. “Sequential dependencies” (SDs) are chosen for ordered data and present a framework for discovering which subsets of the data obey a given sequential dependency. Given an interval G, an SD on attributes X and Y, written as X?G Y, denotes that the distance between the Y-values of any two consecutive records, when sorted on X, are within G. SDs may be extended to Conditional Sequential Dependencies (CSDs), consisting of an underlying SD plus a representation of the subsets of the data that satisfy the SD. The conditional approximate sequential dependencies may be expressed as pattern tableaux, i.e., compact representations of the subsets of the data that satisfy the underlying dependency.

Abstract: The similarity between a query set comprising query set tokens and a database set comprising database set tokens is determined by a similarity score. The database sets belong to a data collection set, which contains all database sets from which information may be retrieved. If the similarity score is greater than or equal to a user-defined threshold, the database set has information relevant to the query set. The similarity score is calculated with an inverse document frequency method (IDF) similarity measure independent of term frequency. The document frequency is based at least in part on the number of database sets in the data collection set and the number of database sets which contain at least one query set token. The length of the query set and the length of the database set are normalized.

Abstract: A disclosed method for implementing time decay in the analysis of streaming data objects is based on the age, referred to herein as the forward age, of a data object measured from a landmark time in the past to a time associated with the occurrence of the data object, e.g., an object's timestamp. A forward time decay function is parameterized on the forward age. Because a data object's forward age does not depend on the current time, a value of the forward time decay function is determined just once for each data object. A scaling factor or weight associated with a data object may be weighted according to its decay function value. Forward time decay functions are beneficial in determining decayed aggregates, including decayed counts, sums, and averages, decayed minimums and maximums, and for drawing decay-influenced samples.

Abstract: A method and system for monitoring traffic in a data communication network and for extracting useful statistics and information is disclosed.

Abstract: 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.

Abstract: 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.

Abstract: In accordance with a method of encoding meta-data associated with tree-structured data, a first set of elements of a plurality of elements in the tree-structured is associated explicitly with explicit meta-data levels, and a second set of elements of the plurality of elements is associated by inheritance with explicit meta-data levels of closest ancestor elements of the first set of elements. The plurality of elements is packed into a plurality of leaf nodes of an index structure. The plurality of leaf nodes is merged into a plurality of non-leaf nodes until a root non-leaf node is generated. The plurality of non-leaf nodes of the index structure is associated with indicators representing ranges of the explicit meta-data levels in the packed first set of elements, such that explicit meta-data level ranges of descendant non-leaf nodes are subsets of explicit meta-data level ranges of ancestor non-leaf nodes.

Abstract: A method and apparatus for providing an anonymization of data are disclosed. For example, the method receives a request for anonymizing, wherein the request comprises a bipartite graph for a plurality of associations or a table that encodes the plurality of associations for the bipartite graph. The method places each node in the bipartite graph in a safe group and provides an anonymized graph that encodes the plurality of associations of the bipartite graph, if a safe group for all nodes of the bipartite graph is found.

Abstract: In embodiments of the disclosed technology, indexes, such as inverted indexes, are updated only as necessary to guarantee answer precision within predefined thresholds which are determined with little cost in comparison to the updates of the indexes themselves. With the present technology, a batch of daily updates can be processed in a matter of minutes, rather than a few hours for rebuilding an index, and a query may be answered with assurances that the results are accurate or within a threshold of accuracy.

Abstract: Techniques are disclosed that efficiently support the querying of meta-data in XML documents. The techniques include efficiently identifying XML elements along each location step in an XPath query that satisfy range constraints on ordered meta-data. The techniques include generating an inheritance meta-data index in which actual meta-data levels are associated only with elements for which a value is explicitly specified and associating non-leaf nodes of the index structure with inherited meta-data levels and inheritance source nodes. The techniques may be used with navigation-based and join-based XPath evaluation strategies.

Abstract: A method and system for truth discovery may implement a methodology that accounts for accuracy of sources and dependency between sources. The methodology may be based on Bayesian probability calculus for determining which data object values published by sources are likely to be true. The method may be recursive with respect to dependency, accuracy, and actual truth discovery for a plurality of sources.

Abstract: A method and system for monitoring traffic in a data communication network and for extracting useful statistics and information is disclosed.

Abstract: A method for mapping relationships in a database results in a cluster graph. A representative sample of records in each of a plurality of tables in the database is analyzed for nearest neighbor join edges instantiated by the record. Records with corresponding nearest neighbor join edges are grouped into clusters. Cluster pairs which share a join relationship between two tables are identified. A weighting may be applied to cluster pairs based on the number of records for the cluster pair. Meaningful cluster pairs above a weighted threshold may be ordered according to table and displayed as a cluster graph. Analyses of the cluster graph may reveal important characteristics of the database.

Abstract: A method and apparatus for providing an anonymization of data are disclosed. For example, the method receives a communications graph that encodes a plurality of types of interactions between two or more entities. The method partitions the two or more entities into a plurality of classes, and applies a type of anonymization to the communications graph.

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.

Abstract: Methods and apparatus to determine statistical dominance point descriptors for multidimensional data are disclosed. An example method disclosed herein comprises determining a first joint dominance value for a first data point in a multidimensional data set, data points in the multidimensional data set comprising multidimensional values, each dimension corresponding to a different measurement of a physical event, the first joint dominance value corresponding to a number of data points in the multidimensional data set dominated by the first data point in every dimension, determining a first skewness value for the first data point, the first skewness value corresponding to a size of a first dimension of the first data point relative to a combined size of all dimensions of the first data point, and combining the first joint dominance and first skewness values to determine a first statistical dominance point descriptor associated with the first data point.