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 |
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 |
20080301168 | GENERATING DATABASE SCHEMAS FOR RELATIONAL AND MARKUP LANGUAGE DATA FROM A CONCEPTUAL MODEL - A method, information processing system, and computer readable medium for generating a plurality of candidate database schemas including relational and mark-up language elements. An information model comprising a plurality of entities and at least one relationship defined there between is received. The information model has been annotated with at least one semantic characteristic, operational characteristic, and evolutional characteristic. The information model that has been annotated is analyzed. A score is associated with each entity based at least in part on attributes associated with each entity. Each entity is classified as one of a relational element and a mark-up language element. The information model that has been annotated is partitioned into a plurality of relational element mappings and a plurality of mark-up language element mappings. A plurality of database schemas associated with the information model that has been annotated is generated. | 12-04-2008 |
20090248723 | Method and Apparatus for Selecting an Optimal Delete-Safe Compression Method on List of Delta Encoded Integers - Techniques are disclosed for selecting a delete-safe compression method for a plurality of delta encoded data values (e.g., delta encoded integers or deltas). For example, a computer-implemented method for selecting an optimal delete-safe compression algorithm from among two or more compression algorithms for use on a plurality of delta encoded data values includes the following steps. The maximum number of data values eliminated by each of the two or more compression algorithms is computed. For the plurality of delta encoded data values to be compressed, the minimum size of the plurality of delta encoded data values before compression thereof is computed. A delete-safe threshold value is computed based on the minimum size of the plurality of delta encoded data values. Then, the compression algorithm is selected from the two or more compression algorithms that achieves the delete-safe threshold value. | 10-01-2009 |
20090248724 | Method and Apparatus for Encoding List of Variable Length Structures to Support Bi-Directional Scans - Techniques are disclosed for encoding a variable length structure such that it facilitates forward and reverse scans of a list of such structures as needed. While the techniques are applicable to a wide variety of applications, they are particularly well-suited for use with structures such as those found in compressed database indexes. For example, a computer-implemented method for processing one or more variable length data structures includes the following steps. Each variable length data structure is obtained. Each variable length structure comprises one or more data block. A variable length encoding process is applied to the one or more blocks of each variable length data structure which comprises setting a continuation data value in each block to a first value or a second value, wherein the setting of the continuation data values enables bi-directional scanning of each variable length structure. | 10-01-2009 |
20090248725 | COMPRESSABILITY ESTIMATION OF NON-UNIQUE INDEXES IN A DATABASE MANAGEMENT SYSTEM - A method, information processing system, and computer readable storage product estimate a compression factor. A set of key values within an index are analyzed. Each key value is associated with a record identifier (“RID”) list comprising a set of RIDs. The index is in an uncompressed format and includes a total byte length. A number of RIDs associated with each key value is estimated for each key value in the set of key values. A total byte length for all RID deltas between each at least two consecutive RIDs within a RID list is estimated for each RID list based on the number of RIDs that have been determined. The total byte length estimated for each RID list is accumulated. A compression factor associated with the index is determined by dividing the total byte length that has been accumulated by the byte length of the index. | 10-01-2009 |
20100312779 | ONTOLOGY-BASED SEARCHING IN DATABASE SYSTEMS - A method, information processing system, and computer program storage product retrieve data from a database. A search request is received from a user for a set of data in at least one database. An ontology query over is performed over at least one ontology associated with at least one database resulting in an ontological dataset associated with the search request in response to receiving the search request from the user. The ontological dataset includes at least one of a set of synonyms, a set of hypernyms, and a set of hyponyms, associated with the search request. A data query is performed over data in the at least one database using the ontological dataset in response to performing the ontology query. The set of data is returned to the user based on the data query that has been performed. | 12-09-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 |
20110125730 | Optimizing Queries to Hierarchically Structured Data - Techniques are disclosed for optimizing queries to hierarchically structured data. For example, a method for processing a query directed to data having a hierarchical structure with a plurality of data nodes comprises the following steps. One or more structural attributes describing the hierarchical structure of the data are identified. The query is partitioned into two or more query partitions using at least one of the one or more identified structural attributes. A parallel execution plan is determined for the query by splitting into components one or more of: the query into at least two of the query partitions; and the hierarchical structure of the data. The split components are executed in parallel on different computer processes according to the parallel execution plan. | 05-26-2011 |