US5664173A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for generating database queries from a meta-query pattern
Assignee: Microsoft Technology Licensing LLC
•
Filing: 1995-11-27
•
Granted: 1997-09-02
•
Expires: 2015-11-27
Abstract
Abstract A grammar, parsing method, and associated apparatus for automatically generating test commands to test an SQL database engine interface while reducing storage requirements and improving access time for such test commands as compared with prior test tools. The test tools and methods include a grammar for concise syntactic representation of a meta-query (also referred to as meta-language statement, query pattern, or query template). The meta-query defines an statement similar to the SQL language but includes query elements and query list elements used to generate a plurality of SQL test commands to be applied to the SQL database engine under test. Test commands are generated from the meta-query to reduce storage requirements of prior test methods. Query elements are variable space holders in the meta-query and are replaced by a value appropriate to the SQL database engine under test when the meta-query is used to generate test commands. Query list elements define a list of values to be inserted in place of the query list element when generating the test commands from the meta-query.
Inventors
- 👤 Ronald Wayne Fast
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 11:44
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/36; G06F11/3668; G06F11/3672; G06F11/3688; G06F8/00; G06F8/40; G06F8/41; G06F8/42
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
118 words
Computer interpretable grammatical rules for generating a plurality of queries in a grammar for testing a database engine driver, said grammatical rules comprising: static elements for generating constant portions of said plurality of queries, wherein said static elements are copied to a buffer associated with a computer to generate said plurality of queries from said grammatical rules; and variable elements selected from at least one of a group consisting of: a query element and a query list element, for generating database engine driver specific portions of said plurality of queries, wherein said variable elements are replaced in said buffer by values specific to a particular database engine driver to generate said plurality of queries from said, grammatical rules.
Claim 2
Dependent Claim
118 words
Computer interpretable grammatical rules for generating a plurality of queries in a grammar for testing a database engine driver, said grammatical rules comprising: static elements for generating constant portions of said plurality of queries, wherein said static elements are copied to a buffer associated with a computer to generate said plurality of queries from said grammatical rules; and variable elements selected from at least one of a group consisting of: a query element and a query list element, for generating database engine driver specific portions of said plurality of queries, wherein said variable elements are replaced in said buffer by values specific to a particular database engine driver to generate said plurality of queries from said, grammatical rules.
Claim 3
Dependent Claim
20 words
The grammatical rules of claim 1 wherein said query element is enclosed by a start delimiter and an end delimiter.
Claim 4
Dependent Claim
41 words
The grammatical rules of claim 2 wherein said start delimiter is a less-than character ("<") and said end delimiter is a greater-than character (">"), and a comma character (",") separates adjacent ones of said plurality of values in said query element.
Claim 5
Dependent Claim
21 words
The grammatical rules of claim 1 wherein said query list element is enclosed by a start delimiter and an end delimiter.
Claim 6
Dependent Claim
46 words
The grammatical rules of claim 4 wherein said start delimiter is a left square brace character ("["), and said end delimiter is a right square brace character ("]"), and a comma character (",") separates adjacent ones of said plurality of values in said query list element.
Claim 7
Dependent Claim
209 words
A computer operable method for testing a database driver, said method comprising: parsing a meta-language statement into at least one meta-language statement token each comprised of at least one token element where any one of said at least one meta-language statement token that is comprised of more than one token element is a variable token element delimited by a pair of variable token element delimiters and said variable token element is a type selected from at least one of a group consisting of: a query element and a query list element; expanding said meta-language statement into a plurality of meta-language test queries comprised of one of said plurality of meta-language test queries for each unique combination of said at least one token element in each of said at least one meta-language statement token; generating a plurality of data type specific test queries from said plurality of meta-language test queries by direct substitution of a data type specific database driver query element for each substitutable one of said at least one token element in each of said plurality of meta-language test queries; repeating said step of generating for each data type supported by said database driver; and applying said plurality of data type specific test queries to said database driver.
Claim 8
Dependent Claim
209 words
A computer operable method for testing a database driver, said method comprising: parsing a meta-language statement into at least one meta-language statement token each comprised of at least one token element where any one of said at least one meta-language statement token that is comprised of more than one token element is a variable token element delimited by a pair of variable token element delimiters and said variable token element is a type selected from at least one of a group consisting of: a query element and a query list element; expanding said meta-language statement into a plurality of meta-language test queries comprised of one of said plurality of meta-language test queries for each unique combination of said at least one token element in each of said at least one meta-language statement token; generating a plurality of data type specific test queries from said plurality of meta-language test queries by direct substitution of a data type specific database driver query element for each substitutable one of said at least one token element in each of said plurality of meta-language test queries; repeating said step of generating for each data type supported by said database driver; and applying said plurality of data type specific test queries to said database driver.
Claim 9
Dependent Claim
50 words
A method according to claim 6 wherein said pair of variable token element delimiters for said query element include a less-than symbol ("<") as a start delimiter and a greater-than symbol (">") as an end delimiter, and individual tokens of said query element are separated by a comma symbol (",").
Claim 10
Dependent Claim
56 words
A method according to claim 6 wherein said pair of variable token element delimiters for said query list element include a left square brace symbol ("[") as a start delimiter and a right square brace symbol ("]") as an end delimiter, and individual tokens of said query list element are separated by a comma symbol (",").
Claim 11
Dependent Claim
114 words
A rule-based test apparatus for generating a plurality of test commands to test a database engine driver, said apparatus comprising: a memory; a processor connected to said memory; a plurality of rules, stored in said memory, wherein each of said plurality of rules is encoded in a meta-language syntax used to represent a plurality of test commands that are executable on corresponding ones of a plurality of database engine drivers; and processing means, operable in said processor, for parsing a meta-language statement input and for generating each of said plurality of test commands according to said plurality of rules and for applying each of said plurality of test commands to said database engine driver.
Claim 12
Dependent Claim
114 words
A rule-based test apparatus for generating a plurality of test commands to test a database engine driver, said apparatus comprising: a memory; a processor connected to said memory; a plurality of rules, stored in said memory, wherein each of said plurality of rules is encoded in a meta-language syntax used to represent a plurality of test commands that are executable on corresponding ones of a plurality of database engine drivers; and processing means, operable in said processor, for parsing a meta-language statement input and for generating each of said plurality of test commands according to said plurality of rules and for applying each of said plurality of test commands to said database engine driver.
References Cited (Backward Citations)
US3763474A
Cited
US4688195A
Cited
US4506326A
Cited
US5031124A
Cited
US5133068A
Cited
US5197005A
Cited
US5347647A
Cited
US5315709A
Cited
US5528748A
Cited
US5386550A
Cited
US5574898A
Cited
US5550971A
Cited
US5537590A
Cited
US5519859A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-09-01 | 2001-03-03 | 2001-09-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-09-01 | 2005-03-03 | 2005-09-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-09-01 | 2009-03-03 | 2009-09-02 | $7700.00 | Window Closed / Lapsed |