|Publication number||US20050015368 A1|
|Application number||US 10/620,633|
|Publication date||Jan 20, 2005|
|Filing date||Jul 15, 2003|
|Priority date||Jul 15, 2003|
|Publication number||10620633, 620633, US 2005/0015368 A1, US 2005/015368 A1, US 20050015368 A1, US 20050015368A1, US 2005015368 A1, US 2005015368A1, US-A1-20050015368, US-A1-2005015368, US2005/0015368A1, US2005/015368A1, US20050015368 A1, US20050015368A1, US2005015368 A1, US2005015368A1|
|Inventors||Brian Payton, Stavros Polyviou, Maria Scanlon, Sheila Sholars, Andrew Speakes|
|Original Assignee||International Business Machines Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (29), Referenced by (28), Classifications (8), Legal Events (1)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present application is related to the following patent applications which are commonly assigned and filed on the same day, Jul. 15, 2003: SVL920020046US1, application Ser. No. ______, entitled “Model Content Provider With Reusable Components for Supporting a Plurality of GUI APIs”; SVL920020047US1, application Ser. No. ______, entitled “Query Model Tool and Method for Visually Grouping and Ungrouping Predicates”; and SVL920020048US1, application Ser. No. ______, entitled “A Method and Structure for Representing Complex Query Elements in a Modelling Tool.”
This invention relates in general to database management systems performed by computers, and in particular, an interactive tool and method for graphically representing, creating, modifying and modeling structured language queries.
Databases are computerized information storage and retrieval systems. A Relational Database Management System (RDBMS) is a database management system (DBMS) which uses relational techniques for storing and retrieving data. Relational databases are organized into tables which consist of rows and columns of data. The rows are formally called tuples or records. A database will typically have many tables and each table will typically have multiple tuples and multiple columns. The tables are typically stored on direct access storage devices (DASD), such as magnetic or optical disk drives for semi-permanent storage. Data stored in a database is selectively retrieved using a database query.
The data from a relational database is commonly retrieved using a Structured Query language (SQL) interface which is well known in the art. The SQL interface has been adopted as such by both the American Nationals Standard Organization (ANSI) and the International Standards Organization (ISO), and allows users to formulate relational operations on the tables interactively, in batch files, or embedded in host languages such as C, COBOL, etc. Operators are provided in SQL that allow the user to manipulate the data, wherein each operator operates on one or more tables and produces a new table as a result.
Query languages such as SQL require some expertise to write effectively. Since both users and applications heavily rely on query statements for retrieving information, tools have been developed to assist in the creation of query statements. These tools include a user interface for creating the initial query, and a query model for storing the components of the resulting query in a manner that enables their reconstruction. Once completed, the query is forwarded to the database management system for performing selective data access.
Query tools suffer from numerous shortcomings that have highlighted a need for a more useful and user-friendly query building tool. The assistance they provide is limited to basic query syntax, requiring manual input of more complex queries. Further, while existing query tools enable creation and modification of new query statements, they do not generally provide means for populating the interface and underlying model with existing query statements to enable modification of those statements.
Other shortcomings exist in the query models themselves. For example, existing models provide limited representation of complex query elements in formats that are not readily understandable to the developer. Moreover, they do not provide much flexibility for reconstructing the query and its subelements. In addition, they are often dependent upon the format of a particular user-interface and do not lend themselves well to use by graphical user interfaces of different formats.
In response to the shortcomings of prior query generating tools, the present invention is directed to a user-friendly interactive system and method for representing, creating, modifying and modeling a query language statement for use in retrieving data from a database. According to the system and method of the present invention, a tool is provided that includes an interactive graphical user interface for inputting, creating, and modifying database query statements. The tool further provides an application interface for enabling receipt and manipulation of existing query statements. A modeling schema is defined for storing the query statement elements. The modeling schema provides a high granularity, meaningful representation of complex query elements reflective of the query syntax. As one aspect of the invention, the modeling schema reflects multiple dialects of the query language by representing element types and subtypes from all dialects considered in creating the schema. In a further aspect of the invention, the granularity of the modeling schema enables reconstruction of the query statement or any element thereof with a single call to a node representative of that element. The call returns not only the element represented by the node, but also all elements represented by subnodes of the node.
In one aspect of the invention, queries can be built directly by a user through a user-interface, or by an application through an application programming interface.
In another aspect of the present invention, the interface and model may be populated by newly created query statements, existing query statements, or both.
In a further aspect of the invention, nested search conditions may be created and manipulated through the graphical user interface and the resulting query represented in an understandable manner.
In another aspect of the present invention, the interface is dynamically adaptive to the query element being constructed.
In another aspect of the present invention, any sub-element of a stored query statement may be reconstructed inclusive of all of its child elements.
In a further aspect of the present invention, the query model represents query elements that have historically been difficult to model in a granular and understandable fashion, such as group-by's, predicates, table references, value expressions and iterative and nested elements. In particular, the query model comprises atomic, hierarchical representations of all desired query elements, taking into account the various dialects of the query language, so that any incoming query can be stored within its schema.
In yet another aspect of the invention, a layer comprising a common set of generalized classes is provided between the user interface and the query model for use in retrieving data from the query model and populating user interfaces of different formats.
FIGS. 7 to 10 illustrate model representations of various complex query elements using the combined structure of
The present invention will now be described with reference to a specific embodiment. However, it will be understood that various modifications and equivalent substitutions may occur to an implementer of the tool described without parting from the spirit and scope of the invention. Accordingly, the invention is not intended to be limited in any manner by the specific embodiment, and each element described is intended to encompass all reasonable equivalents thereof.
I. System Architecture
The user interface 20 may be incorporated into an application, thereby enhancing the application interface with query building capabilities. Alternatively, the interface may be part of a separate query building tool.
The application interface 22 is coupled to a parser 24, as represented by arrow 27. Parser 24 receives the query statement and decomposes it into subelements or model elements (objects) based on the parsing rules. The parsing rules include syntactic rules and semantic rules. The syntactic rules break down the query into syntactic elements that form the basis for creating a query model representation. The semantic rules enable the parser to create and relate the model objects according to the model definition. These semantic rules will be described in further detail subsequently. The parsed statement is then forwarded to a memory-based query model 26 for storage as represented by arrow 29. The parser 24 may also forward the model elements to the user interface 20. Consequently, queries received through API 22 may be modified via user interface 20.
Interface 20 also communicates with query model 26 via GUI model infrastructure 28, as represented by arrows 19 and 21. Interface 20 is designed to be consistent with the query model definition. Accordingly, when a query is created using interface 20, the interface creates and relates model elements that conform to the query model definition. The queries may be used to populate the model directly as represented by connection 21 without further parsing.
The user interface 20 may also include a query input allowing the user the option of typing in a query statement. Such queries are first sent through the parser 24 so that the model elements and relationships may be created in the same manner as queries received over API 22. In addition, the user interface of the present invention includes an expression builder which allows a user to type in complex sub-expressions. These sub-expressions are similarly passed to the parser over connection 25 prior to being stored in the query model 26.
II. User Interface
The interface portion of the query building tool may be implemented using any known interface generating tool or programming language such as, for example, Visual Basic or Java.
As illustrated in
Alternatively, the interface may be populated with an existing query statement stored in the underlying query model. This is achieved by each portion of the interface retrieving and displaying the elements of the underlying query model that are appropriate for that portion.
The “Details” section 32 enables the user to specify the parameters for his selected subcategory. The format of region 32 changes for each subcategory selection made in region 30. For example, if the user selects subcategory “FROM”, the interface makes a call to the underlying database for a list of available source tables, and then displays these as selectable options. The user then selects from the displayed tables, e.g., by highlighting. Similarly, if the user selects the “SELECT” subcategory, the details region 32 displays the columns of the selected table(s) for further selection by the user. Selection of the “WHERE” subcategory causes the “Details” section to display a “Predicate” region 34 and a “Search Conditions” region 36 as shown.
The predicate region 34 allows the user to build one or more predicates by selecting an operator (AND, OR or NOT) using buttons 31A and 31B for connecting multiple predicates, a column name 33, a column operator 35, and an operator value 37, e.g. by pull down menu, field select or other comparable means. The resulting predicate is displayed in editing window 38 and “Search condition” window 36, described in more detail subsequently.
As an aspect of the present invention, the format of the value input area 35 in the predicate region 34 changes dynamically in response to selection of a column operator 35. For instance, in
Another example of the dynamic aspect of the predicate region 34 is shown in
When all predicate options have been specified in field 34, the user confirms his selection, e.g. by clicking his mouse on button 39. Confirmation causes the query model to be populated or updated with the new predicate as previously described. It also causes the new predicate to appear in search condition display area 36 and in “SQL code” editing window 38.
In the example of
Another aspect of the present invention is the ability to group or nest predicates in region 36 to control the order in which they are evaluated. In
The grouping function described above is illustrated by flow diagram 3D. In a first step 91, the user select rows in search condition area 36 such that first and last rows are at same level of indentation. Such selection causes the grouping button 41 to be enabled, as shown in step 92, so that the user may activate it (step 93). Activation causes the query model 26 to be updated to reflect new grouping of conditions, as represented in step 94. The GUI-Model Infrastructure 28 is notified of query model change in step 95 and in response, GUI-Model Infrastructure 28 updates User I/F 20 as shown in step 96.
The Where Clause user interface design proved a challenging undertaking. The current design provides a tremendous amount of functionality masked by a simple and intuitive user interface. Many query builders do not support the full syntax of the Where Clause in the GUI due to the complex nature of this clause, and the inventors are not aware of any that provide the functionality of the present invention.
A Where Clause consists of a search condition that limits the number of rows the database will return after executing a SQL query. A search condition, which may be nested, consists of a set of predicates combined with logical operators. Each predicate, which may be negated, specifies a condition that may be true, false or unknown. There are many types of predicates that may be expressed using a different syntax for each.
The Where Clause user interface design of the present invention allows the user to build the search condition one predicate at a time. It allows for easy creation, insertion, nesting, negation and removal of predicates. It supports most of the different forms of predicates available. It allows the user to insert each predicate anywhere in the search condition.
To make the search condition more readable and understandable, the predicates are indented to show the level of nesting. This flexible design is not only applicable to a Where Clause in SQL, but it may be applied anywhere one has a need to build a potentially nested object (search condition in this case) which is made up of other well-formed, complex objects (predicates in this case).
Moving on, the “SQL code” editing window 38 displays the query substatements as they are built and confirmed. Confirmation occurs, e.g., by clicking on “>” button 39 with a mouse, and causes the underlying query model to be populated or updated with the new/updated query substatement as previously described.
Editing window 38 allows the user to directly modify the displayed query statement, and on completion, to update the query model. Updating is effected by clicking on “Check” button 42 or similar means. The user also has the option of undoing his edits by clicking on “Undo Edit” button 40, or running the displayed query by clicking on “Run” button 44.
Next, the user presses one of the center buttons to either insert or replace the predicate in the Predicate area 34 into the Search condition area as follows.
The insert buttons, “AND>” 31A and “OR>” 31B, are enabled (block 87) if the predicate in the Predicate area 34 is complete and any line is selected in the Search condition area 36. Pressing these buttons (block 88) adds two lines to the Search condition area 36 after the selected line. The first is either the logical operator AND or OR, respectively. The second line added to the Search condition area is the predicate in the Predicate area 34.
The replace button, “>” 39, is enabled (not shown) anytime a predicate is selected in the Search condition area 36 or the Search condition area 36 is blank. As represented generally in block 89, if pressed when a predicate is selected in the Search condition area 36 and the predicate in the Predicate area 34 is complete, the selected predicate in the Search condition area 36 is replaced with the predicate in the Predicate area 34. If button “>” 39 is pressed when the Search condition area 36 is blank and the predicate in the Predicate area 34 is complete, the predicate in the Predicate area 34 is added as the first predicate in the Search condition area 36. If button “>” 39 is pressed when the Search condition area 36 is blank and the predicate in the Prediate area 34 is incomplete, a message will appear indicating that the user must first complete the predicate.
Pressing the replace button “>” also causes the query model to be updated, as further indicated by block 89.
As noted above, many more user interactions can occur on this panel such as nesting, negating and removing predicates..
III. Parsing a Query
What is described next is a program algorithm for resolving column references and value expression datatypes in a parsed query language statement, an SQL statement for example. The process involves three phases: syntactic parsing, resolution of table and column references, and resolution of all other value expressions. Each phase operates on a model of the syntactic structure of the QUERY LANGUAGE statement.
A query parser can handle the syntactic aspect of parsing a query language string by using information contained in the input query string alone. However, the parser cannot handle some of the more semantic aspects of parsing without extra information that is not contained in the query language statement itself. These semantic aspects include associating column references that are contained in the query language with the tables to which the columns belong, and assigning a datatype to each value expression contained in the query language. Value expressions include column references, literal values such as 2 or ‘Smith’, numeric expressions such AGE+10, string expressions such as LASTNAME CONCAT’, ‘CONCAT FIRSTNAME, and the like.
The three phases of the process are defined as follows.
In the first phase, the input QUERY LANGUAGE string is syntactically parsed into an internal model form. As will be described subsequently, the model used is a tree-structured representation of the syntactic elements of the QUERY LANGUAGE statement. For example, the following QUERY LANGUAGE statement,
can be represented in model form like this:
SQLQueryStatement SQLSelectClause SQLExpressionColumn (name: NAME) SQLExpressionCombined (operator: *) SQLExpressionColumn (name: SALARY) SQLExpressionLiteral (value: .05) SQLFromClause SQLTableReference (name: EMPLOYEES)
where each named item represents a syntactic element of the SQL statement. The indentation above indicates a “contains” relationship. For example, a SQLQueryStatement element contains a SQLSelectClause and a SQLFromClause, and a SQLSelectClause contains a SQLExpressionColumn and a SQLExpressionCombined and so on.
At the same time that the parser is producing this tree-structured model, it builds a simple list that contains references (or pointers) to the value expressions that it encounters. For the example after the SQL above is parsed, the value expression list contains the following elements.
In the second phase of the process, the value expressions that are of type SQLExpressionTable and SQLExpressionColumn in the expression list are semantically resolved by associating them with table (or view) and column entities in a provided information catalog. (In a typical scenario this catalog is the relational database in which the SQL statement is intended to be executed.) First, expressions of type SQLExpressionTable are matched with table entities in the catalog based on attributes of the SQLExpressionTable, such as table name and schema name (if present). Next, information about the columns belonging to each table are obtained from the catalog. This information includes not only the column names, but their datatypes as well (such as INTEGER and VARCHAR). Then, using the column name attribute of the SQLExpressionColumn objects, the SQLExpressionColumns are associated with their corresponding table and column entities in the catalog. This enables datatypes to be assigned to each SQLExpressionColumn. For example, in the query above, after phase 2 the column expression objects in the model (and in the expression list) have been updated to become:
In the third phase, all remaining value expressions in the expression list are resolved as to their datatype. The technique used to do this varies depending on the kind of value expression and on the type of query structure that contains it. Here are illustrations of the processing required in this phase for several types of value expression.
SQLExpressionLiteral: the datatype is determined by inspecting the value directly. For example a simple numeric value becomes INTEGER. A decimal value gets the datatype DECIMAL(precision, scale) where the precision and scale are determined by length of the decimal value and the location of the decimal point. A quoted string value gets datatype VARCHAR(length) where the length is the length of the value inside the quotes.
SQLExpressionCombined: the datatype is determined by recursively examining the left and right side components of the expression object to find a value expression whose datatype has already been resolved, and using that datatype for the datatype of the SQLExpressionCombined object as a whole. For example, if the SQLExpressionCombined encompasses “SALARY*0.05”, the datatype of the expression can be determined by looking at the left side, which contains a SQLExpressionColumn object (SALARY) whose datatype (DECIMAL) is known. The semantic check that the two sides of a combined expression are “combinable” datatypes can be done at the same time.
SQLExpressionFunction: The method for determining the datatype of a SQL function object varies depending on the particular function involved. For some functions, the datatype is simply the return datatype defined for the function (such as the return type INTEGER for the cast function INTEGER( )). For other functions, the datatype of the function depends on the datatype of its arguments. (For example, the function MAX takes on the datatype of its argument. The datatype of MAX(SALARY) is DECIMAL, while the datatype of MAX(AGE) would be INTEGER.)
Resolving the datatypes of all the value expressions may take several passes through the value expression list. For the query given above, the expression list at the end of phase 3 might look like this:
The GUI Model Infrastructure (GMI) of the present invention is shown in
More specifically, user interface 20 is shown to include a plurality of GUI API's, GUI API1 and GUI API2. GUI Applications A, B, C and D run on the user interface and are written to a specific GUI API. For example, as shown, GUI applications A and B are written to run on GUI API1. Similarly, GUI applications C and D are written to a different GUI API2.
The GMI 28 includes Model Content Providers (MCP) 111, which translate Query Model (QM) 26 information into collections of information that are independent of structure type. The MCP interfaces with Content Viewers 113 (CV's 118, 119, 120) which take the MCP collections and manipulate the collections for specific structures such as tables, trees, lists, etc. The CV's 113 are a hierarchical set of classes, from the more abstract structures 120 at the top, to the GUI-specific structures 118, 119 at the bottom.
The Non GUI API specific components of the GMI 28 reside to the right of the dashed line and are created w/o regard to which GUI API will be used. The beauty of this architecture is that the non-specific CV's 113 are reusable, API-independent components. Thus, they provide scalability to diverse, subsequently added GUI API's.
In contrast, the GUI-specific CV's 118, 119 to the left are written specifically to the GUI API they communicate with. In the present
Stepping back for a moment, the content viewers 113 of the present invention are defined by a hierarchical set of classes. Previously, content viewers were designed for a single GUI API as might be represented by blocks 118 and 120.
Due to the lower levels of this hierarchy being GUI API specific, and the higher levels of the hierarchy being non GUI specific, the designers were able to clearly divide the Content Viewers 113 into reusable and non reusable components able to support multiple API's. Lower level GUI API specific classes were rewritten to enable reuse of the higher levels of the Content Viewer classes as well as the tightly coupled Model Content Providers.
The Model Content Provider 111 of the present invention performs several functions. It creates objects, called item providers, that are instances of the model elements representing the current SQL Statement. These objects are created dynamically as the user builds the statement. The query model relationships (e.g. hierarchy, dependencies, etc.) that the Query Model 26 contains are also contained in the item provider objects. Thus, for a specific statement, its “model” is actually a set of item provider objects whose relationships are dictated by the overall Query Model 26.
MCP 111 obtains information from the Query Model 26 and translates this information into data for use by Content Viewers. The higher layers of the Content Viewers, block 120, passes on this data to lower layer viewers (blocks 118 or 119). It receives information from the GUI applications via the Content Viewers, independent of the specific structure (e.g. table, tree, list, etc) of the data.
In addition, MCP 111 is able to discern if the information it gets from the viewers is an addition, a modification, or a deletion of any element in the current model. In the case of an addition, the MCP is able to discern if additional model elements need to be created. It has a “factory” class that takes care of creating additional item providers corresponding to these new model elements. For example, the GUI application gave a request to add a table to the query. One of the content viewers passes this information to the MCP 111. The MCP 111 is aware that it will need to get the “children” of this model element, so it calls on its “factory” class to create the children of this particular model element, a table, which happen to be the columns of the table. Once these elements are created and properly linked in the Query Model 26, the MCP instructs the Content Viewers to refresh the information that they have. Only the Content Viewers affected by the addition of the table, will be refreshed. Once refreshed, the Content Viewers will inform the GUI application to update what is displayed to the user.
Similarly, in the case of a deletion, when a model element that has children is deleted, the Content Viewers send the request to delete this element to the MCP 111. The MCP 111 takes care of determining where the child elements are linked to in the entire query model and performs the removal of these objects from the Query Model 26. Again, when the deletions are complete, the MCP 111 informs the Content Viewers 113 to refresh themselves.
The MCP provides both data and image information to the viewers. Special classes, called label provider classes contain text and image information and are tied to specific model elements of the query. This allows for easy translation of labels or revision of icons.
To save an existing query, the Query Assist tool of the present invention provides a set of hierarchical models for storing the query elements, as will be described subsequently.
V. The Query Model
The query model of the present invention is designed with the actual syntax of the query language in mind, mirroring each element of the query statement and its relationships to the other elements. Since a number of dialects of a query language such as SQL may be in use, the model is optionally designed to reflect syntax common for multiple dialects. Further, it provides a more detailed representation of query components than is currently available. To this end, detailed representations of various query components are provided.
The present invention provides both a modeling methodology and examples of actual models produced using the described methodology. Once a query element has been selected for modeling, the steps outlined in
A. Combined Structures to Represent Query Elements
A first challenge to the modeler is to completely and accurately depict the iterative and nesting capabilities of the query language. In particular, a query statement may contain a complex query expression that includes an atomic query element “AQE”, i.e., noniterative and unnested query element. It may further include a combined operator “CO”. The CQE includes right and left subelements related by a combined element operator. These subelements may in turn be either AQE's or CQE's, and furthermore, the structure of a CQE is shown below:
CQE=((LQE CO RQE)
where LQE is the left query element, RQE is the right query element, CO is a combined operator such as AND/OR, and where LQE and RQE can either be atomic or combined query elements.
Previous models have often been simplistic and inefficient at representing such expressions, and have therefore been of limited usefulness. This present invention provides a representation that succinctly and accurately reflects the true picture of both the data and underlying structure of the query language.
Accordingly, the present invention provides a “Combined Structure” model as shown in
As an example, consider the following query:
SELECT DEPARTMENT.DEPTNAME, EMPLOYEE.LASTNAME FROM DEPARTMENT, EMPLOYEE WHERE DEPARTMENT.DEPTNO IN (‘D01’, ‘D11’, ‘D21’) AND (EMPLOYEE.SALARY > 50000 OR EMPLOYEE.JOB = ‘MANAGER’)
We will use the above example to map a query into an instance of the model structure shown in
According to the present invention, the generalized combined structure of
B. Representing Predicates
C. Representing Table References
D. Representing Value Expressions
E. Representing Group-By
F. Generating a Query Language Element from the Query Model Inclusive of its Children
An advantage of the top-down modeling approach of the present invention is the ability to recreate any query language element such as a clause or substatement of the query downward, not just at the root level. That is, a call can be made to a particular subnode, and as a result of the call the subnode and its children return a reconstructed query language element representing the value of the subnode and its children.
As an example, consider the following select statement:
Applications may involve multiple models which may have a domain different from the one described above. This can be a problem when there are dependencies between models so that even minor changes to one model can affect the other models and require updating to the latter. More specifically, in a typical code generating environment, when models used to generate code have dependencies between them, then modifying one model requires code to be regenerated for all the related models.
The present invention helps to overcome this problem by providing a greater degree of independence among models. Within the code-generating environment, dependencies between models are removed such that changes to one model do not force the regeneration of code by other models.
This is achieved by adding proxy objects to a model to replace references to other models, and then reestablishing the references amongst the models after the code generation step.
An example is illustrated in
Although the present invention has been described with reference to a specific embodiment, various substitutions and modifications may occur to the developer in implementing the invention without departing from its spirit and scope. Accordingly, the invention is not to be limited by the specification set forth, but is to be accorded its broadest interpretation as claimed, below.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5289567 *||Apr 1, 1991||Feb 22, 1994||Digital Equipment Corporation||Computer apparatus and method for finite element identification in interactive modeling|
|US5418950 *||Sep 21, 1994||May 23, 1995||International Business Machines Corporation||System for interactive clause window construction of SQL queries|
|US5421008 *||Nov 8, 1991||May 30, 1995||International Business Machines Corporation||System for interactive graphical construction of a data base query and storing of the query object links as an object|
|US5428737 *||Oct 16, 1991||Jun 27, 1995||International Business Machines Corporation||Comprehensive bilateral translation between SQL and graphically depicted queries|
|US5471613 *||Aug 11, 1994||Nov 28, 1995||International Business Machines Corporation||Tree structure representation of an SQL clause|
|US5504885 *||Jun 29, 1993||Apr 2, 1996||Texas Instruments Incorporated||O-R gateway: a system for connecting object-oriented application programs and relational databases|
|US5566330 *||Feb 23, 1995||Oct 15, 1996||Powersoft Corporation||Method for forming a reusable and modifiable database interface object|
|US5701456 *||Aug 30, 1995||Dec 23, 1997||International Business Machines Corporation||System and method for interactively formulating database queries using graphical representations|
|US5721897 *||Jul 26, 1996||Feb 24, 1998||Rubinstein; Seymour I.||Browse by prompted keyword phrases with an improved user interface|
|US5721900 *||Jul 20, 1992||Feb 24, 1998||International Business Machines Corp||Method and apparatus for graphically displaying query relationships|
|US5787418 *||Sep 3, 1996||Jul 28, 1998||International Business Machine Corporation||Find assistant for creating database queries|
|US5826258 *||Oct 2, 1996||Oct 20, 1998||Junglee Corporation||Method and apparatus for structuring the querying and interpretation of semistructured information|
|US5832481 *||Oct 14, 1997||Nov 3, 1998||Powersoft Corporation||Reuseable and modifiable interface object|
|US5842209 *||Sep 3, 1996||Nov 24, 1998||International Business Machines Corporation||User interface for visually depicting inner/outer/left/right joins in a database system|
|US5924089 *||Sep 3, 1996||Jul 13, 1999||International Business Machines Corporation||Natural language translation of an SQL query|
|US6016488 *||Nov 4, 1998||Jan 18, 2000||Microsoft Corporation||Method and system for constructing queries|
|US6047284 *||May 14, 1997||Apr 4, 2000||Portal Software, Inc.||Method and apparatus for object oriented storage and retrieval of data from a relational database|
|US6226785 *||Jan 13, 2000||May 1, 2001||Apple Computer, Inc.||Method and apparatus for storing and replaying creation history of multimedia software or other software content|
|US6282537 *||Apr 6, 1999||Aug 28, 2001||Massachusetts Institute Of Technology||Query and retrieving semi-structured data from heterogeneous sources by translating structured queries|
|US6496833 *||Nov 1, 1999||Dec 17, 2002||Sun Microsystems, Inc.||System and method for generating code for query object interfacing|
|US6581054 *||Jul 30, 1999||Jun 17, 2003||Computer Associates Think, Inc.||Dynamic query model and method|
|US6775662 *||May 21, 2001||Aug 10, 2004||Oracle International Corporation||Group pruning from cube, rollup, and grouping sets|
|US7032071 *||May 21, 2002||Apr 18, 2006||Sun Microsystems, Inc.||Method, system, and program for using buffers to provide property value information for a device|
|US20010016843 *||Feb 8, 1999||Aug 23, 2001||Todd Olson||Method and apparatus for accessing data|
|US20020198876 *||Oct 17, 2001||Dec 26, 2002||Siemens Medical Solutions Health Services Corporation||System supporting use of customizable expressions by applications|
|US20030037039 *||May 10, 2002||Feb 20, 2003||International Business Machines Corporation||Schema for SQL statements|
|US20040034846 *||Jun 12, 2003||Feb 19, 2004||I-Logix Inc.||System, method and medium for providing dynamic model-code associativity|
|US20050004911 *||Sep 25, 2003||Jan 6, 2005||Oracle International Corporation||Graphical condition builder for facilitating database queries|
|US20050144163 *||Jan 7, 2005||Jun 30, 2005||Microsoft Corporation||Systems and methods for generating prediction queries|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7693862 *||Jun 29, 2005||Apr 6, 2010||Microsoft Corporation||User interface mechanism to formulate complex query against an entity relationship model|
|US7840614||Jul 11, 2003||Nov 23, 2010||Bea Systems, Inc.||Virtual content repository application program interface|
|US8099779||Aug 29, 2008||Jan 17, 2012||Oracle International Corporation||Federated management of content repositories|
|US8150887||Dec 21, 2007||Apr 3, 2012||Emc Corporation||Identifiers for non-searchable attributes|
|US8171006||Dec 21, 2007||May 1, 2012||Emc Corporation||Retrieval of searchable and non-searchable attributes|
|US8171054||Dec 21, 2007||May 1, 2012||Emc Corporation||Optimized fetching for customization object attributes|
|US8255426||Dec 21, 2007||Aug 28, 2012||Emc Corporation||Efficient storage of non-searchable attributes|
|US8307334 *||Sep 17, 2007||Nov 6, 2012||International Business Machines Corporation||Method for assisting a user in the process of creating software code|
|US8312038 *||Dec 18, 2008||Nov 13, 2012||Oracle International Corporation||Criteria builder for query builder|
|US8316012 *||Jun 27, 2008||Nov 20, 2012||SAP France S.A.||Apparatus and method for facilitating continuous querying of multi-dimensional data streams|
|US8402045 *||Jan 31, 2012||Mar 19, 2013||Salesforce.Com, Inc.||System, method and computer program product for storing a formula having first and second object fields|
|US8793266 *||Sep 20, 2011||Jul 29, 2014||International Business Machines Corporation||Graphical user interface for a search query|
|US8868620 *||Jun 8, 2007||Oct 21, 2014||International Business Machines Corporation||Techniques for composing data queries|
|US9021447 *||Feb 12, 2013||Apr 28, 2015||Concurix Corporation||Application tracing by distributed objectives|
|US9069448 *||Apr 19, 2011||Jun 30, 2015||Salesforce.Com, Inc.||Filtering objects in a multi-tenant environment|
|US9129606 *||Sep 23, 2011||Sep 8, 2015||Microsoft Technology Licensing, Llc||User query history expansion for improving language model adaptation|
|US20040167867 *||Jul 11, 2003||Aug 26, 2004||Bea Systems, Inc.||Virtual content repository application program interface|
|US20050102284 *||Nov 10, 2003||May 12, 2005||Chandramouli Srinivasan||Dynamic graphical user interface and query logic SQL generator used for developing Web-based database applications|
|US20060028252 *||Aug 10, 2004||Feb 9, 2006||Bea Systems, Inc.||System and method for content type management|
|US20090327257 *||Jun 27, 2008||Dec 31, 2009||Business Objects, S.A.||Apparatus and method for facilitating continuous querying of multi-dimensional data streams|
|US20120084328 *||Apr 5, 2012||International Business Machines Corporation||Graphical User Interface for a Search Query|
|US20120131068 *||Jan 31, 2012||May 24, 2012||Salesforce.Com, Inc.||System, method and computer program product for storing a formula having first and second object fields|
|US20120144313 *||Jun 7, 2012||Salesforce.Com, Inc.||Filtering objects in a multi-tenant environment|
|US20130080162 *||Mar 28, 2013||Microsoft Corporation||User Query History Expansion for Improving Language Model Adaptation|
|US20130091153 *||Aug 3, 2012||Apr 11, 2013||Salesforce.Com, Inc.||Method and system for updating a filter logic expression representing a boolean filter|
|US20130246464 *||Apr 30, 2013||Sep 19, 2013||Oracle International Corporation||Query generation|
|US20130246951 *||Apr 30, 2013||Sep 19, 2013||Salesforce.Com, Inc||Filtering objects in a multi-tenant environment|
|US20140189548 *||Jan 3, 2013||Jul 3, 2014||Ca, Inc.||Domain specific language user interface|
|U.S. Classification||1/1, 707/999.004, 707/999.003|
|Cooperative Classification||G06F17/30398, G06F17/30595|
|European Classification||G06F17/30S8R, G06F17/30S4F5|
|Dec 10, 2003||AS||Assignment|
Owner name: INTERNATIONAL BUUSINESS MACHINES CORPORATION, NEW
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PAYTON, BRIAN G.;POLYVIOU, STAVROS;SCANLON, MARIA N.;ANDOTHERS;REEL/FRAME:014185/0959;SIGNING DATES FROM 20030715 TO 20031107