Class / Patent application number | Description | Number of patent applications / Date published |
707745000 | Bitmap index | 32 |
20100125583 | Tracking Memory Space in a Storage System - One embodiment is a method that uses a hierarchical bitmap tree in a storage system to store where available and unavailable memory space exists. Bitmap blocks are retrieved from the hierarchical bitmap tree to locate the available memory space. | 05-20-2010 |
20100169322 | EFFICIENT ACCESS OF BITMAP ARRAY WITH HUGE USAGE VARIANCE ALONG LINEAR FASHION, USING POINTERS - A system and method for locating an unallocated bit in a bitmap array includes traversing the bitmap array using a plurality of pointers to locate a unit. The unit includes a plurality of entities and at least one of the plurality of entities is unallocated. The method further includes traversing the at least one of the plurality of unallocated entities in the unit to obtain an unallocated entity. The unit is associated with at least one pointer, and the at least one pointer is associated with a plurality of threshold values and a fill count, the fill count being less than a maximum fill count of the bitmap array. | 07-01-2010 |
20110225166 | FREQUENT ITEMSET COUNTING USING CLUSTERED PREFIXES AND INDEX SUPPORT - Techniques are provided for (2) extending SQL to support direct invocation of frequent itemset operations, (3) improving the performance of frequent itemset operations by clustering itemset combinations to more efficiently use previously produced results, and (4) making on-the-fly selection of the occurrence counting technique to use during each phase of a multiple phase frequent itemset operation. When directly invoked in an SQL statement, a frequent itemset operation may receive input from results of operations specified in the SQL statement, and provide its results directly to other operations specified in the SQL statement. By clustering itemset combinations, resources may be used more efficiently by retaining intermediate information as long as it is useful, and then discarding it to free up volatile memory. Dynamically selecting an occurrence counting technique allows a single frequent itemset operation to change the occurrence counting technique that it is using midstream, based on cost considerations and/or environmental conditions. | 09-15-2011 |
20110270844 | EFFICIENT AND SCALABLE DATA EVOLUTION WITH COLUMN ORIENTED DATABASES - A method, system and program product for data evolution on column oriented databases is disclosed. For an input evolution operation, reusable and non-reusable attributes are identified. For attributes in a target schema that cannot be reused from the source schema, data and bitmap indexes of those attributes are generated from source data and bitmap indexes. A decompose operation is disclosed for decomposing a table into two tables. A merge operation is disclosed in which only one input table can be reused for mergence. A second merge operation is disclosed in which both input tables cannot be reused for mergence. | 11-03-2011 |
20120143874 | Mechanism to Find First Two Values - An integrated circuit includes a search unit configured to access an input vector including a number of bits, and to find a first and a second instance of a predetermined bit value such as a logic zero or a logic one, for example. The search unit may be further configured to generate an output that includes an indication of a bit position of the first instance of the predetermined bit value within the input vector, and an indication of a bit position of the second instance of the predetermined bit value within the input vector. | 06-07-2012 |
20120173540 | Accelerating Database Queries Comprising Positional Text Conditions Plus Bitmap-Based Conditions - A system, method, and computer program product are provided for improving performance of positional text conditions in concert with bitmap-based conditions. This is accomplished, for example, by focusing positional text condition evaluation to candidate rows based on a bitmap resulting from application of a prior condition. Additionally, the result of a positional text condition may itself be provided in the form of a bitmap to accelerate further bitmap-based condition processing. | 07-05-2012 |
20120209855 | BIT-STRING KEY CLASSIFICATION/DISTRIBUTION APPARATUS, CLASSIFICATION/DISTRIBUTION METHOD, AND PROGRAM - When keys are to be classified into a plurality of blocks, to provide a classification method wherein the range of key values does not overlap and a method for distributing the classified keys by applying the art of a coupled-node tree. Keys are successively selected as classification keys from a key storage means holding the keys to be classified, and a classification tree, which is an application of a coupled-node tree, is generated by means of the classification keys, and the classification is done by making a correspondence between its leaf nodes and the keys to be classified into each of N blocks. The number of levels in the classification tree is constrained as a function of the block number N. A leaf node is extracted from the classification tree and the corresponding key is extracted as a classified key and distributed. | 08-16-2012 |
20120239664 | BIT STRING SEARCH APPARATUS, SEARCH METHOD, AND PROGRAM - To increase space efficiency of a coupled node tree, a branch node does not have an area that holds an array element number of an array element wherein is stored the primary node of the node pair that is the link target, and the root node is disposed in an array element with a node location number | 09-20-2012 |
20120254192 | METHOD AND SYSTEM FOR EXTENDED BITMAP INDEXING - A system and method for enhancing bitmap indexing representation of a dataset, which comprises a plurality of cases and features, each case characterized by one or more values of each feature. Currently, the bins vector for each case in the dataset, is a binary array, which is a bitmap indexing representation of each respective feature of the case. The system and method enhance the bitmap indexing by padding each bins vector. The padding is carried out by identifying all target bit locations with a ‘1’ value and replacing at least one ‘0’ bit adjacent to a target bit location with a non-zero numerical value, thereby creating a padded bitmap index. The padding factor may be based on any mathematical or statistical factor concerning population or subpopulation relevant to each of the features of the dataset. | 10-04-2012 |
20120303633 | SYSTEMS AND METHODS FOR QUERYING COLUMN ORIENTED DATABASES - Systems and methods for accessing data stored in a data array, mapping the data using a bitmap index, and processing data queries by determining positions of query attributes in the bitmap index and locating values corresponding to the positions in the data array are described herein. | 11-29-2012 |
20130132398 | Location Based Full Text Search - A method and system for a location based full text search is disclosed. The system generates interwoven bit vectors for documents that are stored in a database. The system may determine a location value based on a portion of a map that a user is viewing. The system may also receive at least one search term inputted by a user. Based on the location value and the search term, the system may generate one or more interwoven bit vectors, which may be used to query an index that identifies responsive documents stored in the database. | 05-23-2013 |
20130179451 | DYNAMICALLY SCALABLE MODES - The present disclosure includes techniques for storing indexed values that may increase computing performance. In one example, a method includes receiving a request to store an input value in a data structure. The method also includes determining the input value is not represented by an index value of the first group of index values, generating an index value that represents the input value, and determining the generated index value is not included in the first group of representations. The method also includes generating a second group of index values wherein a first size of index values of the first group is different than a second size of index values of the second group. The method also includes modifying a storage capacity of the data structure to store the index values of the second group of the second size and storing the second group of index values in the data structure. | 07-11-2013 |
20130246438 | REFLECTIVE LOGIC UNLOCKS KNOWLEDGE IN DATASETS - A method of providing an index structure in a database comprising a plurality of types of objects, each type of objects comprising at least one object. It comprises the steps setting one position of an identity index bit vector of each object in said database to one and all other positions to zero, said position being different for each object, and forming, for each object in said database, a relation index bit vector by combining all identity index bit vectors of objects that said each object is related to, wherein each bit vector has a length equal to the number of objects. | 09-19-2013 |
20140214854 | EXTRACTING METHOD, COMPUTER PRODUCT, EXTRACTING SYSTEM, INFORMATION GENERATING METHOD, AND INFORMATION CONTENTS - An extracting method includes storing to a storage device: files that include character units; first index information indicating which file includes at least one character unit in a character unit group having a usage frequency less than a predetermined frequency and among character units having common information in a predetermined portion, the usage frequency indicating the extent of files having a given character unit; second index information indicating which file includes a first character unit having a usage frequency at least equal to the predetermined frequency and among the character units having common information in a predetermined portion; and referring to the first and second index information to extract a file having character units in the first and second index information, when a request is received for extraction of a file having the first character unit and a second character unit that is included in the character unit group. | 07-31-2014 |
20150074117 | SEMANTIC DISCOVERY AND MAPPING BETWEEN DATA SOURCES - An apparatus and method are described for the discovery of semantics, relationships and mappings between data in different software applications, databases, files, reports, messages, or systems. In one aspect, semantics and relationships and mappings are identified between a first and a second data source. A binding condition is discovered between portions of data in the first and the second data source. The binding condition is used to discover correlations between portions of data in the first and the second data source. The binding condition and the correlations are used to discover a transformation function between portions of data in the first and the second data source. | 03-12-2015 |
20150088902 | Methods And Systems For Data Management And Analysis - Provided are methods comprising receiving a query for information from the database, determining particular data element types and data element values that are the subject of the query, instantiating a query data structure containing the data element types and the data element values that are the subject of the query, identifying records within the database that contain one or more data element types and/or data element values that are included in the query data structure, and instantiating a results data structure comprising information relating to the identified records. | 03-26-2015 |
20150356128 | INDEX KEY GENERATING DEVICE, INDEX KEY GENERATING METHOD, AND SEARCH METHOD - An index key generating device includes: a data acquiring unit which acquires a plurality of attribute values of a plurality of attributes for indexing; a definition acquiring unit which acquires index definition information indicating, for each of the attributes for indexing, an arrangement of bits of the attribute in an index key; and a bit processing unit which generates an index key by arranging, on a bit-by-bit basis, the plurality of attribute values acquired by the data acquiring unit, on the basis of the index definition information acquired by the definition acquiring unit. | 12-10-2015 |
20150363441 | GENERATING AND ACCESSING A DATA TABLE - A data sharing space (DSS) is generated for a base table having a set of rows with stored data. Requests are received to generate tables, each request including a query to the base table. A row from the set of rows is then accessed. The query is then applied to the row to generate results. An index value is then determined and a portion of the row is stored in the DSS based on the index value. | 12-17-2015 |
20150363442 | INDEX MERGE ORDERING - System, method, and computer program product to order query results, by processing a received query at least in part using a composite key index, wherein the composite key index comprises at least two key columns, wherein the at least two key columns comprise at least one pre-ordering column and an ordering column, wherein the query specifies ordering criteria to order a result set based on values of the ordering column, wherein the processing comprises receiving, from the composite key index, an ordering column value for each unique pre-ordering column value in the composite key index, identifying a first ordering column value as being ordered first according to the ordering criteria, and returning the first ordering column value as being responsive to the query. | 12-17-2015 |
20150363445 | GENERATING AND ACCESSING A DATA TABLE - An index shared between a plurality of tables is used to access a data sharing space (DSS) storing a set of rows from a base table having a plurality of rows with stored data. First data values of the index are identified in response to a query for a table. A subset of rows is then retrieved from the DSS using the index elements corresponding to the first data values. Second data values and some of the first data values are then identified in response to a second query for a table. A second subset of rows are then retrieved from the DSS using the index elements corresponding to the second data values and some of the first data values and the query is then applied to the subset of rows. | 12-17-2015 |
20150378999 | DETERMINING AFFILIATED COLORS FROM KEYWORD SEARCHES OF COLOR PALETTES - Systems and methods are described herein to determine data associated with affiliated color palettes identified from keyword searches of color palettes. Color palettes may be searched by name or other data associated with the color palettes. Affiliated color palettes may be determined based at least in part on an input color. Furthermore, affiliated colors can be determined based at least in part on votes and/or rankings. The items and/or images associated with affiliated color palettes may be identified. Various user interfaces may be based at least in part on the keyword searches of color palettes and/or determination of affiliated color palettes. | 12-31-2015 |
20150379000 | GENERATING VISUALIZATIONS FROM KEYWORD SEARCHES OF COLOR PALETTES - Systems and methods are described herein to generate visualizations associated with color palettes identified from keyword searches. Color palettes may include colors determined by human color preferences. Color palettes may be searched by name or other data associated with the color palettes based at least in part on text or audio data. Visualizations such as mood lighting and/or atmosphere colors may be based at least in part on the searched color palettes. | 12-31-2015 |
20150379002 | DETERMINING COLOR NAMES FROM KEYWORD SEARCHES OF COLOR PALETTES - Systems and methods are described herein to determine data, including color names, associated with color palettes identified from keyword searches. Color palettes may be searched by name or other data associated with the color palettes. Images and/or items may be retrieved based at least in part on the colors of the color palettes. Individual colors may be associated with color names based at least in part on human surveys and/or color names may be retrieved. Furthermore, the color names of individual colors may be retrieved based at least in part on a fast color search and/or associated with human votes. Various user interfaces may provide color palettes, images, and/or color names to users based at least in part on keyword searching of color palettes. | 12-31-2015 |
20160070730 | Data Encoding and Processing Columnar Data - The embodiments described herein relate to accessing a plurality of data elements. A page of column data is compressed and stored in a format that includes a collection of data elements. A tuple map is stored, and the collection of data elements is indexed via the tuple map. A query is processed based on the compressed page by identifying a set of tuple identifiers mapping to stored data in support of the query. Each tuple identifier corresponds to a location of a respective tuple of the compressed page. | 03-10-2016 |
20160092483 | SYSTEM AND METHOD FOR SUPPORTING A REFERENCE STORE IN A DISTRIBUTED COMPUTING ENVIRONMENT - A system and method support a reference store in a distributed computing environment such as a distributed data grid. The system associates a ticket with the reference store, wherein the reference store contains a plurality of references. Furthermore, the system uses the ticket to expose the reference store to one or more consumers in the distributed computing environment. The reference store type is selected in response to the number of references required to be stored and access overhead. Each reference store can be inflated or deflated according to the number of references it contains. Selection of different reference store types allows for reduced memory overhead while still providing acceptable reference retrieval times. The reduction in memory overhead enhances performance and capabilities of a distributed computing environment such as a distributed data grid. | 03-31-2016 |
20160147806 | VERSIONED BLOOM FILTER - Disclosed herein are system, method, and computer program product embodiments for bloom filter versioning. A request to add a new value to a first bitmap is received, wherein the first bitmap includes a bit sequence corresponding to a most recently added value. It is determined that the first bitmap has exceeded a threshold. A second bitmap is generated, the second bitmap including more bits than the first bitmap. The first bitmap is deleted based upon a determination that a number of readers accessing the first bitmap is zero. | 05-26-2016 |
20160147807 | Systems and methods of generating and using a bitmap index - Systems and methods of generating and using a bitmap index are disclosed. The bitmap index stores bit strings. In a particular implementation, each bit string in the bitmap index corresponds to an attribute of an audience. Each location in each bit string corresponds to the same audience member. The bitmap index supports parallelized and distributed execution of queries with respect to data indexed by the bitmap index. For example, the described bitmap index can be used to index advertising data, healthcare data, financial data, etc. | 05-26-2016 |
20160147886 | Querying Groups of Users Based on User Attributes for Social Analytics - A system determines a set of users satisfying a given criteria based on attribute values of the users. The system associates each value of an attribute with a representation of users having that attribute value. The representation of users may be an enumeration of users or a bit index. The system receives a request for determining a set of users satisfying a given criterion. The system identifies a logical operation based on the criterion and performs the logical operation to determine the set of users. The representation of the set of users may be distributed across a plurality of processors, allowing the system to perform the logical operation in parallel. The system may further determine statistical information describing a characteristic of the set of users, for example, page likes by the set of users. The statistical information may be presented to a business for analyzing their target audience. | 05-26-2016 |
20160171029 | UTILIZING METADATA TO REPRESENT DATA | 06-16-2016 |
20160203172 | HARDWARE FOR A BITMAP DATA STRUCTURE FOR EFFICIENT STORAGE OF HETEROGENEOUS LISTS | 07-14-2016 |
20160378803 | BIT VECTOR SEARCH INDEX - The technology described herein provides a bit vector search index for a search system. The bit vector search index comprises a data structure for indexing data about terms from a corpus of documents. The data structure includes a number of bit vectors. Each bit vector comprises an array of bits and corresponds to a different set of terms. Bits in the bit vector are used to represent whether at least one document corresponding to the bit includes at least one term from the set of terms corresponding to the bit vector. | 12-29-2016 |
20160378808 | UPDATING A BIT VECTOR SEARCH INDEX - The technology described herein provides for indexing information in a bit vector search index. The bit vector search index comprises a data structure for indexing data about terms from a corpus of documents. The data structure includes a number of bit vectors. Each bit vector comprises an array of bits and corresponds to a different set of terms. Bits in the bit vector are used to represent whether at least one document corresponding to the bit includes at least one term from the set of terms corresponding to the bit vector. The bit vector search index is stored by first indexing information about documents using bit vectors on a first accumulation buffer storage device. When a threshold is satisfied, the information is transferred to bit vectors on a subsequent storage device. | 12-29-2016 |