| Patent application number | Description | Published |
|---|
| 20080215520 | METHOD AND SYSTEM FOR INDEXING AND SERIALIZING DATA - The present invention provides a computer implemented method, an apparatus, and a computer usable program product for indexing data. A controller identifies a set of data to be indexed, wherein a set of data structure trees represents the set of data. The controller merges the set of data structure trees to form a unified tree, wherein the unified tree contains a node for each unit of data in the set of data. The controller assigns an identifier to the node for each unit of data in the set of data that describes the node within the unified tree. The controller then serializes the unified tree to form a set of sequential series that represents the set of data structure trees, wherein the set of sequential series forms an index for the set of data. | 09-04-2008 |
| 20080215542 | Method For Supporting Ontology-Related Semantic Queries in DBMSs with XML Support - A method for supporting semantic matching queries in a database management system (DBMS) by extracting and storing the transitive/subsumption relationships from a given ontology data in a DBMS with native XML support. These transitive relationships are transformed into a set of XML documents that are natural mappings of the hierarchical structure of the transitive relationships. A table function construct expresses semantic matching queries in a declarative manner. The semantic matching queried are automatically rewritten or translated into standard SQL/XML search operators such as XQuery, XPath and XMLExists, and executed by the SQL/XML DBMS on the given instance data and the extracted transitive relationships data. | 09-04-2008 |
| 20080222060 | SYSTEM AND METHOD OF MINING TIME-CHANGING DATA STREAMS USING A DYNAMIC RULE CLASSIFIER HAVING LOW GRANULARITY - A dynamic rule classifier for mining a data stream includes at least one window for viewing data contained in the data stream and a set of rules for mining the data. Rules are added and the set of rules are updated by algorithms when an drift in a concept within the data occurs, causing unacceptable drops in classification accuracy. The dynamic rule classifier is also implemented as a method and a computer program product. | 09-11-2008 |
| 20080243811 | SYSTEM AND METHOD FOR RANKED KEYWORD SEARCH ON GRAPHS - Arrangements and methods for providing for the efficient implementation of ranked keyword searches on graph-structured data. Since it is difficult to directly build indexes for general schemaless graphs, conventional techniques highly rely on graph traversal in running time. The previous lack of more knowledge about graphs also resulted in great difficulties in applying pruning techniques. To address these problems, there is introduced herein a new scoring function while the block is used as an intermediate access level; the result is an opportunity to create sophisticated indexes for keyword search. Also proposed herein is a cost-balanced expansion algorithm to conduct a backward search, which provides a good theoretical guarantee in terms of the search cost. | 10-02-2008 |
| 20080270374 | METHOD AND SYSTEM FOR COMBINING RANKING AND CLUSTERING IN A DATABASE MANAGEMENT SYSTEM - A system for combining ranking and clustering in a query. Bit vectors are intersected on Boolean attributes resulting in a vector. Two summary grids are constructed by intersecting bit vectors on clustering and ranking attributes. The vector is intersected with each summary grid to obtain a filtered clustering and ranking grid. An algorithm is applied on the clustering grid to obtain clusters. Vectors associated with buckets in the clusters are intersected resulting in one vector for each cluster. The vector corresponding to each cluster is intersected with the ranking grid to obtain a modified grid. Buckets are pruned according to bounds of each bucket in the modified grid and a predetermined number to obtain candidate buckets containing the predetermined number of data. The data are retrieved and a ranking score is calculated. The top predetermined number of data are sorted according to ranking scores and a result is returned. | 10-30-2008 |
| 20080275646 | METHOD AND SYSTEM FOR MINIMAL DETOUR ROUTING WITH MULTIPLE STOPS - The present invention provides a system and method for optimizing routes that include multiple stops. This is accomplished by allowing users to identify a starting point, a destination, and types of businesses or other locations to be visited along the way. A route processor then provides users with a list of stores or other requested detour choices yielding a trip of optimal itinerary. The detour choices may be either an ordered sequence or an unordered set of points to be visited and may include constraints that make it possible to optimize utility functions according to user preferences. | 11-06-2008 |
| 20090049035 | System and method for indexing type-annotated web documents - Methods and apparatus generate an index for use in a document retrieval system where the index is organized by type and keyword. Redundancy in the index is reduced by organizing type entries in a hierarchy of internal and leaf nodes. Determining whether to generate an inverted list for a type is based on the position of the type in the hierarchy; generally inverted lists are generated only for types corresponding to leaf nodes. Redundancy is further reduced by re-using inverted lists generated for keywords for types when there is an overlap between keywords and types. Search performance using the document retrieval index is improved by adding entries corresponding to combinations of keywords and types. The intersections of inverted lists associated with the keywords and types comprising the combinations are determined and added to the index for use in search operations. Determining whether to add an entry for a keyword-type combination is made on a cost-benefit analysis dependent, at least in part, on the proximity of the keyword to type in documents containing the combination. | 02-19-2009 |
| 20090187914 | SYSTEM AND METHOD FOR LOAD SHEDDING IN DATA MINING AND KNOWLEDGE DISCOVERY FROM STREAM DATA - Load shedding schemes for mining data streams. A scoring function is used to rank the importance of stream elements, and those elements with high importance are investigated. In the context of not knowing the exact feature values of a data stream, the use of a Markov model is proposed herein for predicting the feature distribution of a data stream. Based on the predicted feature distribution, one can make classification decisions to maximize the expected benefits. In addition, there is proposed herein the employment of a quality of decision (QoD) metric to measure the level of uncertainty in decisions and to guide load shedding. A load shedding scheme such as presented herein assigns available resources to multiple data streams to maximize the quality of classification decisions. Furthermore, such a load shedding scheme is able to learn and adapt to changing data characteristics in the data streams. | 07-23-2009 |
| 20090248749 | System and Method for Scalable Processing of Multi-Way Data Stream Correlations - A computer implemented method, apparatus, and computer usable program code for processing multi-way stream correlations. Stream data are received for correlation. A task is formed for continuously partitioning a multi-way stream correlation workload into smaller workload pieces. Each of the smaller workload pieces may be processed by a single host. The stream data are sent to different hosts for correlation processing. | 10-01-2009 |
| 20100145986 | Querying Data and an Associated Ontology in a Database Management System - A method, apparatus, and computer program for querying data and an associated ontology in a database. An ontology is associated with data in database. Responsive to receiving a query from a requestor, relational data in the database is identified using the query to form identified relational data. Ontological knowledge in the ontology is identified using the identified relational data and the ontology. A result is returned to the requestor. | 06-10-2010 |
| 20110078187 | SEMANTIC QUERY BY EXAMPLE - A computer-implemented method, system, and computer program product for producing a semantic query by example are provided. The method includes receiving examples of potential results from querying a database table with an associated ontology, and extracting features from the database table and the examples based on the associated ontology. The method further includes training a classifier based on the examples and the extracted features, and applying the classifier to the database table to obtain a semantic query result. The method also includes outputting the semantic query result to a user interface, and requesting user feedback of satisfaction with the semantic query result. The method additionally includes updating the classifier and the semantic query result iteratively in response to the user feedback. | 03-31-2011 |
