| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 707753000 | Sorting indices | 27 |
| 20100094881 | SYSTEM AND METHOD FOR INDEXING SUB-SPACES - The present invention is directed to systems and methods for identifying compatible advertisement contracts to satisfy an advertisement opportunity. The systems and methods include receiving a number of attribute values associated with a user accessing a network-based location. The systems and methods include sorting an index of lists for a plurality of advertisement contracts on the basis of a number of contract term values. The systems and methods include traversing the index of lists to return a set advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include selecting a given advertisement contract from the set of advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include presenting an advertisement associated with the given advertisement contract on a display viewable by the user accessing the network-based location. | 04-15-2010 |
| 20100185629 | INDEXING AND QUERYING DATA STORES USING CONCATENATED TERMS - Tools and techniques for indexing and querying data stores using concatenated terms are provided. These tools may receive input queries that include at least two query terms. The query terms are correlated respectively with fields contained within records within a data store, with these fields being populated with respective field values. The query terms are arranged according to an indexing priority according to which the fields are ranked within an indexing table, which is associated with the data store. The tools then concatenate the query terms as arranged according to the indexing priority. In turn, the tools search the index table for any entries that are responsive to the concatenated query terms | 07-22-2010 |
| 20100191750 | Multiple-column bidirectional index - The present invention is a multiple-column index comprised of at least three columns. The columns are repetitious loops of identical content displayed over several pages wherein the relationship between the columns would be consistent. At least two columns have listings in the order of “A” to “Z” beginning at different points of the alphabet. At least one column has listings in “Z” to “A” order. If a search-result is organized on numerous pages, the invention would maximize the potential for discoverability for businesses listed beyond the first page. | 07-29-2010 |
| 20100223269 | SYSTEM AND METHOD FOR AN EFFICIENT QUERY SORT OF A DATA STREAM WITH DUPLICATE KEY VALUES - An apparatus and method for efficiently performing a query sort on a data set with duplicate key values is disclosed. The method includes identifying unique key values for a key in a data set after determining that a number of duplicate key values for the key exceed a predefined threshold. The method also includes recording an association of each unique key value with a record in the data set and sorting unique key values. The method further includes storing the unique key values in a sorted order, wherein each unique key value is associated with an appropriate record in the data set. | 09-02-2010 |
| 20100250560 | Bit string merge sort device, method, and program - To realize a high speed merge sort method by applying a coupled node tree, which method extracts a smallest or largest key from a plurality of sorted key storage areas in each of which is stored keys comprised of bit strings that are sorted, and generates a coupled node tree for merge while adding a processing source identifier that identifies the sorted storage area wherefrom the key has been extracted, and repeats the actions of writing out into the merged key storage area a key being obtained by a minimum or maximum value search on the coupled node tree and deleting the key, and inserting into the coupled node tree a key by extracting the key from one of the plurality of sorted key storage areas. | 09-30-2010 |
| 20100325117 | Robust Signatures Derived from Local Nonlinear Filters - Content signal recognition is based on a multi-axis filtering of the content signal. The signatures are calculated, formed into data structures and organized in a database for quick searching and matching operations used in content recognition. For content recognition, signals are sampled and transformed into signatures using the multi axis filter. The database is searched to recognize the signals as part of a content item in the database. Using the content identification, content metadata is retrieved and provided for a variety of applications. In one application, the metadata is provided in response to a content identification request. | 12-23-2010 |
| 20110196882 | Operating On Objects Stored In A Distributed Database - A system and method for operating on objects stored in a distributed database is provided. Rows of a distributed database that correspond to an index are identified. The identified rows are sorted lexicographically based on row names of the identified rows. The sorted rows are ordered by priorities of objects corresponding to the sorted rows. The objects corresponding to the sorted rows are operated on in priority order. In some embodiments, the objects are replication requests for replicating data in a distributed storage system, and operating on the objects corresponding to the sorted rows in priority order includes executing the replication requests in priority order to replicate data in the distributed storage system. | 08-11-2011 |
| 20110258205 | Bit string data sorting apparatus, sorting method, and program - The sort processing of keys to be sorted, which keys are expressed as bit strings involves a classification processing. In the classification processing, a bit string comparison between a reference key and a key which is an object of the classification is performed, and a difference bit position is obtained that is the bit position of the first bit that differs in the bit string comparison and the keys to be sorted are classified by the difference bit position into key groups with the same difference bit position. | 10-20-2011 |
| 20120259871 | Illustrating Cross Channel Conversion Paths - Methods, systems, and apparatuses, including computer programs encoded on computer readable media, for generating Venn-like diagram illustrating cross channel conversion paths. In one aspect, a plurality of conversion paths are received. Each conversion path includes one or more user interactions that include a plurality of dimensional data. A sorted list of channel groups that includes one or more group rules is received and each user interaction is grouped into a channel based upon the channel groups. A selection of channels to visualize is received and an image including one circle for each selected channel is generated. The circles are optimally placed to maximize the accuracy of the overlapped regions with channel group data. | 10-11-2012 |
| 20140108434 | INDEX CONFIGURATION FOR SEARCHABLE DATA IN NETWORK - An entity using a computing device can upload searchable data to a network service to be indexed and stored. The data can include a plurality of data fields, each data field having one or more associated values. The network service can analyze the data fields and their respectively associated values to determine data field types for the data fields and search options to be enabled for the data fields. Based at least in part on the data field types and the search options, the network service can generate a search index configuration/schema. Based at least in part on the generated search index configuration/schema, the network service can generate a search index for the data. In some embodiments, the network service can also convert the data into a format compatible with the search index. | 04-17-2014 |
| 20140181126 | System and Method for Scheduling and Arbitrating Events in Computing and Networking - A method for high-speed scheduling and arbitration of events for computing and networking is disclosed. The method includes the software and hardware implementation of a unique data structure, known as a pile, for scheduling and arbitration of events. According to the method, events are stored in loosely sorted order in piles, with the next event to be processed residing in the root node of the pile. The pipelining of the insertion and removal of events from the piles allows for simultaneous event removal and next event calculation. The method's inherent parallelisms thus allow for the automatic rescheduling of removed events for re-execution at a future time, also known as event swapping. The method executes in O(1) time. | 06-26-2014 |
| 20140222839 | SORTING MULTIPLE RECORDS OF DATA USING RANGES OF KEY VALUES - A method and system for sorting data of an input file containing multiple records associated with multiple tables of a database. The multiple records include key values. The key values are segmented into ranges of key values for each table. Each range of key values for each table is a segment having a segment value. Multiple key values are selected for the multiple records. A block number, which contains a unique permutation of the segment values of the segments, is generated. The segment values denote the ranges of key values encompassing the multiple key values in each record. A sort key value for each record is ascertained, based on the generated block number for each record, and added to each record. The multiple records are sorted according to the sort key values in the multiple records. The sorted multiple records are stored in an output file. | 08-07-2014 |
| 20150046478 | HARDWARE IMPLEMENTATION OF A TOURNAMENT TREE SORT ALGORITHM - Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator. The method includes receiving a plurality of key values by the hardware accelerator, storing each the plurality of keys into a location on a memory of the hardware accelerator, and creating a pointer to each of the locations of the plurality of keys. The method also includes storing the pointer to each of the plurality of keys into a first array stored by the hardware accelerator, sorting the plurality of keys by ordering the pointers in the first array and by using a second array for storing the pointers, wherein the sorting identifies a winning key from the plurality of keys in the memory, and outputting the winning key. | 02-12-2015 |
| 20150293957 | RADIX SORT ACCELERATION USING CUSTOM ASIC - An information processing system, computer readable storage medium, and method for accelerated radix sort processing of data elements in an array in memory. The information processing system stores an array of data elements in a buffer memory in an application specific integrated circuit radix sort accelerator. The array has a head end and a tail end. The system radix sort processing, with a head processor, data elements starting at the head end of the array and progressively advancing radix sort processing data elements toward the tail end of the array. The system radix sort processing, with a tail processor, data elements starting at the tail end of the array and progressively advancing radix sort processing data elements toward the head end of the array, the tail processor radix sort processing data elements in the array contemporaneously with the head processor radix sort processing data elements in the array. | 10-15-2015 |
| 20150293964 | APPLICATIONS OF AUTOMATED DISCOVERY OF TEMPLATE PATTERNS BASED ON RECEIVED REQUESTS - Techniques for leveraging frequent patterns identified in a captured workload are provided. In one approach, multiple frequent patterns detected in a captured workload may be ordered by frequency to determine, for example, which patterns should be targeted for optimization. In another approach, a model of a captured workload is created, where the model comprises nodes that represent templates (which in turn correspond to requests) and edges that represent transitions between templates. The model is used to create an artificial workload, such as a workload that is twice as large as the originally-captured workload. The model may also be edited before creating the artificial workload. In another approach, workload models are compared to identify errors, regressions, or security issues. In another approach, an artificial workload is created for an application that is not yet deployed and then executed to determine whether the artificial workload or the originally-captured workload executed faster. | 10-15-2015 |
| 20150302038 | PARALLELIZED IN-PLACE RADIX SORTING - Methods for sorting a data set. A data storage is divided into a plurality of buckets that is each associated with a respective key value. A plurality of stripes is identified in each bucket. At least one data stripe set is defined that has one stripe within each respective bucket. An in-place partial bucket radix sort is performed on data items contained within one data stripe set with a first processor using an initial radix. Incorrectly sorted data items are then grouped in each bucket into a respective incorrect data item group within each bucket. A radix sort is then performed using the initial radix on the items within the respective incorrect data item group. A first level sorted output is produced. | 10-22-2015 |
| 20150347087 | REORDERING OF DATABASE RECORDS FOR IMPROVED COMPRESSION - According to embodiments of the present invention, apparatus, systems, methods and computer program products for sorting and compressing an unordered set of data records from a structured database are provided. Fields of the unordered set of data records are prioritized based on an impact of those fields to a compression scheme for column-oriented compression. The unordered set of data records are sorted based on the prioritized field(s) with a greatest impact on the performance metric. Data of the sorted data records are compressed according to a compression scheme. In some embodiments, prioritizing the fields may be based on an anticipated level of usage of data within those fields and/or a cost function associated with a performance metric as well as optimization of compression. A performance metric may include a faster computational time, reduced I/O computation, faster scan time, etc. | 12-03-2015 |
| 20150347088 | PREFIX BURROWS-WHEELER TRANSFORMATIONS FOR CREATING AND SEARCHING A MERGED LEXEME SET - Systems and methods to create a merged lexeme set from a first lexeme set and a second lexeme set such that an existential lexeme search may be performed on both data originally from the first lexeme set and data originally from the second lexeme set via the merged lexeme set, and wherein information in the merged lexeme set includes information as to which lexeme set a lexeme originated. Specifically Prefix Burrows-Wheeler Transform (“PBWT”) systems and techniques are applied to the scenario where a plurality lexeme sets are merged to a single merged lexeme set. Additionally, applications of PBWT systems and techniques as applied to genome sequence data and k-Mer searches are disclosed. | 12-03-2015 |
| 20150363167 | FLASH OPTIMIZED COLUMNAR DATA LAYOUT AND DATA ACCESS ALGORITHMS FOR BIG DATA QUERY ENGINES - A technique relates to flash-optimized data layout of a dataset for queries. Selection columns are stored in flash memory according to a selection optimized layout, where the selection optimized layout is configured to optimize predicate matching and data skipping. The selection optimized layout, for each selection column, is formed by storing a selection column dictionary filled with unique data values in a given selection column, where the unique data values are stored in sorted order in the selection column dictionary. Row position designations are stored corresponding to each row position that the unique data values are present within the given selection column, without duplicating storage of any of the unique data values that occur more than once in the given selection column. | 12-17-2015 |
| 20150378675 | SORTING MULTIPLE RECORDS OF DATA USING RANGES OF KEY VALUES - A method and system for sorting data of an input file containing multiple records associated with multiple tables of a database. The multiple records include key values. The key values are segmented into ranges of key values for each table. Each range of key values for each table is a segment having a segment value. Multiple key values are selected for the multiple records. A block number, which contains a unique permutation of the segment values of the segments, is generated. The segment values denote the ranges of key values encompassing the multiple key values in each record. A sort key value for each record is ascertained, based on the generated block number for each record, and added to each record. The multiple records are sorted according to the sort key values in the multiple records. The sorted multiple records are stored in an output file. | 12-31-2015 |
| 20160004503 | SORTING MULTIPLE RECORDS OF DATA USING RANGES OF KEY VALUES - A method and system for sorting data of an input file containing multiple records associated with multiple tables of a database. The multiple records include key values. The key values are segmented into ranges of key values for each table. Each range of key values for each table is a segment having a segment value. Multiple key values are selected for the multiple records. A block number, which contains a unique permutation of the segment values of the segments, is generated. The segment values denote the ranges of key values encompassing the multiple key values in each record. A sort key value for each record is ascertained, based on the generated block number for each record, and added to each record. The multiple records are sorted according to the sort key values in the multiple records. The sorted multiple records are stored in an output file. | 01-07-2016 |
| 20160125008 | PRIORITY QUEUE HAVING ARRAY AND TREES - A replace operation is performed in relation to a priority queue. The priority queue has trees and elements. A first element stores a value having a greatest priority of any value stored in any element and in any tree. Each tree corresponds to one of the elements. | 05-05-2016 |
| 20160132544 | EFFICIENT SORTING IN A RELATIONAL DATABASE - The present invention relates to a method, computer program product and system to compute one sorted list of enumeration values in a specific language, read from at least one relational database including at least one data table storing enumeration programming variable values and at least one catalog table storing an expression, in at least one language, of the enumeration programming variable values, said method comprising the steps of receiving a request for providing enumeration variable values including one list sorted in a specific order, of the values of a specific enumeration, in a specific language; then, all the expressions of the enumeration values for the specific language for the specific enumeration read in a corresponding catalog table are sorted in the specific order; if the sorted list of the specific enumeration expression values matches a list of the specific enumeration variable values sorted in the specific order in the same catalog table, the sorted list of enumeration values in a specific language is created from this ordered catalog table; if in the preceding step the match was not found, if the sorted list of the specific enumeration expressions values matches a list of the specific enumeration variable values sorted in the reverse order from the specific order in the same catalog table, the sorted list of enumeration values in a specific language is created from the sorted catalog table; if in any of the two preceding steps, the match was not found, a new table joined table is built from data and catalog table in the standard way. | 05-12-2016 |
| 20160171030 | SORTING AN ARRAY CONSISTING OF A LARGE NUMBER OF ELEMENTS | 06-16-2016 |
| 20160188294 | HARDWARE IMPLEMENTATION OF A TOURNAMENT TREE SORT ALGORITHM USING AN EXTERNAL MEMORY - Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator having an external memory. The method includes receiving a plurality of key values by the hardware accelerator, assigning each of the plurality of key values a sequential key number as the plurality of key values are received and performing pairwise comparisons of each of the plurality of key values to identify a winning key and a losing key. The method also includes storing the losing key of each pairwise comparison in a first section of the external memory, wherein a location in the first section is based on the key number of the losing key and storing the winning key of each pairwise comparison in a second section of the external memory, wherein a location in the second section is based on the key number of the winning key. | 06-30-2016 |
| 20160188644 | HARDWARE IMPLEMENTATION OF A TOURNAMENT TREE SORT ALGORITHM USING AN EXTERNAL MEMORY - Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator having an external memory. The method includes receiving a plurality of key values by the hardware accelerator, assigning each of the plurality of key values a sequential key number as the plurality of key values are received and performing pairwise comparisons of each of the plurality of key values to identify a winning key and a losing key. The method also includes storing the losing key of each pairwise comparison in a first section of the external memory, wherein a location in the first section is based on the key number of the losing key and storing the winning key of each pairwise comparison in a second section of the external memory, wherein a location in the second section is based on the key number of the winning key. | 06-30-2016 |
| 20190146966 | Applications Of Automated Discovery Of Template Patterns Based On Received Requests | 05-16-2019 |
