Patents by Inventor Jerzy Jozef Lewak
Jerzy Jozef Lewak has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20170109403Abstract: 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.Type: ApplicationFiled: May 19, 2016Publication date: April 20, 2017Inventors: Jerzy Jozef Lewak, Krzysztof Lukasz Mazur
-
Publication number: 20170075933Abstract: Aggregations of data items which are components of a data set may be performed in a single iteration pass through selector components of an item vector. The item vectors may have an item vector structure whose components comprise numerical identifiers of selectors associated with one or more items. The selectors may be data values which are components of the data set.Type: ApplicationFiled: July 22, 2016Publication date: March 16, 2017Inventor: Jerzy Jozef Lewak
-
Patent number: 9355139Abstract: 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.Type: GrantFiled: September 22, 2011Date of Patent: May 31, 2016Assignee: SpeedTrack, Inc.Inventors: Jerzy Jozef Lewak, Krzysztof Lukasz Mazur
-
Publication number: 20160055348Abstract: Methods and systems of providing remote coded data storage, data analysis, and search and retrieval may include assignment of codes to data components of a vocabulary. Some embodiments utilize a double key.Type: ApplicationFiled: July 27, 2015Publication date: February 25, 2016Inventor: Jerzy Jozef Lewak
-
Publication number: 20150199409Abstract: 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.Type: ApplicationFiled: January 16, 2015Publication date: July 16, 2015Inventor: Jerzy Józef Lewak
-
Patent number: 8938453Abstract: 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.Type: GrantFiled: July 19, 2011Date of Patent: January 20, 2015Assignee: SpeedTrack, Inc.Inventor: Jerzy Jozef Lewak
-
Publication number: 20130091162Abstract: A method and system using metadata about a data collection, useful for access and searching. The metadata to comprise associations of DetailSelectors to data items describing the data Items. DetailSelector membership in groups provides context for member DetailSelectors. Boolean queries comprising such DetailSelectors and association links to GlueSelectors at one or more levels and eventually to Items, match a predetermined collection of data in the target collection. Such metadata may be used to present choices to a user for terms to add to a query while ensuring a suitable match to the query. Information about Groups of DetailSelectors and Groups of GlueSelectors, as well as information about content of a GlueSelector, may be presented to a user to provide context to the selected DetailSelectors describing the target items.Type: ApplicationFiled: December 15, 2011Publication date: April 11, 2013Inventor: Jerzy Jozef Lewak
-
Publication number: 20130041922Abstract: 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.Type: ApplicationFiled: July 19, 2011Publication date: February 14, 2013Applicant: SpeedTrack, Inc.Inventor: Jerzy Jozef Lewak
-
Publication number: 20120296930Abstract: 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.Type: ApplicationFiled: September 22, 2011Publication date: November 22, 2012Applicant: SpeedTrack, Inc.Inventors: Jerzy Jozef Lewak, Krzysztof Lukasz Mazur
-
Patent number: 8122023Abstract: A method and system to derive association-explicit metadata, about a target data collection, that is useful to facilitate access and searching of the data collection, regardless of the organizational structure of the collection. The metadata may be generated to comprise DetailSelectors describing lowest level data elements; groups thereof that provide context for member DetailSelectors, plus Boolean properties for queries using such Selectors, and association links to higher-level GlueSelectors that comprise such DetailSelectors, as well as association links to yet higher levels, eventually to Items, which are of a level greater than the highest level GlueSelector, reference a predetermined collection of data in the target collection, and comprise suitable matches for all of the DetailSelectors represented. Such metadata may be used to present choices to a user for terms to add to a query while ensuring suitable match by information in at least one Item.Type: GrantFiled: January 25, 2007Date of Patent: February 21, 2012Assignee: Speedtrack, Inc.Inventors: Jerzy Jozef Lewak, Miles Kevin Yano, Tim Pevzner
-
Publication number: 20100241649Abstract: A method and system to derive association-explicit metadata, about a target data collection, that is useful to facilitate access and searching of the data collection, regardless of the organizational structure of the collection. The metadata may be generated to comprise DetailSelectors describing lowest level data elements; groups thereof that provide context for member DetailSelectors, plus Boolean properties for queries using such Selectors, and association links to higher-level GlueSelectors that comprise such DetailSelectors, as well as association links to yet higher levels, eventually to Items, which are of a level greater than the highest level GlueSelector, reference a predetermined collection of data in the target collection, and comprise suitable matches for all of the DetailSelectors represented. Such metadata may be used to present choices to a user for terms to add to a query while ensuring suitable match by information in at least one Item.Type: ApplicationFiled: January 25, 2007Publication date: September 23, 2010Inventors: Jerzy Jozef Lewak, Kevin Yano Miles, Tim Pevzner