Class / Patent application number | Description | Number of patent applications / Date published |
707744000 | Sparse index | 23 |
20110082866 | METHOD AND APPARATUS FOR LOGICALLY EXPANDING THE LENGTH OF A SEARCH KEY - A lookup table provides a longest prefix match for a search key longer than a lookup table's mapper key. The lookup table performs a multi-level search in one or more mappers for the result value based on a portion of the search key provided as the mapper key. The lookup table is searched in multiple passes with successive portions of the search key until the result value is found. | 04-07-2011 |
20120124056 | DISAPPEARING INDEX FOR MORE EFFICIENT PROCESSING OF A DATABASE QUERY - A disappearing index allows faster processing of a database query without the startup time of a prior art sparse index. The disappearing index starts as a full index but is trimmed of index values that point to a row in the table that is not selected by the query. Thus the traditional index disappears as it becomes a sparse index tailored to the query. The query is able to execute faster using the now sparse index since the target database table is not accessed for duplicate values in the base table of the query. The query optimizer may determine to use a disappearing index based on estimates of the number of duplicate values in the base table. When the query is complete, the created disappearing table may be discarded or used for other queries that match the selection of the query that created the disappearing index. | 05-17-2012 |
20120254191 | METHOD AND SYSTEM FOR CONCEPT SUMARIZATION - A method and a system for summarizing a concept are provided. A query corresponding to a concept is received from a user. A plurality of images and corresponding descriptive information may be collected based on the query. The plurality of images and the descriptive information may be processed to form feature vectors and processed descriptive information respectively. Further, one or more topics may be identified for the plurality of images. Each of the plurality of images may be assigned with one or more topic distribution values corresponding to the one or more topics. The one or more topics correspond to the processed descriptive information. A sparse set of images may be determined based on the feature vectors and the assigned topic distribution values, to summarize the concept. Also, a target summary may be built from the summarized concept, by regularizing one or more distribution constraints. | 10-04-2012 |
20130041904 | COMPUTER INDEXES WITH MULTIPLE REPRESENTATIONS - The present application is directed to an indexing system. In one example, the indexing system includes one or more processors, one or more electronic memories that provide random access memory, one or more mass storage devices that provide persistent data storage, and one or more indexing routines, executed by the one or more processors, that create and manage an index data structure comprising nodes that include key-values/reference pairs, the index data structure additionally including a sibling reference for each index-data-structure node stored in the one or more electronic memories, the one or more indexing routines removing, from the index data structure, the sibling references for index-data-structure nodes when transferring the index-data-structure nodes from the one or more electronic memories to the one or more mass storage devices. | 02-14-2013 |
20130132397 | METHODS, APPARATUSES AND COMPUTER PROGRAM PRODUCTS FOR GENERATING INDEXES USING A JOURNAL IN A KEY VALUE MEMORY DEVICE - An apparatus for generating indexes of data may include a processor and memory storing executable computer code causing the apparatus to at least perform operations including obtaining an order number responsive to receipt of a request from a device to index an item(s) of data. The computer program code may further cause the apparatus to map the order number to a key value and link the key value to the data and provide one or more index entries to a memory device to enable storage of the index entries. The index entries may include information corresponding to the key value and the data. The computer program code may further cause the apparatus to assign a new index row(s) including the data for inclusion in a set of index rows of a designated partition(s) to obtain a built index(es) of the data. Corresponding methods and computer program products are also provided. | 05-23-2013 |
20130159316 | DISAPPEARING INDEX FOR MORE EFFICIENT PROCESSING OF A DATABASE QUERY - A disappearing index allows faster processing of a database query without the startup time of a prior art sparse index. The disappearing index starts as a full index but is trimmed of index values that point to a row in the table that is not selected by the query. Thus the traditional index disappears as it becomes a sparse index tailored to the query. The query is able to execute faster using the now sparse index since the target database table is not accessed for duplicate values in the base table of the query. The query optimizer may determine to use a disappearing index based on estimates of the number of duplicate values in the base table. When the query is complete, the created disappearing table may be discarded or used for other queries that match the selection of the query that created the disappearing index. | 06-20-2013 |
20140195544 | DEMOGRAPHIC AND MEDIA PREFERENCE PREDICTION USING MEDIA CONTENT DATA ANALYSIS - Methods, systems and computer program products are provided for predicting data. A name or title is obtained from a taste profile. There is an index into a data set based on the name or title, and a set of terms and corresponding term weights associated with the name or title are retrieved. A sparse vector is constructed based on the set of terms and term weights. The sparse vector is input to a training model including target data. The target data includes a subset of test data which has a correspondence to a predetermined target metric of data. A respective binary value and confidence level is output for each term, corresponding to an association between the term and the target metric. | 07-10-2014 |
20150095345 | INFORMATION PROCESSING DEVICE - The information processing system includes a data management unit that manages a group of records having a plurality of attribute values in a data structure including an index key-value pair and a record key-value pair associated with each other. The data management unit is configured to generate the index key-value pair including a value including a classification reference value indicating a criterion for classifying given attribute values included in the group of records, and a key associated with the value, and also generate the record key-value pair including a key associated with the classification reference value in the value of the index key-value pair, and a value including information of the records having the given attribute values corresponding to the classification reference value. | 04-02-2015 |
20150106382 | Tables With Unlimited Number Of Sparse Columns And Techniques For An Efficient Implementation - A method and apparatus queries a table in a database where the table includes at least one column declared to be sparse. A binary large object may be used to store the sparse column data. The object includes a column-id and column-value pair for each non-null value. To answer a query with a constraint on a sparse column, the object is searched for one or more column ids to obtain the column values. Rows whose column values match a constraint are returned. In another embodiment, an internal table is used. Each tuple in the internal table has a column id and a value array indexed by an ordinal row number. To answer a query with a constraint on a sparse column, the column value in the internal table is found and matched against the constraint. If the match is successful, the index of the column value in the internal table is returned. | 04-16-2015 |
20150347477 | Streaming File System - An indexing system and method for a filesystem, such as a database using the POSIX application programming interface, uses two fractal tree indices, a metadata index mapping the full pathname of files to file metadata, preferably data such as returned with a struct stat call, and a data index mapping pathname and block number to a datablock of a predetermined size, optionally a fixed size. The data index has keys ordered lexicographically, and the system and method allows for modifying existing keys, and creating new keys if there is no existing key, for writes smaller than the predetermined block size and for unaligned writes. The invention provides at least about an order of magnitude improvement in microdata operations (such as creating and scanning files smaller than a predetermined size, such as 512-byte files), and has write times comparable with existing file systems. | 12-03-2015 |
20150370840 | EFFICIENT STORAGE OF RELATED SPARSE DATA IN A SEARCH INDEX - Sparse data may be stored in a search index such that one or more data points related to a number of entities may be queriable. Upon detection of a data point related to an entity, an integer array may be created for the data point to store within a single column of the search index, the integer array including an identifier of the entity and a value associated with the data point. In response to receiving a request from a user to perform a query on the search index that includes the data point, the query may be transformed to a corresponding range based on the identifier of the entity. Upon execution of the query, the identifier may be removed and query results may be provided to the user as another array with a user-compatible identifier for the entity such that the results may be understood by the user. | 12-24-2015 |
20160026666 | COMPUTING SYSTEM - A computing system includes a database and a processing device. The database includes a data part which stores data and an index part which stores an incomplete index of the data. The processing device receives a query from a client, processes a query by using the incomplete index, and transmits a response to the query to the client. | 01-28-2016 |
20160042043 | PROVIDING MESSAGES FOR A JAVA MESSAGE SERVICE - Providing messages for Java message service (JMS) is disclosed. A described method includes determining timestamp information associated with a first Java™ message service (JMS) message. The timestamp information represents a time when the JMS message is either generated or received by a processing device. The method also includes determining destination information associated with the JMS message. The method further includes converting the JMS message into a first key-value data pair having a key data and a value data. The key data includes the timestamp information and the value data includes the destination information of the first JMS message. | 02-11-2016 |
20160055185 | MULTI-USER SEARCH SYSTEM WITH METHODOLOGY FOR PERSONALIZED SEARCH QUERY AUTOCOMPLETE - A multi-user search system with methodology for personalized search query autocomplete. In one embodiment, for example, a method for personalized search query autocomplete includes receiving, from an end-user computing device of an authenticated user, a completion search query including a completion token; determining an identifier of an authorized document namespace the authenticated user is permitted to access; generating an index key including the authorized document namespace identifier as a prefix and the completion token as a suffix; accessing an index dictionary with the index key to identify and iterate over a plurality of prefixed index tokens until a stop condition is reached, each of the plurality of prefixed index tokens including the authorized document namespace identifier as a prefix and the each index token as a suffix, the completion token being a prefix of or matching the each index token; and for each prefixed index token of the plurality of prefixed index tokens, determining whether any documents identified in a postings list associated with the each prefixed index token satisfies the completion query, and returning filenames of any such documents satisfying the completion query in an answer to the completion query. | 02-25-2016 |
20160055191 | EXECUTING CONSTANT TIME RELATIONAL QUERIES AGAINST STRUCTURED AND SEMI-STRUCTURED DATA - Techniques are described herein for performing database operations against location and access transparent metadata units called fat pointers organized into globally distributed data structures. The fat pointers are created by extracting values corresponding to a particular key and paring each value with a reference to the local location and server that has the native format record containing the value. The fat pointers may be transferred to any server in the cluster, even if the server is different from the server that has the native format record. In general, most operations are performed against fat pointers rather than the native format records. This allows the cluster to perform work against arbitrary types of data efficiently and in a constant amount of time despite the variable sizes and structures of records. | 02-25-2016 |
20160103862 | IDENTIFYING EVENTS USING INFORMATIONAL FIELDS - A computer system determines if events in a machine data store satisfy event selection criteria. The events may pertain to a service entity represented by a stored entity definition. The entity definition may include information to identify the events from the machine data. Other informational fields in the entity definition may be effectively attributed to the identified events and take part in satisfying the event selection criteria. | 04-14-2016 |
20160162525 | Storing a Key Value to a Deleted Row Based On Key Range Density - In an embodiment, a first key value is received. A plurality of candidate rows are found in a database table, wherein the plurality of candidate rows are deleted. For the plurality of candidate rows, a plurality of respective impacts on a plurality of respective densities of each of other key values that are stored within a first key range of the first key value are calculated. For the plurality of candidate rows, a plurality of function results of the plurality of respective impacts on the plurality of respective densities are calculated. A selected candidate row of the plurality of candidate rows with a smallest function result of the plurality of function results of the plurality of respective impacts on the plurality of respective densities is selected. The first key value is stored to the selected candidate row. | 06-09-2016 |
20160179855 | UBIQUITOUS CONTENT ACCESS AND MANAGEMENT | 06-23-2016 |
20160179856 | DATA STORAGE METHOD AND APPARATUS | 06-23-2016 |
20160188591 | METHODS AND SYSTEMS FOR KEY-VALUE-TUPLE-ENCODED STORAGE - The present disclosure provides systems and methods for Key-Value-Tuple-encoded (KVT-encoded) object storage. In accordance with an embodiment of the invention, chunks of objects, storing payload data or metadata, are persistently stored by servers using KVT-encoded storage. Furthermore, the KVT encoding may be applied to advantageously re-structure content within a distributed object storage cluster, especially for object storage systems that allow payload references to be cached extensively. For such systems, it is of considerable value to honor (use as valid) existing chunk references after the underlying content has been re-structured. Further, the KVT encoding taught herein is completely compatible with a fully-distributed object storage cluster. One embodiment relates to a storage server that includes a persistent storage module that provides a key-value application programming interface that encodes multiple key-value-tuple (KVT) entries for one chunk. Other embodiments, aspects and features are also disclosed. | 06-30-2016 |
20160196291 | Alleviation of Index Hot Spots in Datasharing Environment with Remote Update and Provisional Keys | 07-07-2016 |
20160253433 | STORING ENTRIES AS ORDERED LINKED LISTS | 09-01-2016 |
20180025092 | MODULAR MEMOIZATION, TRACKING AND TRAIN-DATA MANAGEMENT OF FEATURE EXTRACTION | 01-25-2018 |