SpeedTrack, Inc. Patent applications |
Patent application number | Title | Published |
20150012563 | DATA MINING USING ASSOCIATIVE MATRICES - A method of mining frequent items in data is described. Categorical associations between elements of data are the core of information contained in the data and are all that is needed to perform data mining. These associations are extracted from data and held in optimized associative matrices whose structure is independent of the nature and structure of the data. All data mining operations and discoveries can be performed using only these associative matrices which provides many advantages over present methods. It allows real-time interactive navigation through the information in the data, enables efficient automatic and user guided determination of the most highly correlated data components, and a winnowing navigation through a large number of automatically determined associations, as for example frequent item sets, amongst which the needle-in-the-haystack may be more easily found. | 01-08-2015 |
20140310461 | OPTIMIZED AND PARALLEL PROCESSING METHODS WITH APPLICATION TO QUERY EVALUATION - Methods of computing the results of logical operations on large sets are described which coax a processor to utilize efficiently processor caches and thereby reduce the latency of the results. The methods are particularly useful in parallel processing systems. Such computations can improve the evaluation of queries, particularly queries in faceted navigation and TIE systems. | 10-16-2014 |
20140310289 | DATA ANALYTICS WITH NAVIGATION (DAWN) USING ASSOCIATIONS BETWEEN SELECTORS (TERMS) AND DATA ITEMS - Systems and methods are described which use associations between field values, more generally terms, called selectors, and data items, or structures within data items. The associative information is derived from the content of data and can be stored in optimal data structures, generally descriptively named associative matrices, which may be used to perform searches and calculations of data analytics. In some embodiments, calculations use only selector values and their counts, called frequencies, of associated data items, and/or structures within those items. Special queries, executed on the associative information, determine the frequencies. Methods of data analysis use the results of these queries. Applications can display results dynamically as a user creates queries by choosing selectors, changing the queries, and creating new ones, completely intuitively, using point and click. By comparing the results of multiple queries, such an application enables users to dynamically and quantitatively explore associations between facet values. | 10-16-2014 |
20130086098 | IDENTIFIER VOCABULARY DATA ACCESS METHOD AND SYSTEM - A method of organizing, managing, and providing interactive access to data in a database is disclosed, along with a program and a system for implementing the method. Associations between each data Item and at least one ItemSelector are established and stored. A predefined (but modifiable) Vocabulary of ItemSelectors sufficient to describe each Item of the database is created. Presently selected Items are described by a combination of associations defined by an appropriate Boolean combination of each ItemSelector in a presently selected set of ItemSelectors. A user controls the presently selected set by adding an ItemSelector from a presented group, or by removing a previously selected ItemSelector. The system ideally makes available to the user all relevant ItemSelectors—those which, if added to the presently selected set, would result in a set that describes at least one extant data Item. The system ideally makes all presently selected Items available to the user. | 04-04-2013 |
20130041922 | ITEM COUNTING IN GUIDED INFORMATION ACCESS SYSTEMS - Methods of counting the number of matching items (more generally finding objects) indirectly associated with each detail selector (more generally another object) available for selection in a database search system or generally useful in other applications are disclosed. In some embodiment the method uses a set of matching items and traverses to each indirectly associated detail selector via a traversal through each associated entity, and a traversal through each detail selector associated with that entity. The method is easily extendable to the case of multiple entity levels. In some embodiments the method first creates an association matrix directly associating items to selectors and allowing item determination or counting more simply. | 02-14-2013 |
20120296930 | PRE-CACHING - This disclosure addresses the need for pre-caching of database query results which in general is the caching of the results of query evaluation before they are needed. In certain embodiments of query evaluation, the computing time required to evaluate a query is dominated by the reverse query, the evaluation of which determines the available remaining selectors and the number of items associated with each. The time to compute this reverse query is on average approximately proportional to the number of matching items. This result is used as a very convenient method of determining, before evaluation, which conjunctive queries will take the most time to evaluate—the long queries. These long queries can then be pre-cached, making them available for faster responses when they are needed. Methods of using cached conjunctive query results to more quickly evaluate certain queries comprising the disjunctive Boolean operators are also described. | 11-22-2012 |