This invention relates to file storage, organization in general, and more particularly to the retrieving a file from a file server using one or more file attributes using standard internet protocols.
It is now commonplace to retrieve data files from storage locations. In the traditional situation, files are stored on the same system handling the request for the file. Situations arise where it is desired to have several clients access a common set of files. This can be accomplished by setting up a file storage arrangement that is shared across a network. In such file storage arrangements, whether the arrangement serves one client or a plurality of clients, the desired file is retrieved by specifying the name of the file, as well as the full directory path to the file, when required. Thus, files may be moved about over the network arbitrarily.
Such an arrangement has problems when metadata is associated with the different files. Typically, metadata associated with a file is placed in a separate database. Thus, the database must be moved each time a file is moved.
In addition, the storage of files is typically done by placing the file in a folder, somewhere in hierarchical directory structure. Using hierarchical structures have a flaw in that they require the person filing a document to pick a specific attribute about that file so that a specific folder can be selected to store the file in. Ideally, all of the files in that specific folder would have the same common attribute. However, a file may have several attributes (for example author, subject, language, etc.) that are important to that file. The dilemma faced by the person creating the file structure, is how to create a hierarchical structure where some people want to find the files by one attribute, such as author, while other people may want to find the files by another attribute, such as subject, and while still others by language. In order to allow the same document to be found in by searching different attributes, e.g. the author, subject, and language folders, one would need to create three copies of the document, and put one copy in each type folder.
One example of a complex file structure is the audio file structure used in interactive voice response (IVR) systems. In order for a script to play a specific audio file, the <audio> tag in the script must provide a fully resolved address or URL pointing to the web address where the desired audio file resides. The fully resolved address is a complete address to the file through the existing hierarchical structure. The server then directs the request to the desired address and the desired audio file is retrieved from the specified address.
While a hierarchical directory structure with full path-name access is effective, it has some drawbacks. Many applications, particularly media applications which use audio files, have thousands of such audio files. An application may have the same audio files recorded in multiple languages, multiple speakers, or different emotional tones (stem, happy). Deciding on a hierarchical folder and file-naming scheme can be a challenge. Should one file the files according to language? To speaker? To content? If one files according to language, how does one find all the files by a specific speaker? Thus, using a hierarchical storage structure and fully resolved path names to retrieve a particular file is cumbersome and often limiting. Storing files in a nonhierarchical structure and requesting the files by attribute, provides a more flexible approach to file access than hierarchical structures.
There is disclosed systems and methods for retrieving files from a file server using file attributes. In one embodiment, a file request is formed from a string of file attributes using the HTTP protocol. For example, suppose a desired file comprises a text document, then the file attributes that may be used may include one or more of file-type, version, date, font, content, language, and/or author. These attributes are placed after a “?” in the URL address string. The HTTP query protocol is such that all of the attributes which follow the “?” will be passed unmodified through intermediary elements such as a browser, so that the full attribute list reaches the file server for resolution. The audio file server accepts the attributes and parses them to resolve which file to retrieve. Note that more than one file may be retrieved or located by the request. The retrieved file is then returned to the requesting user browser.
One type of file server is an audio file server (AFS) for use in interactive voice recognition (IVR) systems. VXML or SALT browsers interpret VXML or SALT script documents to determine dialog flow. VXML or SALT scripts can contain requests to play audio files as part of the dialog. Normally, the audio file play request must contain a fully-resolved path to the appropriate audio file for the audio file server to access the file. Using an attribute-based files server according to an embodiment of the invention, the scripts can specify URLs with attribute lists instead of paths. Query attributes such as a text version of the desired message along with other attributes required in the audio file, such as recorded by John, spoken in a happy voice, spoken in English, etc may be used to retrieve a particular file. The attribute list is constructed in such a way in the request that browsers will pass the attribute list unchanged to the audio file server. Thus, the audio file server is accessed to retrieve pre-recorded audio files using file attributes.
In this way, IVR application developers can specify many attributes of the required audio file, including the content, speaker, language, dialect, emotion, and other attributes and utilize standard voice browsers to access those files without having to know the specific hierarchical path of the location of the file in the server.
The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter which form the subject of the claims of the invention. It should be appreciated by those skilled in the art that the conception and specific embodiment disclosed may be readily utilized as a basis for modifying or designing other structures for carrying out the same purposes of the present invention. Many other methodologies could be used to present attribute lists to a file server. It should also be realized by those skilled in the art that such equivalent constructions do not depart from the spirit and scope of the invention as set forth in the appended claims. The novel features which are believed to be characteristic of the invention, both as to its organization and method of operation, together with further objects and advantages will be better understood from the following description when considered in connection with the accompanying figures. It is to be expressly understood, however, that each of the figures is provided for the purpose of illustration and description only and is not intended as a definition of the limits of the present invention.
For a more complete understanding of the present invention, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
The method just discussed assumes that the full path route to the desired file is known and used. This is a fully resolved address location.
User 201 communicates with server 204 through a network 203. The network may be a LAN, a WAN, a WIFI, the Internet, or other network connection. Note that user 201 may be directly connected with server 204 without a network connection. For example, the server may be a personal computer and the user may be accessing a files stored therein.
To locate a particular file, the user generates a file request 202 that comprises a plurality of file attributes instead of a location path in the server. The file request is placed with a URL request that is delivered to the file server 204.
The file server 204 includes a plurality of files 206, namely file 1 to file M, and a search engine 205. The parser 207 receives the request 202 and parses the attributes from the URL request 202. The attributes are then passed to the search engine 205. The search engine 205 uses the attributes to locate a particular file or files to satisfy the file request 202.
The file request 202 generated by the user 201 takes advantage of the HTTP protocol which allows data contained in a communication line to be passed to a target destination if that data falls after the query marker “?” in the communication line. This is known as a query URL and in the context of this disclosure it is also known as request URL. The W3C standard for URLs allows a question mark followed by any data intended for the final recipient of the request. Data following the “?” is defined as a “request”, which will be ignored by intermediate entities handling the request. The request data is intended to be handled and acted upon by the final server targeted in the URL. Thus, by establishing file server 204 as the target, an application from the user 201 creates a request using a scripting protocol.
For example, suppose the desired file is a text document that is written in a blue Times New Roman font and includes the content of ‘hello world’ and is written in English. The request may include attributes (and their respective values) such as file-type (text), color (blue), font (Times New Roman), content (‘hello world’), and language (English).
Advantage is taken of the HTTP protocol which allows data contained in a communication line to be passed to a target destination if that data falls after the query marker “?” in the communication line. Thus, by establishing file server 33 as the target, an application from, for example, application server 11, creates a document using the VXML scripting protocol. When browser 12 requests the document, application server 11 passes the document to browser 12, using, for example, the standard HTTP protocol.
Within the VXML document, there is a VXML audio tag, with a query URL describing various attributes of the required file, which may include the file's text, the speaker, and, its language. The audio tag causes an HTTP request to be sent to the file server including the query URL with all of its' attributes. The HTTP request does not have a fully-resolved address pointing to the specific audio file to be played. Instead, the HTTP request contains a query attribute string (metadata), which the file server uses to determine the appropriate prerecorded file to return to the browser. File server 33 must decode (or resolve for itself) which file message to return.
In such a situation it is possible to specify many attributes about the required file. Some of the most significant file attributes to be specified for an audio file would be the text of the utterance to be spoken, the speaker, and, the spoken language. Other attributes, such as whether the message was recorded by a male or female, or who recorded the message, the age of the recorder (child, adult, etc.), the emotional feel of the utterance, etc., can also be specified. In general, all metadata attributes are optional, but specific sets of attributes may be required in certain applications for correct operation. The file server then determines which file to retrieve based on the attributes specified in the request. In some applications, message IDs, and audio file set IDs will replace the audio file text as a key identifying element of the audio file.
File server 33 resolves the final addressing in the audio file request URL and then parses the query attribute string via URL parser 353. The file server analyzes the various query attributes, looking each one up in a pre-generated attribute index, such as index store 355, of all of the audio files stored in the audio file server. The fully resolved message is then sent back to browser 12 from .wav file storage 358. If more than one file matches the search criteria, the file server will return the best match. If two or more files match equally, the audio file server will arbitrarily pick one of the equal set to return.
In
Line 302b is a further example where it is desired to use the filename of the audio file which is a UUID such as 5D3G-4YSD6-AUNX8 as the identification. Line 302b was formed from the VMXL script of line 302a. The file server must resolve the location of this file by using its attributes. In this case, there is only one attribute—the Universal Unique ID (UUID). Using a UUID is important naming audio files for storage on the file server, since UUIDs have the property that they can be generated from many sources, but the chances of any generated UUID being the same as another is minimal. In this way, one can be certain with a high degree of confidence that the audio files will have unique names on the audio file server. Note that the UUID file name is usually assigned to the file before the file is placed on the server, just as the metadata is usually placed in a file before it is placed on the file server.
Line 303b is a URL that asks the file server to find the message, “your account balance is” spoken by female number 345, in French. Line 303b was formed from the VMXL script of line 303a. File server 33 upon receiving the message, requests search engine 356 (
As discussed above with respect to messages 300 through 303, the file server had to identify which message was desired by parsing through the message, essentially by elimination. For example, assume message 303 is desired, then file server 33 would first find all messages with the words “Your account balance is.” Then the file server will, for example, narrow its search to files spoken by female 345 only, and only in French. Lastly, all of the remaining messages (i.e., “Your account balance is,” spoken by female 345 in all languages) will be eliminated, except for the message recorded in French. Thus, server 33 will return the message, “Your account balance is,” spoken in French by female 345. This message would typically be a .wav file and would be returned to browser 12 in response to communication line 303 being sent to browser 12 from, for example, application server 11. The returned file would still contain its metadata attributes, so the receiving entity can check the validity of the returned file.
Although the present invention and its advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims. Moreover, the scope of the present application is not intended to be limited to the particular embodiments of the process, machine, manufacture, composition of matter, means, methods and steps described in the specification. As one of ordinary skill in the art will readily appreciate from the disclosure of the present invention, processes, machines, manufacture, compositions of matter, means, methods, or steps, presently existing or later to be developed that perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein may be utilized according to the present invention. Accordingly, the appended claims are intended to include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps.
The present application is related to copending and commonly assigned U.S. patent application Ser. No. ______ [Attorney Docket No. 47524-P137US-10501428] entitled “SYSTEM AND METHOD FOR MANAGING FILES ON A FILE SERVER USING EMBEDDED METADATA AND A SEARCH ENGINE,” U.S. patent application Ser. No. ______ [Attorney Docket 47524-P139US-10503962] entitled “SYSTEM AND METHOD FOR DEFINING AND INSERTING METADATA ATTRIBUTES IN FILES,” and U.S. patent application Ser. No. ______ [Attorney Docket No. 47524-P140US-10506201] entitled “SYSTEM AND METHOD FOR DEFINING, SYNTHESIZING AND RETRIEVING VARIABLE FIELD UTTERANCES FROM A FILE SERVER,” filed concurrently herewith, the disclosures of which are hereby incorporated herein by reference.