Nigel R. Ellis - Redmond WA Rodger N. Kline - Woodinville WA
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 1730
US Classification:
707 2, 707 5
Abstract:
A system for automatic statistics creation comprises a query optimizer which automatically generates statistics derived from data in a database and selects an executable procedure from a plurality of procedures that operate on data in a database using the automatically generated statistics. A counter is maintained of updates made to each statistic that has been automatically generated. If the counter breaches a threshold, the automatically generated statistic is removed from the database.
System And Method For Using A Compressed Trie To Estimate Like Predicates
Srikanth R. Avadhanam - Redmond WA Nigel R. Ellis - Redmond WA Campbell Bryce Fraser - Bellevue WA Rodger N. Kline - Woodinville WA
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 1730
US Classification:
707 4, 707 3, 707103 R
Abstract:
A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-strings starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.
Nigel R. Ellis - Redmond WA, US Rodger N. Kline - Woodinville WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 1730
US Classification:
707102
Abstract:
A system for automatic statistics creation comprises a query optimizer which automatically generates statistics derived from data in a database and selects an executable procedure from a plurality of procedures that operate on data in a database using the automatically generated statistics. A counter is maintained of updates made to each statistic that has been automatically generated. If the counter breaches a threshold, the automatically generated statistic is removed from the database.
Nigel R. Ellis - Redmond WA, US Rodger N. Kline - Woodinville WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707100
Abstract:
A system for automatic statistics creation comprises a query optimizer which automatically generates statistics derived from data in a database and selects an executable procedure from a plurality of procedures that operate on data in a database using the automatically generated statistics. A counter is maintained of updates made to each statistic that has been automatically generated. If the counter breaches a threshold, the automatically generated statistic is removed from the database.
System And Method For Using A Compressed Trie To Estimate Like Predicates
Srikanth R. Avadhanam - Redmond WA, US Nigel R. Ellis - Redmond WA, US Campbell Bryce Fraser - Bellevue WA, US Rodger N. Kline - Woodinville WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707102, 707103 R
Abstract:
A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.
System And Method For Identifying And Storing Changes Made To A Table
Ganapathy Krishnamoorthy - Issaquah WA, US Wei Xiao - Redmond WA, US Nigel R. Ellis - Redmond WA, US Rodger N. Kline - Woodinville WA, US Sameet H. Agarwal - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/30
US Classification:
707100, 707101, 707102, 707103, 7071041
Abstract:
A base table is scanned with a delete marker and an insert marker. The delete marker identifies a last change committed to the base table as part of a transaction prior to execution of a statement, and the insert marker identifies a last change committed to base table as part of the transaction during execution of the statement. The results of the delete marker scan are filtered with deletions stored in a delta table, and a delete table is populated with the filtered rows. The results of the insert scan are filtered with insertions stored in the delta table, and an insert table is populated with the filtered rows.
Defining And Extracting A Flat List Of Search Properties From A Rich Structured Type
Sambavi Muthukrishnan - Woodinville WA, US Srinivasmurthy P. Acharya - Sammamish WA, US Mahadevan Venkatraman - Redmond WA, US Anurag Gupta - Bellevue WA, US Michael W. Thomas - Redmond WA, US Joseph Trdinich - Redmond WA, US Balan Sethu Raman - Redmond WA, US Sameet H. Argawal - Redmond WA, US Sanjay Anand - Redmond WA, US Salome Jacob - Sammamish WA, US Roopali Kaujalgi - Bellevue WA, US Amit Shukla - Sammamish WA, US Maxim Mazeev - Redmond WA, US Rodger Nickels Kline - Bellevue WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707101, 707200
Abstract:
Rich structured data for items in a file system that allows different kinds of data to be identified by metadata is mapped into a set of search properties for a desktop search service, which is a flat list. This is applicable to any rich structured data that should be mapped into search properties for a desktop search service. Included is an installation mechanism to install these mappings and an execution infrastructure for utilizing the generated SQL from the mappings to extract search properties from items.
System And Method For Using A Compressed Trie To Estimate Like Predicates
Srikanth R. Avadhanam - Redmond WA, US Nigel R. Ellis - Redmond WA, US Campbell Bryce Fraser - Bellevue WA, US Rodger N. Kline - Woodinville WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707102, 707 10
Abstract:
A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.
Rodger Kline 1961 graduate of Sylvan Hills High School in Sherwood, AR is on Classmates.com. See pictures, plan your class reunion and get caught up with Rodger and other high ...
Roger Kline (1955-1959), Chris Stuart (1988-1992), M Blanchard (2000-2004), Sandchel Arnold (2001-2005), Brett Wright (1981-1983), Millie Hansen (1966-1970)