JP2001318816A - Method for displaying contents of plural data base by using browser - Google Patents

Abstract

PROBLEM TO BE SOLVED: To display data stored in arbitrary plural relational data bases. SOLUTION: In this method for displaying relations among records in a data base, each structure of plural relation data bases is decided (a), and the field value of the selected record of the data base is displayed on a display (b), and a route from the selected record to the list of the other records is specified (c), and a user input signal for designating one of possible relations as the selected relation is received (d), and a part of the list of the selected records is added to the display (e), and a route from the related record list to the list of the other records is specified according to each possible relation (f).

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates generally to the field of software applications. More particularly, it relates to a software program for browsing records of one or more arbitrary relational databases.

[0002]

2. Description of the Related Art Databases often take the form of multiple files for storing related information. A relational database is a database in which a plurality of tables including database records are gathered into one, and each record in a single table is made up of a set of fields common to all records in the table.

[0003] In some relational databases, a standard query language is used.
, and can be accessed along complex dimensions using SQL (SQL). Such a database makes it convenient to look up information based on specifications derived from semantic frames.

Further, each database has a data structure. One data structure is defined as a physical or logical relationship between data elements and is designed to support a particular data manipulation function.

[0005]

Some data structures are browsable formats. Therefore,
The content or data contained in that structure is browsable. Browsing content or data on the tables of most database tables on a table basis is not an easy task due to the large number of records contained in the tables. Also, a database user may wish to cross-reference one data record in one relational database with another record in another database. This requires the user to browse through the records in each database one at a time. Such a method is cumbersome and time consuming. Also, the user can enter all those records stored in the various databases and develop special programs to combine those records into one database. Such tasks, however, are inefficient, expensive and time consuming.

As the relationships between data stored in separate databases become more important, the utility of the ability to quickly display these data becomes more apparent. The present invention provides database users with the ability to quickly display data stored in any of a plurality of relational databases.

[0007]

SUMMARY OF THE INVENTION A method of the present invention for displaying relationships between records in a database, wherein the database includes a plurality of tables, each table being divided into one or more fields. (A) determining the structure of each of the plurality of relational databases, including one or more records; (b) displaying field values of selected records in tables of the databases on a display; Displaying a list of possible relationships between the selected record and other records in the database on the display, wherein each possible relationship is determined from the selected record to another record; Stipulate a route to a list of
(D) receiving a user input signal designating one of the possible relationships as the selected relationship; and (e) selecting the selected relationship by the selected relationship, called an associated record list. Adding at least a portion of a list of records associated with the associated record to the display; and (f) adding to the display a list of possible relationships between the associated record list and other records in the database. Wherein each possible relationship defines a path from the related record list to a list of other records.

The method of the present invention comprises the steps of: (g) receiving a user input signal designating a record in the related record list as a new selected record; and (h) for the newly selected record, Repeating the processes described in (d) to (f) of claim 1.

[0009] The method of the present invention is a method for displaying a relationship between records of a plurality of relational databases having an arbitrary structure, wherein each database includes a plurality of tables, and each table includes one or more fields. Including one or more records to be split, each table having a name, each field having a name, (a) determining each structure of the plurality of relational databases;
(B) integrating the respective structures of the plurality of relational databases into one front-end integrated data structure; and (c) selecting a selected one of the plurality of tables in the plurality of relational databases. Displaying the field values of a record on a display; and (d) displaying on the display a list of possible relationships between the selected record and other records in the plurality of relational databases. Each possible relationship defines a path from the selected record to a list of other records,
(E) receiving a user input signal specifying one of the possible relationships as a selected relationship; and (f) selecting the selected relationship by a selected relationship, referred to as a related record list. Adding at least a portion of a list of records related to the retrieved record to the display; and (g) adding to the display a list of possible relationships between the related record list and other records in the plurality of relational databases. Each possible relationship defining a path from the related record list to a list of other records.

The method of the invention comprises the steps of: (a) receiving a user input signal designating a record in the related record list as a new selected record; and (b) for the newly selected record, A step of repeating the processes described in (e) to (g) of claim 3.

In the method of the present invention, the step of integrating the respective structures includes the step of deleting the names of tables and fields that conflict in the front-end integrated data structure; Establishing a link between the selected fields in.

The method of the invention further comprises the step of deleting the conflicting name, wherein for the selected name, displaying a cross-reference list for use of the selected name in the plurality of relational databases. Receiving at least one edit command from the user that specifies an operation to be performed on a selected table or a selected field; and executing the at least one edit command. Good.

[0013] The method of the present invention includes the step of the at least one editing command receiving an alias specifier specifying an alias for a selected name, and displaying the alias instead of the selected name. May be included.

[0014] The method of the invention may further comprise the step of storing a representation of the relationship between said alias and said selected name.

The computer readable medium of the present invention encodes instructions which, when executed by a computer, perform the method of any of the preceding claims.

The computer of the present invention is programmed to perform the method according to any one of claims 1 to 8.

A machine-implemented method and apparatus is provided for displaying relationships between records in a database in a browsable format. Each database contains a plurality of tables. Each table includes one or more fields and one or more records. The method includes several steps. The first step involves selecting a record, and then displaying the field values of the selected record on a display, such as a computer screen.

Next, a list of possible relationships between the selected record and other records in the database is displayed. Each of the possible relationships defines a bi-directional path between the list of one or more other records and the selected record. That is, each path has a keyed field relation by a key.
Using relationships, one record in one table is associated with one or more records in another table (ie, primary key, foreign key (foreign key)).
ignition keys), composite key (composite)
keys, secondary keys, etc .; These types of keys are well known in the database art. ).

The next step is to receive an electronic input signal from the user, designating one of the possible relationships as the selected relationship. This input signal may be received by highlighting the selected relationship with a mouse and clicking or double clicking on it.

As a result of receiving this electronic input signal, at least a portion of a list of records associated with the selected record via the selected relationship, called a "related record list", has already been displayed on the screen. Added to the list. Along with the related record list, a list of possible relationships between the related record list and other records in the database is also added to the display, where each of the possible relationships is moved from the related record list to another record. Specifies the route to the record list.

If the user has a list of records associated with records in the related records list, and a record in the related records list in the database,
If the user wishes to display a list of possible relationships with other records, the user will send another input signal specifying the record in the related list as the newly selected record. .

In a second aspect of the invention, there is provided a machine-executable method and apparatus for displaying relationships between records of one or more relational databases in a browsable format. Each database may have its own structure. Certain databases may be Microsoft Access databases. Another database may be Oracle's database. Each database contains multiple tables. Each table contains one or more fields, and each field contains one or more records. Each table and each field has a name. The method of the second aspect of the present invention includes several steps.

The first step is to use a plurality of relational databases (eg, Oracle®, S
ybase (registered trademark), Microsoft Acc
ess, etc.).

The next step is to combine the individual structures of the relational databases into a front-end integrated data structure. This step
(A) Conflicts between tables and fields in the front-end integrated data structure
ing) removing names; and (b) performing a join operation to establish a "link" between selected fields in at least two respective tables in each of the separate databases.

In removing conflicting names, a name is first selected, followed by a cross-reference listing of the use of the selected name in multiple relational databases. This selected name is edited to another name more appropriate for the user, called the "alias" of the name. Once the selected name is changed to an "alias" of this name, the "alias" of that name is displayed instead of the selected name. No changes are made to the physical database.

When performing a join operation, if a plurality of selected fields are joined in a "virtual" table, a "link" is formed between the selected fields. When multiple database tables are combined to create a "virtual" table by definition, the database tables include common fields. For the purpose of this "virtual" table, one selected field in one database table is designated as the "primary key" while the corresponding selected field in the other joined database table is " Foreign key ".

Once the structures of the relational databases are integrated and once become a front-end integrated data structure, a record from the front-end integrated data structure is selected and its field values are displayed.

Next, a list of possible relationships between the selected record and other records in the plurality of relational databases is displayed. Each of the possible relationships defines a path from the selected record to a list of other records. That is, each path associates one record in one table with one or more records in another table using field relationships by key (ie, primary key, foreign key, composite key,
Next Key, etc .; These types of keys are well known in the database art. ).

Next, an electronic input signal is received from the user, designating one of the possible relationships as the selected relationship. This input signal may be received by highlighting the selected relationship with a mouse and clicking or double clicking on it.

As a result of receiving this electronic input signal, at least a portion of the list of records associated with the selected record via the selected relationship, referred to as the "related record list," has already been displayed on the screen. Added to the list. Along with the related record list, a list of possible relationships between the related record list and other records in the database is also added to the display, where each of the possible relationships is moved from the related record list to another record. Specifies the route to the record list.

If the user has a list of records associated with the records in the related record list, and a list of possible relationships between the records in the related record list and other records in the plurality of relational databases. Would send another input signal specifying the record in the related list as the newly selected record.

The present invention has a number of advantages, including the ability to display the data structure of one or more relational databases in a browsable format. In addition to browsing data structures, the present invention provides the ability to display database content, ie, records. The present invention provides the flexibility for the database user to select any record as a starting point. From that record, the user can view other records related to it. This feature of the present invention may facilitate cross-referencing one record in one table in a relational database, possibly with another record in another table in another relational database. Another important advantage of the present invention is the flexibility to change various relational database fields and tables to other names that are more appropriate for the user.

The accompanying drawings form part of the present specification and are included to further explain certain aspects of the present invention.
The invention will be better understood with reference to one or more of these drawings, together with a detailed description of the specific embodiments described herein.

Although the present invention is capable of modification in various modifications and alternative forms, specific embodiments are illustrated by the drawings and are described in detail in the present invention. It should be understood, however, that the description of a particular embodiment is not intended to limit the invention to the particular form disclosed. It is intended to cover all modifications, equivalents, and variations within the spirit and scope of the invention as defined by the appended claims.

An exemplary embodiment of the present invention is described below. For clarity, not all features of an actual implementation have been described herein. In the development of any practical embodiment, many implementation-specific decisions must be made to achieve a particular goal of the developer, a system that varies from one implementation to another. It will of course be appreciated that related and business related constraints must be met as well. Further, it will be appreciated that such a development effort, even if complex and time consuming, would be a routine undertaking for those of ordinary skill in the art having the benefit of this disclosure.

[0036]

FIG. 1 shows a plurality of relational databases and a typical structure decomposition. Each database is decomposed into m tables, as shown by DB1 table 1 through DB1 table m. Each table is further classified into a set of fields. Each field may be organized from field 1, field 2, up to a maximum field t. Each field includes, for example, one or more of record 11, record 12, and record 1t, where each record comprises the same set of fields (any particular field of a given record is a non-null Data (n
on-null data) or not.

One aspect of the present invention is the collection and display of structural information from any of a number of relational databases organized according to different file format specifications. For example, one database is Mic
Microsoft Access database 110, another database is Oracle database 1
20. Yet another database is Sy
base database 130. In accordance with the present invention, the structural information may be displayed in a browsable representation. Once the structural information has been collected and displayed, it can be manipulated in virtually any desired manner, as is well known to those skilled in the art having the benefit of this disclosure.

One approach to implementing this aspect of the invention is to establish a file that contains configuration information that describes the database it represents. Such a file can be named by the user in the same manner as when a document is stored by a word processor. This file can also be updated, edited, and resaved.

The first step in building this browsable structure for one or more relational databases is to programmatically describe each database displayed. Thereby, the structure of the database is determined. To accomplish this, the program user must specify the database name, as well as its IP address (or server name) and access methodology (eg, JDB
C, SQL, IP socket, etc.). This information can be entered using a data entry routine in a suitably designed computer program (eg, a dialog box with blank-fill fields, drop-down menus, checkboxes, radio buttons, etc.) and written to a file. It can be saved (and this information can of course be entered manually by directly editing the appropriate file or files, for example using a text editor). If this list or table of database information is already saved, this information can be entered, for example, by specifying a specific database from the list or table using point-and-click or drag-and-drop techniques. Can be done.
The stored information can be used whenever database access is required.

Referring to FIG. 2, when information is provided to the program, the program accesses the data dictionary of each database, and includes table structures, field names, data types, definitions, and all other structural information. Is extracted. (Or, such information may be provided as described in the preceding paragraph.) This information may be displayed to the user in the browsing window 200 shown in FIG. Prior to any editing by the user, the program displays the extracted database as a list of table names in the root directory. As an example, FIG. 2 illustrates a list of table names 210 in a root directory 220. Compared to a standard PC file browser, these table names correspond to a special type of subcategory. When one of these table names is opened for browsing, the field names of the selected table are listed as if they were files, for example, the list of field names 230 in FIG. To be. Thus, each field name corresponds to an inverted leaf of the tree. Initially, the tree looks flat and can be quite difficult to navigate, but as more structure is added, navigation through the tree becomes more intuitive and faster.

Referring to FIG. 3, one of the problems in integrating data structures from any collection of relational databases is that some databases may have the same table name or definition for different record content definitions. Field names and the use of different names in different databases for the same or similar content definitions. (By analogy, the word "chips" in the United States means potato chips. , In the UK, it means what Americans would call French fries: the same name is used to identify different definitions of content, and another analogy is that in US mail addresses, The number immediately after the state name is called the ZIP code, and in other countries, the same number is May be referred to as items. That is, different names are used to name the definition of the same or similar contents.). FIG. 3 illustrates a display that allows a user to remove conflicts between names. To remove conflicts between multiple names, the user may select a name, eg, click or slowly double-click the table name My_Name_C, to edit or change to a name more appropriate for the user. By
Transmit electronic signals. Such edited or modified names are called "aliases" and do not affect the original database, but can be used by the user to refer to the table or field name corresponding to the alias. is there.

As shown in FIG. 4, the user selects a directory and then selects "Ne" from the "File" menu 400.
By selecting "w", a new subdirectory can be created in the selected directory, and the new subdirectory is established. This program allows the user to select one of several new things that can be created. “Folder” is one option. If you select "Folder", the program will display "N
ew_Dir_1 ”(or already“ New_Dir_1 ”).
If “_1” exists, a new subdirectory named “New_Dir_2” is created in the selected subdirectory. This new subdirectory is initially empty. At some point thereafter, the user may select a new subdirectory, for example, by slowly double-clicking "New_Dir_1" and entering a more appropriate name. The user may then select one or more tables or directories and drag and drop it into the newly created subdirectory. For example, as shown in FIG. 5, the table My_Name_C is selected and dragged and dropped to the subdirectory My_Name_XYZ. This newly created subdirectory has the same structure as the selected table.

By repeating the steps displayed in FIGS. 3-5, a new, browsable, integrated data structure can be developed and act as a front end to the table structure contained within the database. This front end allows users to manipulate data from a common interface. The selected front-end interface may be similar to a conventional browser widely used for browsing the file system (eg, Windows Explorer). Also, the data may be provided to a conventional web server, and may be "served" to one or more web browsers known to those of ordinary skill in the art who will benefit from this disclosure.

Referring to FIG. 6, a user can create a new “virtual” table by creating a reference called “link” using the program embodiment of the present invention. In certain embodiments, multiple links are created by selecting a field name and dragging and dropping the selected field name into an empty directory, as shown in FIG.
A table is created. In FIG. 6, for example, the field name My_Field_Name_2 is dragged and dropped into an empty directory New_Dir_1. Following this procedure, any empty directory may be designated as a "virtual" table. In this case, the field name is assigned to the "virtual" table.

When multiple database tables are joined to create a "virtual" table by definition, the database tables include common fields. For this “virtual” table, the fields contained in one of the database tables are designated as “primary keys”, while the corresponding fields in the other joined database tables are designated as “foreign key”. ". (The terms primary key and foreign key are well known in the database art.) Further, multiple field names from different databases may be combined as long as there is sufficient structural information to perform a "join". Can be associated in a "virtual" table.

Referring to FIG. 7, once the browsable integrated data structure is completed, the user can display a directory, table, or field of the integrated data structure by selecting a desired category of folders. It is. Each category represents a particular set of information. Each category is a hierarchical storage tree of folders (hierarchical container tree).
This is displayed as a folder in (t tree). That is, each folder includes a lower hierarchy in the hierarchy. For example,
If a directory name is selected, the contents of that directory will appear in the form of a subdirectory name and a table name along with other selected information. On the other hand, if a table name is selected, the contents of that table will appear in the form of field names, along with other selected information. For example, FIG. 7 shows the table name My_Na
If me_C is selected, the field name Field_
This indicates that Name_1 to Field_Name_4 are displayed on the browsing window 200.

Referring to FIGS. 8 and 9, if a field name is selected, cross-reference information and field descriptor information including other related documents appear. Two types of fields appear: unique fields and associative fields. My_Field_Name_2 in FIG. 8 is an example of a unique field. Specific fields contain information,
The information relates to the descriptor of the record that is part of it,
And it is not pointed to any other database record. In some embodiments, conflicts in the definition of a field are displayed on a screen. In FIG. 8, for example, the details of the unique field list the information.
The field name appears in both the database name and the alias name if an alias has been entered or provided. Associative fields, on the other hand, contain information, which relates between records in one table and records or sets of records in another table. An example of an associative field is a foreign key. FIG.
Is an example of information contained in the associative field, for example, M
Indicates y_Field_Name_1. Database,
And the table name where the field name appears is also displayed.

Another important aspect of the present invention is not only the data structure of any of a plurality of relational databases, but also
The content, or record, of each database is also the ability to allow users to browse. Table-based browsing of the contents of most databases has been considered difficult, if not impossible, primarily because of the large number of records contained in each table. is there. The ability to browse records from various databases
Starting with the individual data in the database and browsing for related records, it is mainly based on the observation that the number of records displayed in any single column in the browser is reasonably well within the display range. ing.

The browsing ability is based on the foreign key structure of the database. A foreign key describes an association in a database and associates a database user with one record in one table and one or more records in another table. Browsing starts with a single record in a table and starts with a foreign key association.
n) to a set of related records in another table that may be located in the same database or a different database. The user may browse another set of records by selecting another record in this set of related records and proceed through another foreign key association leading to another set of related records.

Referring to FIG. 10, in another embodiment of the present invention, the user can select any record as a starting point for browsing from the integrated data structure. If you want to display records from one or more databases, you can select a starting point by first selecting the database name. Next, a table name is selected, and then a field name in the table, which is a primary key, is selected. FIG. 10 shows a starting record 1010, ie, C
DRP-3X1DCS, table name 10 in column header
20, ie, Element_Name, and the primary key value 1030 in the column below the browser's entity section 1040, ie, CDRP-3X1DCS
FIG. The association section 1050 is immediately above the entity section 1040 and includes a relationship or association 1060 (eg, location, DS1 physical port, DS3 physical port, and component) between the starting record 1010 and other records in the database. ).

Referring to FIG. 11, in another embodiment of the present invention, the user is provided with the displayed association 1060.
The program displays a list of related records 1110 that are associated with the starting point record 1010 by the particular browsing direction by selecting one of them.
For example, as shown in FIG. 11, when the user selects the DS3 physical port as the browsing direction, the related records CDRP-3X1DCS-472 to CDRP-3
A list up to X1DCS-481 is displayed. If the user wishes to view other records associated with one record from this list of related records 1110,
Simply repeat the above steps by first selecting that record as the new starting point record.

[0052] In another embodiment of the present invention, the user may also specify a column to display related records. But,
In another embodiment, the user may query for any previously displayed information using the slider 1120 at the bottom of the screen.

It will be apparent to one of ordinary skill in the art having the benefit of this disclosure that any of the foregoing modifications may be implemented by programming one or more suitable general purpose computers with the appropriate hardware. . Programming may be accomplished by use of a computer readable program storage device, and by encoding a program of computer-executable instructions to perform the foregoing operations. This program storage device may take the following form. For example, one or more floppy disks, CDs
ROMs or other optical disks, magnetic tapes, read only memory chips (ROMs), and other forms known or later developed to those skilled in the art.
The program of instructions may be "object code", that is, a binary form that can be executed almost directly by a computer, "source code" that requires compilation or translation before execution, or partially compiled code. It may be an intermediate form. The exact form of the program storage device and the coding of the instructions is not important here.

The specific embodiments disclosed above are illustrative only, as the present invention may be modified and practiced in different but equivalent ways apparent to those skilled in the art having the benefit of the teachings. Furthermore, no limitations are intended to the details of construction or design shown, other than as described in the claims of the invention. It is therefore evident that the particular embodiments disclosed above may be altered or modified, and all such changes are deemed not to depart from the scope and spirit of the invention. Accordingly, the scope of protection of rights is as set forth in the following claims.

A machine-implemented method and apparatus for displaying relationships between records in one or more databases in a browsable format. Each database contains one or more tables. Each table includes one or more fields and one or more records. The method is
(A) displaying the field values of a selected record in a table of a selected database on a display; and (b) possible relationships between the selected record and other records in the database. Displaying on the display a list of the possible relationships, wherein each possible relationship defines a path from the selected record to a list of other records; Receiving a user input signal designating one of the selected relationships as a selected relationship; and (d) at least a portion of a list of records related to the selected record by the selected relationship, referred to as a related records list. (E) adding the related record list and the database to the display. Adding a list of possible relationships with other records to the display, wherein each possible relationship defines a path from the related record list to a list of other records. .

[0056]

The present invention provides database users with the ability to quickly display data stored in any of a plurality of relational databases. Thus, if a database user wants to cross-reference one data record in one relational database with another record in another database, the user does not have to browse through the records in each database one at a time. be able to.

[Brief description of the drawings]

FIG. 1 schematically illustrates a hypothetical plurality of relational databases and a structural decomposition of one of the databases.

FIG. 2 illustrates a display showing a root directory and a corresponding list of table names in a browsing window.

FIG. 3 illustrates a display outlining the procedure by which a user removes conflicts between names.

FIG. 4 illustrates the display on which a new subdirectory has been created.

FIG. 5 illustrates a display where one table is being dragged and dropped into a subdirectory.

FIG. 6 illustrates a display in which a “virtual table” is created using links between fields.

FIG. 7 illustrates a display showing a hierarchical storage tree of folders of one table.

FIG. 8 illustrates a display showing information contained within a unique field.

FIG. 9 illustrates a display showing information contained in an associative field.

FIG. 10 illustrates a display of a process for selecting a record as a starting point.

FIG. 11 illustrates a display of a process for obtaining a record associated with a starting point record.

[Explanation of symbols]

 210 Table name 230 Field name

 ──────────────────────────────────────────────────続 き Continuation of front page (71) Applicant 500478488 6925 Portwest, Suite 110, Houston, Texas 77024, United States of America F term (reference) 5B075 PQ02 PQ42 QT06 5B082 GA03 GC02

Claims (10)

[Claims] 1. A method for displaying relationships between records in a database, the database including a plurality of tables, each table including one or more records divided into one or more fields, ) Determining each structure of the plurality of relational databases; (b) displaying field values of selected records in a table of the databases on a display; and (c) selecting the selected records and the data in the databases. Displaying a list of possible relationships with the other records on the display, wherein each possible relationship defines a path from the selected record to a list of other records. And (d) receiving a user input signal designating one of the possible relationships as a selected relationship. (E) adding at least a portion of a list of records related to the selected record by the selected relationship, referred to as a related record list, to the display; Adding a list of possible relationships to other records in the database to the display, wherein each possible relationship defines a path from the related record list to a list of other records; A method comprising: 2. (g) receiving a user input signal designating a record in the related record list as a new selected record; and (h) for the new selected record.
Repeating the processing of (d) to (f). 3. A method for displaying a relationship between records of a plurality of relational databases having an arbitrary structure, wherein each database includes a plurality of tables, and each table is divided into one or more fields. (A) determining the structure of each of the plurality of relational databases; and (b) determining the structure of each of the plurality of relational databases. Integrating each structure into one front-end integrated data structure; and (c) displaying field values of selected records in one of the plurality of tables in the plurality of relational databases on a display. (D) the selected record and the plurality of relational databases Displaying on the display a list of possible relationships with other records in the display, wherein each possible relationship defines a path from the selected record to a list of other records. (E) receiving a user input signal specifying one of the possible relationships as a selected relationship; and (f) the record selected by the selected relationship, called a related record list. Adding at least a portion of the list of records related to the display to the display; and (g) adding to the display a list of possible relationships between the related record list and other records in the plurality of relational databases. Wherein each possible relationship defines a path from the related record list to a list of other records. A method comprising: 4. The method according to claim 3, wherein (a) receiving a user input signal designating a certain record in the related record list as a newly selected record; and (b) for the newly selected record.
Repeating the processing of (e) to (g) above. 5. The method according to claim 5, wherein the step of integrating the respective structures includes: a step of deleting a name of a table and a field that conflict in the front-end integrated data structure; Establishing a link between the fields. 6. The method of claim 6, wherein the step of deleting the conflicting names comprises: for the selected name, displaying a cross-reference list for use of the selected name in the plurality of relational databases. 6. The method of claim 5, comprising: receiving from the user at least one edit command specifying an operation to be performed on a table or a selected field; and executing the at least one edit command. The described method. 7. The at least one editing command comprises:
Receiving an alias specifier designating an alias for the selected name; and displaying the alias instead of the selected name.
The method of claim 6. 8. The method of claim 7, further comprising storing a representation of a relationship between the alias and the selected name. 9. A computer readable medium coded with instructions for performing the method according to claim 1 when executed by a computer. 10. A computer programmed to perform the method according to claim 1.